题意:给出N个数1-N,M个操作:(操作1)将[L,R]从原序列拿掉并插到剩下第C个的后面;(操作2)将[L,R]翻转
范围:N,M<=30W
解法:简单splay,提取区间打标记即可。
代码: (不知为何,数组型的splay要比指针写的慢上50%左右)
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<iostream>
#include<stdlib.h>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<bitset>
#pragma comment(linker, "/STACK:1024000000,1024000000")
template <class T>
bool scanff(T &ret){ //Faster Input
char c; int sgn; T bit=0.1;
if(c=getchar(),c==EOF) return 0;
while(c!='-'&&c!='.'&&(c<'0'||c>'9')) c=getchar();
sgn=(c=='-')?-1:1;
ret=(c=='-')?0:(c-'0');
while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');
if(c==' '||c=='\n'){ ret*=sgn; return 1; }
while(c=getchar(),c>='0'&&c<='9') ret+=(c-'0')*bit,bit/=10;
ret*=sgn;
return 1;
}
#define inf 1073741823
#define llinf 4611686018427387903LL
#define PI acos(-1.0)
#define lth (th<<1)
#define rth (th<<1|1)
#define rep(i,a,b) for(int i=int(a);i<=int(b);i++)
#define drep(i,a,b) for(int i=int(a);i>=int(b);i--)
#define gson(i,root) for(int i=ptx[root];~i;i=ed[i].next)
#define tdata int testnum;scanff(testnum);for(int cas=1;cas<=testnum;cas++)
#define mem(x,val) memset(x,val,sizeof(x))
#define mkp(a,b) make_pair(a,b)
#define findx(x) lower_bound(b+1,b+1+bn,x)-b
#define pb(x) push_back(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define NN 600600
int c[NN][2],fa[NN],sz[NN],val[NN],a[NN];
bool rev[NN];
inline void update(int x){
sz[x]=sz[c[x][0]]+sz[c[x][1]]+1;
}
void rotate(int x,int &k){
int y=fa[x],z=fa[y],l,r;
l=(c[y][1]==x);r=l^1;
if(y==k)k=x;
else c[z][c[z][1]==y]=x;
fa[y]=x;fa[c[x][r]]=y;fa[x]=z;
c[y][l]=c[x][r];c[x][r]=y;
update(y);update(x);
}
void splay(int x,int &k){
while(x!=k){
int y=fa[x],z=fa[y];
if(y!=k){
if(c[y][0]==x^c[z][0]==y)rotate(x,k);
else rotate(y,k);
}
rotate(x,k);
}
}
void built(int l,int r,int f){
if(l>r)return;
int m=(l+r)>>1;
c[f][m>=f]=m;
fa[m]=f;
sz[m]=1;
val[m]=a[m];
if(l==r)return;
built(l,m-1,m);
built(m+1,r,m);
update(m);
}
int findk(int x,int k){
if(rev[x]){
rev[x]^=1;rev[c[x][0]]^=1;rev[c[x][1]]^=1;
swap(c[x][0],c[x][1]);
}
int l=c[x][0],r=c[x][1];
if(sz[l]+1==k)return x;
if(sz[l]>=k)return findk(l,k);
return findk(r,k-sz[l]-1);
}
int n,m,rt;
void cut(int a,int b,int cc){
int x=findk(rt,a);
int y=findk(rt,b+2);
splay(x,rt);
splay(y,c[x][1]);
int z=c[y][0];
c[y][0]=0;
update(y);update(x);
x=findk(rt,cc+1);
y=findk(rt,cc+2);
splay(x,rt);
splay(y,c[x][1]);
c[y][0]=z;
fa[z]=y;
update(y);update(x);
}
void flip(int a,int b){
int x=findk(rt,a);
int y=findk(rt,b+2);
splay(x,rt);
splay(y,c[x][1]);
int z=c[y][0];
rev[z]^=1;
}
char op[10];
int main(){
while(scanf("%d%d",&n,&m)!=EOF){
if(n<0&&m<0)break;
rep(i,1,n+2)a[i]=i-1,rev[i]=0,c[i][0]=c[i][1]=0;
a[n+2]=0;
built(1,n+2,0);
rt=(n+3)>>1;
int x,y,z;
rep(i,1,m){
scanf("%s",op);
scanf("%d%d",&x,&y);
if(op[0]=='C')scanf("%d",&z),cut(x,y,z);
else flip(x,y);
}
rep(j,1,n-1)printf("%d ",val[findk(rt,j+1)]);
printf("%d\n",val[findk(rt,n+1)]);
}
return 0;
}