跪了半天题解才会。。TAT
1 #include<cstdio> 2 #include<iostream> 3 #include<cstring> 4 using namespace std; 5 const int maxn=200233<<1; 6 const int inf=1000023333; 7 struct zs{ 8 int u,v; 9 }e[200233]; 10 int ch[maxn][2],fa[maxn],mnpos[maxn],st[maxn],top; 11 bool rev[maxn],ty; 12 int lc[200233*30],rc[200233*30],sz[200233*30],rt[200233],ntr[200233]; 13 int i,j,k,n,m,x,y,l,r,K,tot,ans,a; 14 15 int ra;char rx; 16 inline int read(){ 17 ra=0,rx=getchar(); 18 while(rx<'0'||rx>'9')rx=getchar(); 19 while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra; 20 } 21 inline int min(int a,int b){return a<b?a:b;} 22 inline bool isrt(int x){ 23 return ch[fa[x]][0]!=x&&ch[fa[x]][1]!=x; 24 } 25 inline void pushdown(int x){ 26 if(!rev[x])return; 27 28 int l=ch[x][0],r=ch[x][1]; 29 if(l)rev[l]^=1;if(r)rev[r]^=1; 30 swap(ch[x][0],ch[x][1]),rev[x]=0; 31 } 32 inline void upd(int x){ 33 mnpos[x]=min(x<=m?x:inf,min(mnpos[ch[x][0]],mnpos[ch[x][1]])); 34 } 35 inline void rotate(int x){ 36 int f=fa[x],gfa=fa[f],l=ch[f][1]==x,r=l^1; 37 if(!isrt(f))ch[gfa][ch[gfa][1]==f]=x; 38 fa[ch[f][l]=ch[x][r]]=f,fa[fa[ch[x][r]=f]=x]=gfa; 39 mnpos[x]=mnpos[f],upd(f); 40 } 41 inline void splay(int x){ 42 int f=x,gfa; 43 for(st[top=1]=f;!isrt(f);st[++top]=(f=fa[f])); 44 while(top)pushdown(st[top--]); 45 while(!isrt(x)){ 46 f=fa[x],gfa=fa[f]; 47 if(!isrt(f)) 48 rotate(((ch[f][1]==x)^(ch[gfa][1]==f))?x:f); 49 rotate(x); 50 } 51 } 52 inline void access(int x){ 53 for(int rc=0;x;rc=x,x=fa[x]) 54 splay(x),ch[x][1]=rc,upd(x); 55 } 56 inline void makert(int x){ 57 access(x),splay(x),rev[x]^=1; 58 } 59 inline void link(int x,int y){ 60 makert(x),fa[x]=y; 61 } 62 inline void cut(int x,int y){ 63 makert(x),access(y),splay(y),fa[x]=ch[y][0]=0; 64 } 65 inline int getfa(int x){ 66 for(access(x),splay(x);ch[x][0];x=ch[x][0]); 67 return x; 68 } 69 70 inline void insert(int pre,int &x,int a,int b,int v){ 71 sz[x=++tot]=sz[pre]+1; 72 if(a==b)return; 73 int mid=(a+b)>>1; 74 if(v<=mid)rc[x]=rc[pre],insert(lc[pre],lc[x],a,mid,v); 75 else lc[x]=lc[pre],insert(rc[pre],rc[x],mid+1,b,v); 76 } 77 inline int query(int pre,int x,int a,int b,int d){ 78 if(b<=d||!x)return sz[x]-sz[pre]; 79 int mid=(a+b)>>1; 80 if(d<=mid)return query(lc[pre],lc[x],a,mid,d); 81 else return sz[lc[x]]-sz[lc[pre]]+query(rc[pre],rc[x],mid+1,b,d); 82 } 83 int main(){ 84 n=read(),m=read(),K=read(),ty=read(); 85 mnpos[0]=inf; 86 for(i=1;i<=m;i++)mnpos[i]=i;for(i=m+1;i<=n+m;i++)mnpos[i]=inf; 87 88 for(i=1;i<=m;i++){ 89 e[i].u=x=read(),e[i].v=y=read(); 90 x+=m,y+=m; 91 if(x!=y){ 92 if(getfa(x)==getfa(y)){ 93 makert(x),access(y),splay(y),ntr[i]=a=mnpos[y]; 94 cut(e[a].u+m,a),cut(a,e[a].v+m); 95 } 96 link(x,i),link(i,y); 97 }else ntr[i]=i; 98 insert(rt[i-1],rt[i],0,m,ntr[i]); 99 // printf(" %d %d ",i,ntr[i]); 100 } 101 while(K--){ 102 l=read()^(ty?ans:0),r=read()^(ty?ans:0); 103 ans=n-query(rt[l-1],rt[r],0,m,l-1); 104 printf("%d ",ans); 105 } 106 return 0; 107 }