1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329
|
#include <utility> #include <vector> #include <cstdlib> #include <algorithm> #define MP make_pair #define FR first #define SE second using std::vector; using std::pair; using std::make_pair; using std::sort; using std::lower_bound; const int INF=1e9; const int N=100000+10; inline int (int x,int y){ return x>y?x:y; } inline int min(int x,int y){ return x<y?x:y; } namespace IO{ const int LEN=20000000; char *inBuf,*inPtr; void Init(){ inBuf=new char[LEN]; } void Load(){ fread(inBuf,1,LEN,stdin); inPtr=inBuf; } char GetChar(){ return *(inPtr++); } int GetInt(){ int x=0,f=1; char c=GetChar(); while(c<'0'||c>'9'){if(c=='-')f=-1;c=GetChar();} while('0'<=c&&c<='9'){x=x*10+c-'0';c=GetChar();} return x*f; } } int n; int lastTime; struct Opt{ int type,pos,val; static bool Cmp(const Opt &a,const Opt &b){ return a.pos<b.pos; } }; namespace Treap{ const int SIZE=20000000; struct Node{ int ch[2]; int size; int val,minVal; }a[SIZE]; int nodeCnt; inline int NewNode(int val){ a[++nodeCnt]=(Node){0,0,1,val,val}; return nodeCnt; } inline int CopyNode(int u){ a[++nodeCnt]=a[u]; return nodeCnt; } inline void Pushup(int u){ a[u].size=a[a[u].ch[0]].size+a[a[u].ch[1]].size+1; a[u].minVal=min(a[u].val,min(a[u].ch[0]?a[a[u].ch[0]].minVal:INF,a[u].ch[1]?a[a[u].ch[1]].minVal:INF)); } void Split(int u,int k,int &x,int &y){ if(!u){ x=y=0; return; } if(k<a[u].val){ y=CopyNode(u); Split(a[y].ch[0],k,x,a[y].ch[0]); }else{ x=CopyNode(u); Split(a[x].ch[1],k,a[x].ch[1],y); } if(x) Pushup(x); if(y) Pushup(y); } void SplitSize(int u,int k,int &x,int &y){ if(!u){ x=y=0; return; } int cmp=a[a[u].ch[0]].size+1; if(k<cmp){ y=CopyNode(u); SplitSize(a[y].ch[0],k,x,a[y].ch[0]); }else{ x=CopyNode(u); SplitSize(a[x].ch[1],k-cmp,a[x].ch[1],y); } if(x) Pushup(x); if(y) Pushup(y); } int Merge(int x,int y){ if(!x||!y) return x+y; int u; if(rand()%(a[x].size+a[y].size)<a[x].size){ u=CopyNode(x); a[u].ch[1]=Merge(a[u].ch[1],y); }else{ u=CopyNode(y); a[u].ch[0]=Merge(x,a[u].ch[0]); } Pushup(u); return u; } int Insert(int rt,int val){ int x=0,y=0; Split(rt,val,x,y); int u=NewNode(val); return Merge(Merge(x,u),y); } int Delete(int rt,int val){ int x=0,y=0,x0=0,y0=0; Split(rt,val,x,y); SplitSize(x,a[x].size-1,x0,y0); return Merge(x0,y); } } namespace Tree{ const int N=(::N); int h[N],tot; struct Edge{ int v,next; }e[N*2]; int pre[N]; int dep[N]; int size[N]; int son[N]; int top[N]; void AddEdge(int u,int v){ e[++tot]=(Edge){v,h[u]}; h[u]=tot; e[++tot]=(Edge){u,h[v]}; h[v]=tot; } void DissectionDFS1(int u,int fa){ pre[u]=fa; dep[u]=dep[fa]+1; size[u]=1; son[u]=-1; for(int i=h[u],v;i;i=e[i].next) if((v=e[i].v)!=fa){ DissectionDFS1(v,u); size[u]+=size[v]; if(son[u]==-1||size[v]>size[son[u]]) son[u]=v; } } void DissectionDFS2(int u,int _top){ top[u]=_top; if(son[u]==-1) return; DissectionDFS2(son[u],top[u]); for(int i=h[u],v;i;i=e[i].next) if((v=e[i].v)!=pre[u]&&v!=son[u]) DissectionDFS2(v,v); } void Dissection(){ DissectionDFS1(1,0); DissectionDFS2(1,1); } inline int GetLCA(int a,int b){ for(;top[a]!=top[b];dep[top[a]]>dep[top[b]]?a=pre[top[a]]:b=pre[top[b]]); return dep[a]<dep[b]?a:b; } inline int GetDis(int a,int b){ return dep[a]+dep[b]-2*dep[GetLCA(a,b)]; } } namespace Seg{ const int VER=(::N); const int SIZE=N*295; struct Node{ int ch[2]; int val[2]; }a[SIZE]; int nodeCnt; int rt[VER]; inline int CopyNode(int u){ a[++nodeCnt]=a[u]; return nodeCnt; } void Insert(int u,int &v,int l,int r,int &p,int cnt,Opt *opt){ v=CopyNode(u); if(l==r){ while(p<=cnt&&opt[p].pos==l){ a[v].val[opt[p].type]=opt[p].val; p++; } return; } int mid=(l+r)>>1; if(p<=cnt&&l<=opt[p].pos&&opt[p].pos<=mid) Insert(a[u].ch[0],a[v].ch[0],l,mid,p,cnt,opt); if(p<=cnt&&mid<opt[p].pos&&opt[p].pos<=r) Insert(a[u].ch[1],a[v].ch[1],mid+1,r,p,cnt,opt); } int Query(int u,int l,int r,int pos,int type){ if(!u) return 0; if(l==r) return a[u].val[type]; int mid=(l+r)>>1; if(pos<=mid) return Query(a[u].ch[0],l,mid,pos,type); else return Query(a[u].ch[1],mid+1,r,pos,type); } } namespace PDTree{ const int N=(::N); using Tree::h; using Tree::e; bool cut[N]; int curRoot,curVal; int size[N]; int pre[N]; void FindRootDFS(int u,int fa,int curSize){ size[u]=1; int maxSub=0; for(int i=h[u],v;i;i=e[i].next) if((v=e[i].v)!=fa&&!cut[v=e[i].v]){ FindRootDFS(v,u,curSize); size[u]+=size[v]; maxSub=max(maxSub,size[v]); } maxSub=max(maxSub,curSize-size[u]); if(maxSub<curVal){ curRoot=u; curVal=maxSub; } } int FindRoot(int u,int curSize){ curRoot=-1; curVal=INF; FindRootDFS(u,0,curSize); return curRoot; } int Divide(int x,int curSize){ int u=FindRoot(x,curSize); cut[u]=true; for(int i=h[u],v;i;i=e[i].next) if(!cut[v=e[i].v]){ int p=Divide(v,size[v]<size[u]?size[v]:curSize-size[u]); pre[p]=u; } return u; } int GetTreapRoot(int u){ return Seg::Query(Seg::rt[lastTime],1,n,u,1); } void Modify(int t,int x){ bool st=Seg::Query(Seg::rt[lastTime],1,n,x,0); int opt=st^1; static int p,cnt; static Opt arr[100]; p=1; cnt=0; for(int u=x;u;u=pre[u]){ int rt=GetTreapRoot(u); if(opt==1) rt=Treap::Insert(rt,Tree::GetDis(u,x)); else rt=Treap::Delete(rt,Tree::GetDis(u,x)); arr[++cnt]=(Opt){1,u,rt}; } arr[++cnt]=(Opt){0,x,st^1}; sort(arr+1,arr+cnt+1,Opt::Cmp); Seg::Insert(Seg::rt[lastTime],Seg::rt[t],1,n,p,cnt,arr); lastTime=t; } int Query(int x){ int res=INF; for(int u=x;u;u=pre[u]){ int rt=GetTreapRoot(u); if(rt) res=min(res,Tree::GetDis(u,x)+Treap::a[rt].minVal); } return res; } } void ReadData(){ using IO::GetInt; n=GetInt(); for(int i=1;i<n;i++) Tree::AddEdge(GetInt(),GetInt()); } void AnswerQuery(){ using IO::GetInt; int m; int ans=0; int tot=0; m=GetInt(); for(int i=1;i<=m;i++){ int opt,x; opt=GetInt(); x=GetInt(); x^=ans; switch(opt){ case 1: PDTree::Modify(++tot,x); break; case 2: ans=PDTree::Query(x); printf("%dn",ans); break; case 3: lastTime=x; break; } } } int main(){ IO::Init(); IO::Load(); ReadData(); Tree::Dissection(); PDTree::Divide(1,n); AnswerQuery(); return 0; }
|
近期评论