2009_10-5_Practice1 C

<!-- @page { margin: 2cm } P { margin-bottom: 0.21cm } -->

Interval Challenge

Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 0     Accepted Submission(s): 0

Problem Description

 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 ?

 

Input

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: A _i and Bi ( A _i , B _i will not exceed the unsigned 32-bit integer ) specifying the two parameters described above.

 

Output

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. 

 

Sample Input

3

0 1

-1 2

-2 3

 

2

0 1

0 1

 

Sample Output

2 1 0

0 0

 

Author

WhereIsHeroFrom