跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1294. Nested Segments

    ID: 1300 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 5 上传者: 标签>数据结构排序编程与模拟进阶难度共享题库Codeforces英文题面题目来源题面语言

Nested Segments

题目描述

D. Nested Segments
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Input

The first line contains a single integer n (1≤n≤2·105) − the number of segments on a line.

Each of the next n lines contains two integers li and ri (-109≤li<ri≤109) − 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.

Output

Print n lines. The j-th of them should contain the only integer aj − the number of segments contained in the j-th segment.

Examples
Input
4
1 8
2 3
4 7
5 6
Output
3
0
1
0
Input
3
3 4
1 5
2 6
Output
0
1
1

题目来源：fps-www.educg.net-codeforce-1-2833.xml.zip；FPS 共享题包，题包内第 785 题。保留原作者与原赛事署名。