传送门
就是
1D 排序
2D CDQ
3D BIT
没了,上代码,洛谷Rank6
代码:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#define ll long long
using namespace std;
inline int read(){
int x=0;char ch=' ';int f=1;
while(ch!='-'&&(ch<'0'||ch>'9'))ch=getchar();
if(ch=='-')f=-1,ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
return x*f;
}
const int N=2e5+5;
struct data{
int a,b,c,cnt,ans;
inline bool operator < (const data& y) const {
return b==y.b?c<y.c:b<y.b;
}
inline bool operator == (const data& y) const {
return a==y.a&&b==y.b&&c==y.c;
}
}d[N],a[N];
int n,m;
int t[N],ans[N];
inline void add(int x,int v){
while(x<=m)t[x]+=v,x+=x&-x;
}
inline int query(int x){
int ans=0;
while(x)ans+=t[x],x-=x&-x;
return ans;
}
inline bool cmp(const data& x,const data& y){
if(x.a==y.a)return x<y;
return x.a<y.a;
}
inline void merge_sort(int l,int mid,int r){
int p=l,q=mid+1,num=l-1;
while(p<=mid&&q<=r){
if(d[p]<d[q])a[++num]=d[p++];
else a[++num]=d[q++];
}
while(p<=mid)a[++num]=d[p++];
while(q<=r)a[++num]=d[q++];
for(int i=l;i<=r;++i)d[i]=a[i];
}
inline void cdq(int l,int r){
if(l==r)return;
int mid=(l+r)>>1;
cdq(l,mid);
cdq(mid+1,r);
int p=l,q=mid+1;
while(q<=r){
while(p<=mid&&d[p].b<=d[q].b){
add(d[p].c,d[p].cnt);
++p;
}
d[q].ans+=query(d[q].c);
++q;
}
for(int i=l;i<p;++i)add(d[i].c,-d[i].cnt);
merge_sort(l,mid,r);
}
int main(){
n=read();m=read();
for(int i=1;i<=n;++i)d[i].a=read(),d[i].b=read(),d[i].c=read(),d[i].cnt=1,d[i].ans=0;
sort(d+1,d+n+1,cmp);
int num=0;
for(int i=1;i<=n;++i){
int k=i+1;
while(k<=n&&d[i]==d[k])k++;
k--;
d[i].cnt+=k-i;
d[++num]=d[i];
i=k;
}
cdq(1,num);
for(int i=1;i<=num;++i)ans[d[i].ans+d[i].cnt-1]+=d[i].cnt;
for(int i=0;i<n;++i)printf("%d\n",ans[i]);
return 0;
}