HDU 4453 Looploop （伸展树splay tree）

Looploop

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 781    Accepted Submission(s): 220

Problem Description

XXX gets a new toy named Looploop. The toy has N elements arranged in a loop, an arrow pointing to one of the elements, and two preset parameters k1 and k2. Every element has a number on it.



The figure above shows a Looploop of 6 elments. Let's assuming the preset parameter k1 is 3, and k2 is 4.
XXX can do six operations with the toy. 

1: add x 
Starting from the arrow pointed element, add x to the number on the clockwise first k2 elements.



2: reverse
Starting from the arrow pointed element, reverse the first k1 clockwise elements.



3: insert x 
Insert a new element with number x to the right (along clockwise) of the arrow pointed element.



4: delete 
Delete the element the arrow pointed and then move the arrow to the right element.



5: move x 
x can only be 1 or 2. If x = 1 , move the arrow to the left(along the counterclockwise) element, if x = 2 move the arrow to the right element.



6: query
Output the number on the arrow pointed element in one line.



XXX wants to give answers to every query in a serial of operations.

 

Input

There are multiple test cases.
For each test case the first line contains N,M,k1,k2(2≤k1<k2≤N≤10⁵, M≤10⁵) indicating the initial number of elements, the total number of operations XXX will do and the two preset parameters of the toy. 
Second line contains N integers ai(-10⁴≤ai≤10⁴) representing the N numbers on the elements in Looploop along clockwise direction. The arrow points to first element in input at the beginning. 
Then m lines follow, each line contains one of the six operations described above.
It is guaranteed that the "x" in the "add","insert" and "move" operations is always integer and its absolute value ≤104. The number of elements will never be less than N during the operations. 
The input ends with a line of 0 0 0 0.

 

Output

For each test case, output case number in the first line(formatted as the sample output). Then for each query in the case, output the number on the arrow pointed element in a single line.

 

Sample Input

5 1 2 4 3 4 5 6 7 query 5 13 2 4 1 2 3 4 5 move 2 query insert 8 reverse query add 2 query move 1 query move 1 query delete query 0 0 0 0

 

Sample Output

Case #1: 3 Case #2: 2 8 10 1 5 1

 

Source

2012 Asia Hangzhou Regional Contest

 

用splay tree解决很容易实现。

