3262: 陌上花开
Time Limit: 20 Sec Memory Limit: 256 MBSubmit: 1414 Solved: 634
[ Submit][ Status][ Discuss]
Description
Input
Output
Sample Input
3 3 3
2 3 3
2 3 1
3 1 1
3 1 2
1 3 1
1 1 2
1 2 2
1 3 2
1 2 1
Sample Output
1
3
0
1
0
1
0
0
1
HINT
1 <= N <= 100,000, 1 <= K <= 200,000
解题思路:cdq分治。步骤对第一维进行排序,然后进行分治,
分别处理两边,然后处理右边对左边的影响,用树状数组维护。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int n,k,cnt;
struct ss
{
int x,y,z,dui,size;
}q[110000],g[110000];
int zhi[210000];
int ans[210000];
int zhong[210000];
inline int read()
{
char y; int x=0,f=1; y=getchar();
while (y<'0' || y>'9') {if (y=='-')f=-1; y=getchar();}
while (y>='0' && y<='9') {x=x*10+int(y)-48; y=getchar();}
return x*f;
}
bool cog(ss xg,ss yg)
{
if (xg.y!=yg.y)
return xg.y<yg.y;
return xg.z<yg.z;
}
void change(int o,int sug)
{
while (o<=k)
{
zhi[o]+=sug; o+=o&-o;
}
}
int query(int o)
{
int sug=0;
while (o>0)
{
sug+=zhi[o]; o-=o&-o;
}
return sug;
}
void solve(int l,int r)
{
if (l==r) return;
int mid=(l+r)/2;
solve(l,mid); solve(mid+1,r);
sort(g+l,g+mid+1,cog); sort(g+mid+1,g+r+1,cog);
int tail=l;
for (int i=mid+1;i<=r;++i)
{
while (tail<mid+1 && g[i].y>=g[tail].y)
{
change(g[tail].z,g[tail].size);
++tail;
}
ans[g[i].dui]+=query(g[i].z);
}
for (int i=l;i<=tail-1;++i)
{
change(g[i].z,-g[i].size);
}
}
bool cmp(ss xg,ss yg)
{
if (xg.x!=yg.x)
return xg.x<yg.x;
if (xg.y!=yg.y)
return xg.y<yg.y;
return xg.z<yg.z;
}
int main()
{
n=read(); k=read();
for (int i=1;i<=n;++i)
{
q[i].x=read(); q[i].y=read(); q[i].z=read(); q[i].dui=i;
}
sort(q+1,q+n+1,cmp); cnt=0;
for (int i=1;i<=n;++i)
{
if (q[i].x!=q[i-1].x || q[i].y!=q[i-1].y || q[i].z!=q[i-1].z) ++cnt,g[cnt]=q[i],g[cnt].dui=cnt;
++g[cnt].size;
}
solve(1,cnt);
for (int i=1;i<=n;++i)
{
zhong[ans[g[i].dui]+g[i].size-1]+=g[i].size;
}
for (int i=0;i<=n-1;++i)
{
printf("%d\n",zhong[i]);
}
}