CF652D.Nested Segments

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

You are given $n$ segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.

输入格式

The first line contains a single integer $n$ ( $1<=n<=2·10^{5}$ ) — the number of segments on a line.

Each of the next $n$ lines contains two integers $l_{i}$ and $r_{i}$ ( -10^{9}<=l_{i}<r_{i}<=10^{9} ) — the coordinates of the left and the right ends of the $i$ -th segment. It is guaranteed that there are no ends of some segments that coincide.

输出格式

Print $n$ lines. The $j$ -th of them should contain the only integer $a_{j}$ — the number of segments contained in the $j$ -th segment.

输入输出样例

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

首页