/* ***********************************************
Author        :kuangbin
Created Time  :2013-10-22 16:10:40
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

#define Key_value ch[ch[root][1]][0]
const int MAXN = 200010;

int pre[MAXN],ch[MAXN][2],key[MAXN],size[MAXN];
int root,tot1;
int s[MAXN],tot2;
int rev[MAXN],add[MAXN];
int n,q,k1,k2;
int a[MAXN];
int tp;//指针
void NewNode(int &r,int father,int k)
{
    if(tot2)r = s[tot2--];
    else r = ++tot1;
    pre[r] = father;
    ch[r][0] = ch[r][1] = 0;
    key[r] = k;
    add[r] = 0;
    rev[r] = 0;
    size[r] = 1;
}
void Update_Rev(int r)
{
    if(!r)return;
    swap(ch[r][0],ch[r][1]);
    rev[r] ^= 1;
}
void Update_ADD(int r,int ADD)
{
    if(!r)return;
    key[r] += ADD;
    add[r] += ADD;
}

void push_up(int r)
{
    size[r] = size[ch[r][0]] + size[ch[r][1]] + 1;
}
void push_down(int r)
{
    if(add[r])
    {
        Update_ADD(ch[r][0],add[r]);
        Update_ADD(ch[r][1],add[r]);
        add[r] = 0;
    }
    if(rev[r])
    {
        Update_Rev(ch[r][0]);
        Update_Rev(ch[r][1]);
        rev[r] = 0;
    }
}
void Build(int &x,int l,int r,int father)
{
    if(l > r)return;
    int mid = (l+r)/2;
    NewNode(x,father,a[mid]);
    Build(ch[x][0],l,mid-1,x);
    Build(ch[x][1],mid+1,r,x);
    push_up(x);
}
void Init()
{
    root = tot1 = tot2 = 0;
    ch[root][0] = ch[root][1] = size[root] = pre[root] = 0;
    rev[root] = 0;
    add[root] = 0;
    NewNode(root,0,-1);
    NewNode(ch[root][1],root,-1);
    for(int i = 0;i < n;i++)
        scanf("%d",&a[i]);
    Build(Key_value,0,n-1,ch[root][1]);
    push_up(ch[root][1]);
    push_up(root);
}
//旋转，0为左旋，1为右旋
void Rotate(int x,int kind)
{
    int y = pre[x];
    push_down(y);
    push_down(x);
    ch[y][!kind] = ch[x][kind];
    pre[ch[x][kind]] = y;
    if(pre[y])
        ch[pre[y]][ch[pre[y]][1]==y] = x;
    pre[x] = pre[y];
    ch[x][kind] = y;
    pre[y] = x;
    push_up(y);
}
void Splay(int r,int goal)
{
    push_down(r);
    while(pre[r] != goal)
    {
        if(pre[pre[r]] == goal)
        {
            push_down(pre[r]);
            push_down(r);
            Rotate(r,ch[pre[r]][0] == r);
        }
        else
        {
            push_down(pre[pre[r]]);
            push_down(pre[r]);
            push_down(r);
            int y = pre[r];
            int kind = ch[pre[y]][0]==y;
            if(ch[y][kind] == r)
            {
                Rotate(r,!kind);
                Rotate(r,kind);
            }
            else
            {
                Rotate(y,kind);
                Rotate(r,kind);
            }
        }
    }
    push_up(r);
    if(goal == 0) root = r;
}
int Get_kth(int r,int k)
{
    push_down(r);
    int t = size[ch[r][0]] + 1;
    if(t == k)return r;
    if(t > k)return Get_kth(ch[r][0],k);
    else return Get_kth(ch[r][1],k-t);
}
void ADD(int x)
{
    //先搬移动
    Splay(tp,0);
    int tmp = size[ch[root][0]] + 1;
    Splay(Get_kth(root,1),0);
    Splay(Get_kth(root,tmp),root);
    tmp = Key_value;
    Key_value = 0;
    push_up(ch[root][1]);
    push_up(root);
    Splay(Get_kth(root,size[root] - 1),0);
    Key_value = tmp;
    pre[Key_value] = ch[root][1];
    push_up(ch[root][1]);
    push_up(root);
    Splay(Get_kth(root,1),0);
    Splay(Get_kth(root,k2+2),root);
    Update_ADD(Key_value,x);
    push_up(ch[root][1]);
    push_up(root);
    tp = Get_kth(root,2);
}
void REVERSE()
{
    Splay(tp,0);
    int tmp = size[ch[root][0]] + 1;
    Splay(Get_kth(root,1),0);
    Splay(Get_kth(root,tmp),root);
    tmp = Key_value;
    Key_value = 0;
    push_up(ch[root][1]);
    push_up(root);
    Splay(Get_kth(root,size[root] - 1),0);
    Key_value = tmp;
    pre[Key_value] = ch[root][1];
    push_up(ch[root][1]);
    push_up(root);
    Splay(Get_kth(root,1),0);
    Splay(Get_kth(root,k1+2),root);
    Update_Rev(Key_value);
    push_up(ch[root][1]);
    push_up(root);
    tp = Get_kth(root,2);
}
void INSERT(int x)
{
    Splay(tp,0);
    //printf("%d %d
",tp,size[ch[root][0]]+2);
    int tt = Get_kth(root,size[ch[root][0]]+2);
    //printf("%d %d %d
",Get_kth(root,size[ch[root][0]]+2),tt,key[tt]);
    Splay(Get_kth(root,size[ch[root][0]]+2),root);
    NewNode(Key_value,ch[root][1],x);
    push_up(ch[root][1]);
    push_up(root);
}
void DELETE()
{
    Splay(tp,0);
    int tmp = size[ch[root][0]] + 1;
    Splay(Get_kth(root,tmp-1),0);
    Splay(Get_kth(root,tmp+1),root);
    s[++tot2] = Key_value;
    Key_value = 0;
    push_up(ch[root][1]);
    push_up(root);
    if(tmp == size[root])tp = Get_kth(root,2);
    else tp = Get_kth(root,tmp);
}
int MOVE(int x)
{
    if(x == 1)
    {
        Splay(tp,0);
        int tmp = size[ch[root][0]] + 1;
        tmp--;
        if(tmp == 1)tmp = size[root] - 1;
        tp = Get_kth(root,tmp);
    }
    else
    {
        Splay(tp,0);
        int tmp = size[ch[root][0]] + 1;
        tmp++;
        if(tmp == size[root])tmp = 2;
        tp = Get_kth(root,tmp);
        //cout<<tp<<endl;
    }
}
int query()
{
    Splay(tp,0);
    return key[root];
}
char op[100];
int x;
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int iCase = 0;
    while(scanf("%d%d%d%d",&n,&q,&k1,&k2) == 4)
    {
        if(n == 0 && q == 0 && k1 == 0 && k2 == 0)break;
        iCase ++;
        printf("Case #%d:
",iCase);
        Init();
        tp = Get_kth(root,2);
        while(q--)
        {
            scanf("%s",op);
            if(op[0] == 'a')
            {
                scanf("%d",&x);
                ADD(x);
            }
            else if(op[0] == 'r')
                REVERSE();
            else if(op[0] == 'i')
            {
                scanf("%d",&x);
                INSERT(x);
            }
            else if(op[0] == 'd')
                DELETE();
            else if(op[0] == 'm')
            {
                scanf("%d",&x);
                MOVE(x);
            }
            else printf("%d
",query());
        }

    }
    return 0;
}