记录编号	586739	评测结果	AAAAAAAAAA
题目名称	孙伯符降临	最终得分	100
用户昵称	┭┮﹏┭┮	是否通过	通过
代码语言	C++	运行时间	0.128 s
提交时间	2024-02-27 19:12:04	内存使用	9.12 MiB

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e5+10;
int n;
int ans[N];
struct made{
    int a,b,id;
}a[N];
bool cmp(made x,made y){
    if(x.a != y.a)return x.a < y.a;
    if(x.b != y.b)return x.b < y.b;
    return x.id > y.id;
}
struct BIT{
    ll c[1000010];
    inline int lowbit(int x){return x & (-x);}
    void add(int x,int val){for(;x <= 1e6;x += lowbit(x))c[x] += val;}
    ll ask(int x){
        ll ans = 0;
        for(;x > 0;x -= lowbit(x))ans += c[x];
        return ans;
    }
}t;
int main(){
    freopen("sunbofu.in","r",stdin);
    freopen("sunbofu.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i <= n;i++)scanf("%d%d",&a[i].a,&a[i].b),a[i].id = i;
    sort(a+1,a+1+n,cmp);
    for(int i = 1;i <= n;i++){
        ans[a[i].id] += t.ask(a[i].b);
        t.add(a[i].b,1);
    }
    for(int i = 1;i <= n;i++)printf("%d\n",ans[i]);

	return 0;

}