← 返回题目
题库练习 Nested Segments
← 上一题 下一题 →

A10298 | Nested Segments

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

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
C++ 编辑器
输入
输出