BZOJ3262 陌上花开

好文艺的题目。

自己犯的**错误不想再提了，特别注意这题要求三个都相等时也计入统计，所以就特别处理一下。

裸的三位偏序，CDQ+树状数组

By：大奕哥

#include<bits/stdc++.h>
using namespace std;
const int N=200005;
const int M=400005;
int n,k,tim,ans[N],t[M],v[M],f[N],cnt,top;
struct node
{
    int s,c,m,id,num;
}q[M],qq[M];
inline int lowbit(int x){return x&(-x);}
void add(int x,int w)
{
    for(;x<=k;x+=lowbit(x))
    {
        if(tim!=v[x])
        {
            v[x]=tim;t[x]=w;
        }
        else t[x]+=w;
    }
}
int query(int x)
{
    int an=0;
    for(;x;x-=lowbit(x))
    {
        if(v[x]==tim)an+=t[x];
    }
    return an;
}
bool cmp1(node a,node b)
{
    if(a.s==b.s)
    {
        return a.c==b.c?a.m<b.m:a.c<b.c;
    }
    return a.s<b.s;
}
bool cmp2(node a,node b)
{
    return a.c==b.c?a.m<b.m:a.c<b.c;
}
void solve(int l,int r)
{
    if(l==r)return;
    int mid=(l+r)>>1;
    solve(l,mid);solve(mid+1,r);
    sort(q+l,q+mid+1,cmp2);sort(q+mid+1,q+r+1,cmp2);
    int i=l,j=mid+1;tim++;
    while(j<=r)
    {
        while(i<=mid&&q[i].c<=q[j].c)add(q[i].m,q[i].num),++i;
        q[j].sum+=query(q[j].m);++j;
    }
}
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;++i)
    {
        scanf("%d%d%d",&qq[i].s,&qq[i].c,&qq[i].m);
    }sort(qq+1,qq+n+1,cmp1);
    for(int i=1;i<=n;++i)
    {
        cnt++;
        if(qq[i].c!=qq[i+1].c||qq[i].s!=qq[i+1].s||qq[i].m!=qq[i+1].m)
        {
            q[++top]=qq[i];q[top].num=cnt;cnt=0;
        }
    }
    solve(1,top);
    for(int i=1;i<=top;++i)
    ans[q[i].sum+q[i].num-1]+=q[i].num;
    for(int i=0;i<n;++i)printf("%d
",ans[i]);
    return 0;
}