cdq分治

letonggg

于 2022-08-04 22:21:18 发布

阅读量110

点赞数 1

文章标签：算法 c++

本文链接：https://blog.csdn.net/letonggg/article/details/126167371

版权

P3810 【模板】三维偏序（陌上花开）

#include<bits/stdc++.h>
using namespace std;
const int N=200100;
struct node{
	int x,y,z,id,cnt;
}h[N],q[N];
int n,k,c[N],f[N],cnt[N],ans[N];
bool cmpa(node a,node b)
{
	if(a.x!=b.x) return a.x<b.x;
	if(a.y!=b.y) return a.y<b.y;
	return a.z<b.z;
}
int lowbit(int x){return x&(-x);}
void insert(int x,int val)
{
	while(x<=k){
		c[x]+=val;
		x+=lowbit(x);
	}
}
int query(int x)
{
	int as=0;
	while(x){
		as+=c[x];
		x-=lowbit(x);
	}
	return as;
}
void cdq(int l,int r)
{
	if(l==r) return;
	int mid=l+r>>1;
	cdq(l,mid);cdq(mid+1,r);
	int p1=l,p2=mid+1,p=l;
	while(p1<=mid&&p2<=r){
		if(h[p1].y<=h[p2].y) q[p]=h[p1],insert(h[p1].z,cnt[h[p1].id]),p1++,p++;
		else q[p]=h[p2],f[h[p2].id]+=query(h[p2].z),p2++,p++;
	}
	while(p1<=mid) q[p]=h[p1],insert(h[p1].z,cnt[h[p1].id]),p1++,p++;
	while(p2<=r) q[p]=h[p2],f[h[p2].id]+=query(h[p2].z),p2++,p++;
	for(int i=l;i<=mid;i++) insert(h[i].z,-cnt[h[i].id]);
	for(int i=l;i<=r;i++) h[i]=q[i];
}
int main()
{
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++) scanf("%d%d%d",&h[i].x,&h[i].y,&h[i].z);
	sort(h+1,h+n+1,cmpa);
	int num=0;q[++num]=h[1];cnt[num]=1;q[num].id=num;
	for(int i=2;i<=n;i++){
		if(h[i].x==h[i-1].x&&h[i].y==h[i-1].y&&h[i].z==h[i-1].z) cnt[num]++;
		else q[++num]=h[i],cnt[num]=1,q[num].id=num;
	}
	for(int i=1;i<=num;i++) h[i]=q[i];
	cdq(1,num);
	for(int i=1;i<=num;i++) ans[f[i]+cnt[i]-1]+=cnt[i];
	for(int i=0;i<n;i++) printf("%d\n",ans[i]);
	return 0;
}