program editor;//Splay Tree//By HT 2012/12//BZOJ P1269//AHOI2004 Editor{$DEFINE INDEBUG}Typenode=longint;rec=recordlch,rch,f,s:longint;w:char;ro:boolean;end;Varq:array[0..2000000] of rec;ss:array[0..10000] of char;h,null,now:node;top,i,j,k,n:longint;c:char;Procedure fopen;beginassign(input,'editor.in');assign(output,'editor.out');reset(input);rewrite(output);end;Procedure fclose;beginclose(input);close(output);end;Function mmin(a,b:longint):longint;beginif a<b then exit(a) else exit(b);end;Procedure new(var p:node);begininc(top);p:=top;end;Procedure pushup(P:node);beginwhile p<>null dobeginq[p].s:=q[q[p].lch].s+q[q[p].rch].s+1;p:=q[p].f;end;end;Procedure oldupdate(P:node);vary:node;beginif p=null then exit;if q[p].ro thenbeginy:=q[p].lch;q[p].lch:=q[p].rch;q[p].rch:=y;if q[p].lch<>null then q[q[p].lch].ro:=not q[q[p].lch].ro;if q[p].rch<>null then q[q[p].rch].ro:=not q[q[p].rch].ro;q[p].ro:=false;end;end;Procedure update(P:node);beginoldupdate(q[p].lch);oldupdate(q[p].rch);oldupdate(p);end;Procedure zig(P:node);// LeftRonatevarnewroot:node;beginif p=null then exit;update(p);if q[p].rch=null then exit;newroot:=q[p].rch;q[newroot].f:=q[p].f;if q[p].f<>null thenif q[q[p].f].lch=p thenq[q[p].f].lch:=newroot elseq[q[p].f].rch:=newrootelseh:=newroot;q[p].rch:=q[newroot].lch;if q[p].rch<>null thenq[q[p].rch].f:=p;q[newroot].lch:=p;q[p].f:=newroot;pushup(p);pushup(newroot);end;Procedure zag(P:node);//RightRonatevarnewroot:node;beginif p=null then exit;update(p);if q[p].lch=null then exit;newroot:=q[p].lch;q[newroot].f:=q[p].f;if q[p].f<>null thenif q[q[p].f].lch=p thenq[q[p].f].lch:=newroot elseq[q[p].f].rch:=newrootelseh:=newroot;q[p].lch:=q[newroot].rch;if q[p].lch<>null thenq[q[p].lch].f:=p;q[newroot].rch:=p;q[p].f:=newroot;pushup(p);pushup(newroot);end;Procedure Splay(P,tar:node);varx,y,z:node;beginif p=null then exit;x:=p;while q[x].f<>tar dobeginy:=q[x].f;z:=q[y].f;update(z);update(y);update(x);if z=tar thenbeginif q[y].lch=x then zag(y) else zig(y);exit;end;if (q[z].lch=y) and (q[y].lch=x) thenbeginzag(z);zag(y);end elseif (q[z].rch=y) and (q[y].rch=x) thenbeginzig(z);zig(y);end elseif (q[z].lch=y) and (q[y].rch=x) thenbeginzig(y);zag(z);end elsebeginzag(y);zig(z);end;end;end;Function kth(P:longint):node;beginkth:=h;update(kth);if p>q[h].s then p:=q[h].s;while q[kth].s>1 dobeginif q[q[kth].lch].s+1=p then exit;if p<q[q[kth].lch].s+1 then kth:=q[kth].lch elsebegindec(p,q[q[kth].lch].s+1);kth:=q[kth].rch;end;update(kth);end;end;Function buildtree(pl,pr:longint):node;varmid:longint;ans:node;beginif pr<pl then exit(null);if pl=pr thenbeginnew(ans);with q[ans] dobegins:=1;w:=ss[pl];lch:=null;rch:=null;f:=null;ro:=false;end;exit(ans);end;mid:=(pl+pr) div 2;new(ans);with q[ans] dobegins:=pr-pl+1;w:=ss[mid];ro:=false;lch:=buildtree(pl,mid-1);rch:=buildtree(mid+1,pr);if lch<>null thenq[lch].f:=ans;if rch<>null thenq[rch].f:=ans;exit(ans);end;end;Procedure Insert(k:longint);varp:node;beginp:=now;update(p);if q[p].rch=null then beginq[p].rch:=buildtree(1,k);q[q[p].rch].f:=p;pushup(p);exit;end;p:=q[p].rch;update(p);while q[p].lch<>null dobeginp:=q[p].lch;update(p);end;q[p].lch:=buildtree(1,k);q[q[p].lch].f:=p;pushup(p);end;Procedure move(P:longint);beginnow:=h;update(now);while q[now].s>1 dobeginif q[q[now].lch].s+1=p then exit;if p<q[q[now].lch].s+1 then now:=q[now].lchelsebegindec(p,q[q[now].lch].s+1);now:=q[now].rch;end;update(now);end;end;Procedure next;varo:node;beginupdate(now);if q[now].rch<>null thenbeginnow:=q[now].rch;update(now);while q[now].lch<>null dobeginnow:=q[now].lch;update(now);end;end elsebegino:=q[now].f;update(o);while o<>null dobeginif q[o].lch=now then break;o:=q[o].f;now:=q[now].f;update(o);end;now:=o;end;splay(now,null);end;Procedure prev;varo:node;beginupdate(now);if q[now].lch<>null thenbeginnow:=q[now].lch;update(now);while q[now].rch<>null dobeginnow:=q[now].rch;update(now);end;end elsebegino:=q[now].f;update(o);while o<>null dobeginif q[o].rch=now then break;o:=q[o].f;now:=q[now].f;update(o);end;now:=o;end;splay(now,null);end;Function Getpos:longint;varp,qq:node;beginp:=q[now].f;qq:=now;getpos:=q[q[now].lch].s+1;// if now=null then error(renone);update(p);update(qq);while p<>null dobeginif q[p].rch=qq then inc(getpos,q[q[p].lch].s+1);p:=q[p].f;qq:=q[qq].f;update(p);update(qq);end;end;Procedure get;varoldnow:node;beginoldnow:=now;if q[h].s<>getpos thenbeginnext;writeln(q[now].w);endelse writeln(' ');now:=oldnow;splay(now,null);end;Procedure delete(P:longint);vartmp:node;begintmp:=kth(mmin(q[h].s,getpos+p+1));splay(now,null);splay(tmp,h);update(h);update(q[h].rch);update(q[h].lch);q[q[h].rch].lch:=null;pushup(q[h].rch);end;Procedure ronate(P:longint);vartmp:node;begintmp:=kth(mmin(q[h].s,getpos+p+1));splay(now,null);splay(tmp,h);update(q[q[h].rch].lch);update(q[h].rch);update(h);q[q[q[h].rch].lch].ro:=true;//q[q[h].rch].lch:=null;end;Procedure init;varp:node;begintop:=0;new(null);with q[null] dobegins:=0;lch:=null;rch:=null;f:=null;w:=#0;end;new(h);now:=h;with q[h] dobeginlch:=null;rch:=null;f:=null;w:=#0;s:=1;end;for i:=1 to 10 doss[i]:=#0;insert(10);end;Procedure readchar(P:longint);vari:longint;o:char;beginfor i:=1 to p doread(o);end;begin{$IFDEF INDEBUG}fopen;{$ENDIF}readln(n);init;for i:=1 to n dobeginread(c);case c of'M':beginreadchar(3);readln(k);move(k+1);end;'I':beginreadchar(5);readln(k);for j:=1 to k doread(ss[j]);readln;insert(k);end;'D':beginreadchar(5);readln(k);delete(k);end;'R':beginreadchar(5);readln(k);ronate(k);end;'G':beginget;readchar(2);readln;end;'P':beginprev;readchar(3);readln;end;'N':beginnext;readchar(3);readln;end;end;// writeln('No.',i,' Succeed! ');//flush(output);//get;end;{$IFDEF INDEBUG}fclose;{$ENDIF}end.