CF1000C.Covered Points Count

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given $n$ segments on a coordinate line; each endpoint of every segment has integer coordinates. Some segments can degenerate to points. Segments can intersect with each other, be nested in each other or even coincide.

Your task is the following: for every $k \in [1..n]$ , calculate the number of points with integer coordinates such that the number of segments that cover these points equals $k$ . A segment with endpoints $l_i$ and $r_i$ covers point $x$ if and only if $l_i \le x \le r_i$ .

输入格式

The first line of the input contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of segments.

The next $n$ lines contain segments. The $i$ -th line contains a pair of integers $l_i, r_i$ ( $0 \le l_i \le r_i \le 10^{18}$ ) — the endpoints of the $i$ -th segment.

输出格式

Print $n$ space separated integers $cnt_1, cnt_2, \dots, cnt_n$ , where $cnt_i$ is equal to the number of points such that the number of segments that cover these points equals to $i$ .

输入输出样例

输入#1
```
3
0 3
1 3
3 8
```
输出#1
```
6 2 1 
```
输入#2
```
3
1 3
2 4
5 7
```
输出#2
```
5 2 0 
```

说明/提示

The picture describing the first example:

Points with coordinates $[0, 4, 5, 6, 7, 8]$ are covered by one segment, points $[1, 2]$ are covered by two segments and point $[3]$ is covered by three segments.

The picture describing the second example:

Points $[1, 4, 5, 6, 7]$ are covered by one segment, points $[2, 3]$ are covered by two segments and there are no points covered by three segments.

首页