2017 3 17 线段树套主席树

    写了半场考试你告我正解是bitset？？而且竟然比我跑得快？？

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define inf 0x3f3f3f3f
#define N 50005
#define ls a[x].l,a[y].l,l,mid
#define rs a[x].r,a[y].r,mid+1,r
using namespace std;
int n;
const int mx=50000;
inline int read()
{
    char c=getchar();int p=0,f=1;
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9')p=p*10+c-'0',c=getchar();
    return p*f;
}
struct fk
{
    struct point
    {
        int x,y;
        friend bool operator < (const point &aa,const point &bb)
        {
            if(aa.y!=bb.y)return aa.y<bb.y;
            return aa.x<bb.x;
        }
    }dian[N];
    int lix[N+5],liy[N+5],cnt1,cnt2,pre[mx+5],now[mx+5];
    struct node
    {
        int l,r,sum;
    }a[N*350];int cnt;
    int qur(int x,int y,int l,int r,int ll,int rr)
    {
        if(l>=ll&&r<=rr)return a[x].sum-a[y].sum;
        int mid=(l+r)>>1;
        if(ll>mid)return qur(rs,ll,rr);
        if(rr<=mid)return qur(ls,ll,rr);
        return qur(ls,ll,rr)+qur(rs,ll,rr);
    }
    void insert(int x,int y,int l,int r,int pos)
    {
        if(l==r)
        {
            a[x].sum=a[y].sum+1;
            return ;
        }
        int mid=(l+r)>>1;
        if(pos<=mid)
        {
            if(!a[x].l)a[x].l=++cnt;
            a[x].r=a[y].r;
            insert(ls,pos);
        }
        else 
        {
            if(!a[x].r)a[x].r=++cnt;
            a[x].l=a[y].l;
            insert(rs,pos);
        }
        a[x].sum=a[a[x].l].sum+a[a[x].r].sum;
        return ;
    }
    vector<int>root[N*3],xx[N*3];
    vector<int>::iterator it;
    struct nd
    {
        int pr,yuan;
        nd(int x,int y)
        {
            yuan=x;pr=y;
        }
        friend bool operator < (const nd &aa,const nd &bb)
        {
            return aa.pr<bb.pr;
        }
    };
    vector<nd>pai[N*3];
    void jia(int x)
    {
        int pr=-1,prroot=0;
        root[x].push_back(0);xx[x].push_back(-1);
        for(int i=0;i<pai[x].size();i++)
        {
            int pp=pai[x][i].yuan;
            if(pre[pp]==pr)
            {
                root[x][root[x].size()-1]=++cnt;
                insert(root[x][root[x].size()-1],prroot,0,mx,dian[pp].x);
            }
            else
            {
                root[x].push_back(++cnt);
                xx[x].push_back(pre[pp]);
                insert(root[x][root[x].size()-1],prroot,0,mx,dian[pp].x);
            }
            pr=pre[pp];
            prroot=root[x][root[x].size()-1];
        }
        xx[x].push_back(0x3f3f3f3f);
        return ;
    }
    void build(int x,int l,int r,int ll,int rr)
    {
        if(ll>rr)return ;
        int mid=(l+r)>>1;
        int ed=rr;
        for(int i=ll;i<=rr;i++)
        {
            if(dian[i].y<=mid)ed=i;
            pai[x].push_back(nd(i,pre[i]));
        }
        sort(pai[x].begin(),pai[x].end());
        jia(x);
        if(l==r)return ;
        build(x*2,l,mid,ll,ed);
        build(x*2+1,mid+1,r,ed+1,rr);
    }
    int qu(int x,int l,int r,int ll,int rr,int qx,int qy)
    {
        if(ll<=l&&rr>=r)
        {
            int ha=0;int ta=xx[x].size()-1;
            while(ha<=ta)
            {
                int mid=(ha+ta)>>1;
                if(xx[x][mid]<ll)ha=mid+1;
                else ta=mid-1;
            }
            return qur(root[x][ta],0,0,mx,qx,qy);
        }
        int mid=(l+r)>>1;
        if(ll>mid)return qu(x*2+1,mid+1,r,ll,rr,qx,qy);
        if(rr<=mid)return qu(x*2,l,mid,ll,rr,qx,qy);
        return qu(x*2+1,mid+1,r,ll,rr,qx,qy)+qu(x*2,l,mid,ll,rr,qx,qy);
    }
    int que(int x1,int y1,int x2,int y2)
    {
        if(y1>liy[cnt2]||x1>lix[cnt1])return 0;
        if(y2<liy[1]||x2<lix[1])return 0;
        y1=lower_bound(liy+1,liy+cnt2+1,y1)-liy;
        x1=lower_bound(lix+1,lix+cnt1+1,x1)-lix;
        if(y2<liy[cnt2])y2=upper_bound(liy+1,liy+cnt2+1,y2)-liy-1;else y2=cnt2;
        if(x2<lix[cnt1])x2=upper_bound(lix+1,lix+cnt1+1,x2)-lix-1;else x2=cnt1;
        return qu(1,1,mx,y1,y2,x1,x2);
    }
    void srt()
    {
        sort(dian+1,dian+n+1);
        for(int i=1;i<=n;i++)
        {
            lix[++cnt1]=dian[i].x;
            liy[++cnt2]=dian[i].y;
        }
        sort(lix+1,lix+cnt1+1);sort(liy+1,liy+cnt2+1);
        cnt1=unique(lix+1,lix+cnt1+1)-lix-1;
        cnt2=unique(liy+1,liy+cnt2+1)-liy-1;
        for(int i=1;i<=n;i++)
        {
            dian[i].x=lower_bound(lix+1,lix+cnt1+1,dian[i].x)-lix;
            dian[i].y=lower_bound(liy+1,liy+cnt2+1,dian[i].y)-liy;
        }
        return ;
    }
    void yu()
    {
        for(int i=1;i<=n;i++)
        {
            pre[i]=now[dian[i].x];
            now[dian[i].x]=dian[i].y;
        }
    }
}sx,sy;
int on,t1,t2,t3,t4,t5;
int main()
{
    scanf("%d",&on);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        t1=read();t2=read();
        sy.dian[i].x=t1;sy.dian[i].y=t2;
        sx.dian[i].x=t2;sx.dian[i].y=t1;
    }
    sx.srt();
    sy.srt();
    sx.yu();
    sy.yu();
    sx.build(1,1,mx,1,n);
    sy.build(1,1,mx,1,n);
    int cas;
    scanf("%d",&cas);int lax=0,lay=0;
    while(cas--)
    {
        t1=read();t2=read();t3=read();t4=read();
        t1=t1+(lax+lay)*on;
        t2=t2+(lax+lay)*on;
        t3=t3+(lax+lay)*on;
        t4=t4+(lax+lay)*on;
        lay=sx.que(t2,t1,t4,t3);
        lax=sy.que(t1,t2,t3,t4);
        printf("%d %d
",lax,lay);
    }
    return 0;
}