CodeForces 652D Nested Segments （树状数组）

题意：给你n个区间，问每个区间包含了多少个区间

思路：先离散化一波，然后就是显然的树状数组瞎搞了...和POJ2481差不多

#include <cstdio>
#include <queue>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <set>
#include <ctime>
#include <cmath>
#include <cctype>
using namespace std;
#define maxn 200000+100
#define LL long long
int cas=1,T;
int c[maxn];
int ans[maxn];
struct Node
{
	int l,r,id;
}node[maxn];
bool cmp(Node x,Node y)
{
	if (x.r==y.r) return x.l<y.l;
	return x.r<y.r;
}
bool cmp1(Node x,Node y)
{
	if (x.l==y.l)
		return x.r<y.r;
	return x.l>y.l;
}
int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int v)
{
	while (x<=maxn)
	{
		c[x]+=v;
		x+=lowbit(x);
	}
}
int sum(int x)
{
	int ans = 0;
	while (x)
	{
		ans+=c[x];
		x-=lowbit(x);
	}
	return ans;
}
int main()
{
	int n;
	scanf("%d",&n);
	for (int i = 1;i<=n;i++)
	{
		scanf("%d%d",&node[i].l,&node[i].r);
		node[i].id=i;
	}
	sort(node+1,node+n+1,cmp);
    for (int i = 1;i<=n;i++)
	{
		node[i].r=i;
	}
	sort(node+1,node+1+n,cmp1);
	for (int i = 1;i<=n;i++)
	{
		ans[node[i].id]=sum(node[i].r);
		add(node[i].r,1);
	}
    for (int i = 1;i<=n;i++)
		printf("%d\n",ans[i]);
	//freopen("in","r",stdin);
	//scanf("%d",&T);
	//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}

Description

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·10⁵) — the number of segments on a line.

Each of the next n lines contains two integers l_i and r_i ( - 10⁹ ≤ l_i < r_i ≤ 10⁹) — 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 a_j — the number of segments contained in the j-th segment.

Sample Input

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