2 人解决，13 人已尝试。
3 份提交通过，共有 41 份提交。
9.8 EMB 奖励。
单点时限: 3.0 sec
内存限制: 256 MB
Give you N ( 1 <= N <= 200000 ) intervals, represented as [A, B], for example , interval s represented as [As, Bs].
For two intervals s and t, we say S covered by T if At <= As and Bs <= Bt.
Now my problem is easy, just tell me the question below:
For each interval, how many intervals can cover it but not covered by it ?
The input contains multiple test cases.
For each test case, the first line is an integer N ( 1 <= N <= 200000 ), which is the number of intervals. Then come N lines, the i-th of which contains two integers: Ai and Bi ( Ai , Bi will not exceed the unsigned 32-bit integer ) specifying the two parameters described above.
For each test case, output one line containing n space-separated integers, the i-th of which specifying the number of intervals that can cover it but not covered by it.
3 0 1 -1 2 -2 3 2 0 1 0 1
2 1 0 0 0
2 人解决，13 人已尝试。
3 份提交通过，共有 41 份提交。
9.8 EMB 奖励。
创建: 16 年，2 月前.
修改: 8 年，1 月前.
最后提交: 1 周，5 天前.
来源: N/A