bzoj 3223 Tyvj 1729 文艺平衡树

区间翻转233

#include<bits/stdc++.h>
#define N 100005
#define LL long long
#define inf 0x3f3f3f3f
#define ls tr[x][0]
#define rs tr[x][1]
using namespace std;
inline int ra()
{
    int x=0,f=1; char ch=getchar();
    while (ch<'0' || ch>'9') {if (ch=='-') f=-1; ch=getchar();}
    while (ch>='0' && ch<='9') {x=x*10+ch-'0'; ch=getchar();}
    return x*f;
}
struct SPLAY{
    bool rev[N];
    int fa[N],tr[N][2],root,v[N],size[N],w[N],cnt;
    bool which(int x){return tr[fa[x]][1]==x;}
    void update(int x){size[x]=size[ls]+size[rs]+1;}
    void rotate(int x)
    {
        int y=fa[x],z=fa[y]; bool nx=which(x),ny=which(y);
        tr[y][nx]=tr[x][!nx]; fa[tr[x][!nx]]=y;
        fa[y]=x; tr[x][!nx]=y; fa[x]=z;
        if (z) tr[z][ny]=x; update(y); update(x);
    }
    void splay(int x, int aim)
    {
        while (fa[x]!=aim)
        {
            int y=fa[x],z=fa[y];
            if (z==aim) rotate(x);
            else if (which(x)==which(y)) rotate(y),rotate(x);
            else rotate(x),rotate(x);
        }
        if (!aim) root=x; update(x);
    }
    void insert(int val)
    {
        int x=root;
        for (;;)
        {
            if (val<v[x]) 
                if (!ls) {ls=val,fa[ls]=x,size[ls]=1; splay(ls,0); break;} else x=ls;
            else if (!rs) {rs=val,fa[rs]=x,size[rs]=1; splay(rs,0); break;} else x=rs;
        }
    }
    void pushdown(int x)
    {
        if (rev[x])
        {
            swap(ls,rs);
            rev[ls]^=1; rev[rs]^=1;
            rev[x]=0;
        }
    }
    int find(int x, int rank)
    {
        pushdown(x);
        if (size[ls]+1==rank) return x;
        else if (size[ls]>=rank) return find(ls,rank);
        else return find(rs,rank-size[ls]-1);
    }
    void rever(int l, int r)
    {
        int x=find(root,l);int y=find(root,r+2);
        splay(x,0); splay(y,x);
        rev[tr[y][0]]^=1;
    }
}T;
int n,m;
int main()
{
    n=ra(); m=ra();
    for (int i=1; i<=n+2; i++) T.insert(i);
    for (int i=1; i<=m; i++)
    {
        int x=ra(),y=ra();
        T.rever(x,y);
    }
    for (int i=2; i<=n+1; i++)
        printf("%d ",T.find(T.root,i)-1);
}