UVA11922 Permutation Transformer(SplayTree)

UVA11922  Permutation Transformer(SplayTree)

题意:你的任务是根据m条指令修改排列1,2,3…n.对于每条指令a和b,你必须把第a到b区间内的数翻转之后添加到排列尾部.最后输出整个排列即可.

分析:刘汝佳:训练指南P242例题.

      直接建立Splay Tree,然后对排列执行操作即可.不过要注意split操作的k值不能为空,所以如果我们对原始队列执行[1,b]的命令的话,就会出错,所以我们认为的把队列变成1-n+1.队首的那个1永远在队首不变,我们操作a到b的时候,改成操作a+1到b+1即可.

具体见代码.

AC代码:

#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
struct Node
{
    Node *ch[2];
    int s,v,flip;
    int cmp(int k)
    {
        int d=k-ch[0]->s;
        if(d==1) return -1;
        return d<=0?0:1;
    }
    void maintain()
    {
        s=ch[0]->s+ch[1]->s+1;
    }
    void pushdown()
    {
        if(flip)
        {
            flip=0;
            swap(ch[0],ch[1]);
            ch[0]->flip = !(ch[0]->flip);
            ch[1]->flip = !(ch[1]->flip);
        }
    }
};
Node *null = new Node();
void rotate(Node* &o,int d)
{
    Node *k=o->ch[d^1];
    o->ch[d^1]=k->ch[d];
    k->ch[d]=o;
    o->maintain();
    k->maintain();
    o=k;
}
void splay(Node* &o,int k)
{
    o->pushdown();
    int d=o->cmp(k);
    if(d==1) k-= o->ch[0]->s+1;
    if(d!=-1)
    {
        Node *p=o->ch[d];
        p->pushdown();
        int d2 = p->cmp(k);
        int k2 = (d2==0? k:k-1-p->ch[0]->s);
        if(d2!=-1)
        {
            splay(p->ch[d2],k2);
            if(d==d2)
                rotate(o,d^1);
            else
                rotate(o->ch[d],d);
        }
        rotate(o,d^1);
    }
}
Node* merge(Node* left, Node* right)//left!=null
{
    splay(left,left->s);
    left->ch[1]=right;
    left->maintain();
    return left;
}
void split(Node* o,int k,Node* &left,Node* &right)
{
    splay(o,k);
    left=o;
    right=o->ch[1];
    o->ch[1]=null;
    left->maintain();
}
const int maxn=100000+1000;
struct SplaySequence
{
    int n;
    Node seq[maxn];
    Node *root;
    Node* build(int sz)
    {
        if(sz==0) return null;
        Node* L=build(sz/2);
        Node* o=&seq[++n];
        o->v=n;
        o->ch[0]=L;
        o->ch[1]=build(sz-sz/2-1);
        o->s=o->flip=0;
        o->maintain();
        return o;
    }
    void init(int sz)
    {
        n=0;
        null->s=0;
        root=build(sz);
    }
};
vector<int> ans;
void print(Node* o)
{
    if(o!=null)
    {
        o->pushdown();
        print(o->ch[0]);
        ans.push_back(o->v);
        print(o->ch[1]);
    }
}
void debug(Node* o)
{
    if(o!=null)
    {
        o->pushdown();
        debug(o->ch[0]);
        printf("%d ",o->v-1);
        debug(o->ch[1]);
    }
}

SplaySequence ss;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    ss.init(n+1);

    while(m--)
    {
        int a,b;
        scanf("%d%d",&a,&b);
        Node *o,*mid,*left,*right;
        split(ss.root,a,left,o);
        split(o,b-a+1,mid,right);
        mid->flip^=1;
        ss.root=merge(merge(left,right),mid);
    }
    print(ss.root);
    for(int i=1;i<ans.size();i++)
        printf("%d\n",ans[i]-1);
    return 0;
}