AC通道:http://www.lydsy.com/JudgeOnline/problem.php?id=2002
【题解】
LCT的模板题。
从点i向i+ki连边,构成一颗树,询问等价于求x结点的深度,修改就是删去原边,加入新边。
这些都是LCT的基本操作。
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;
#define FILE "read"
#define MAXN 200010
#define up(i,j,n) for(int i=j;i<=n;++i)
#define dn(i,j,n) for(int i=j;i>=n;--i)
namespace INIT{
char buf[1<<15],*fs,*ft;
inline char getc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<15,stdin),fs==ft))?0:*fs++;}
inline int read(){
int x=0,f=1; char ch=getc();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getc();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getc();}
return x*f;
}
}using namespace INIT;
int n,m,next[MAXN];
namespace Link_Cut_Tree{
int f[MAXN],size[MAXN],vis[MAXN],q[MAXN],son[MAXN][2];
bool get(int x){return son[f[x]][1]==x;}
bool isroot(int x){return (f[x]==0||(son[f[x]][0]!=x&&son[f[x]][1]!=x));}
void updata(int x){size[x]=size[son[x][0]]+size[son[x][1]]+1;}
void pushdown(int x){
if(vis[x]){
swap(son[x][0],son[x][1]);
vis[son[x][0]]^=1; vis[son[x][1]]^=1;
vis[x]=0;
}
}
void rotate(int x){
int y=f[x],z=f[y],which=get(x);
if(!isroot(y)) son[z][son[z][1]==y]=x;
son[y][which]=son[x][which^1]; f[son[y][which]]=y;
son[x][which^1]=y; f[y]=x; f[x]=z;
updata(y); updata(x);
}
void splay(int x){
int top(0); q[++top]=x;
for(int i=x;!isroot(i);i=f[i]) q[++top]=f[i];
dn(i,top,1) pushdown(q[i]);
for(int y=f[x];!isroot(x);rotate(x),y=f[x])
if(!isroot(y)) rotate(get(x)==get(y)?y:x);
}
void access(int x){for(int temp=0;x;temp=x,x=f[x])splay(x),son[x][1]=temp;}
void reverse(int x){access(x);splay(x);vis[x]^=1;}
void linkk(int x,int y){reverse(x);f[x]=y;splay(x);}
void cut(int x,int y){reverse(x);access(y);splay(y);son[y][0]=f[x]=0;}
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
using namespace Link_Cut_Tree;
n=read();
up(i,1,n){
int x=read(); size[i]=1;
f[i]=i+x>n?n+1:i+x;
next[i]=f[i];
}
m=read(); size[n+1]=1;
up(i,1,m){
int flag=read();
if(flag==1){
int x=read()+1;
reverse(n+1); access(x); splay(x);
printf("%d\n",size[son[x][0]]);
}
else {
int x=read()+1,y=read();
int t=min(x+y,n+1);
cut(x,next[x]); linkk(x,t); next[x]=t;
}
}
return 0;
}