Submission #922846

#	Time	Username	Problem	Language	Result	Execution time	Memory
922846		Aiperiii	Birthday gift (IZhO18_treearray)	C++14	56 / 100	4030 ms	33616 KiB

treearray

#include <bits/stdc++.h>
//#include "boxes.h"
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
const int N=2e5+5;
vector <int> g[N];
int p[N],d[N],jmp[N][20];
void dfs(int v,int par){
   p[v]=par;
   for(auto to : g[v]){
      if(to!=par){
         d[to]=d[v]+1;
         dfs(to,v);
      }
   }
}
int lca(int a,int b){
   if(d[a]<d[b])swap(a,b);
   for(int i=19;i>=0;i--){
      if(d[jmp[a][i]]>=d[b]){
         a=jmp[a][i];
      }
   }
   if(a==b)return a;
   for(int i=19;i>=0;i--){
      if(jmp[a][i]!=jmp[b][i]){
         a=jmp[a][i];
         b=jmp[b][i];
      }
   }
   return p[a];
}
signed main(){
   ios_base::sync_with_stdio();
   cin.tie(0);cout.tie(0);
   int n,m,q;
   cin>>n>>m>>q;
   for(int i=0;i<n-1;i++){
      int u,v;
      cin>>u>>v;
      g[u].pb(v);g[v].pb(u);
   }
   dfs(1,1);
   for(int i=1;i<=n;i++){
      jmp[i][0]=p[i];
   }
   for(int i=1;i<20;i++){
      for(int j=1;j<=n;j++){
         jmp[j][i]=jmp[jmp[j][i-1]][i-1];
      }
   }
   /*for(int i=1;i<=n;i++)cout<<d[i]<<" ";
   cout<<"\n";
   for(int i=1;i<=n;i++){
      for(int j=0;j<20;j++){
         cout<<jmp[i][j]<<" ";
      }
      cout<<"\n";
   }
   cout<<"\n";*/
   vector <int> a(m+1);
   for(int i=1;i<=m;i++)cin>>a[i];
   while(q--){
      int type,l,r,v,pos;
      cin>>type;
      if(type==1){
         cin>>pos>>v;
         a[pos]=v;
      }
      else{
         cin>>l>>r>>v;
         int st=l,x=a[l];
         int L=-1,R=-1;
         for(int i=l;i<=r;i++){
            if(lca(a[i],v)!=v){
               if(st<i && x==v){
                  L=st;R=i-1;break;
               }
               st=i+1;
               if(i+1<=m)x=a[st];
               continue;
            }
            x=lca(x,a[i]);
         }
         if(x==v && st<=r && L==-1 && R==-1){
            L=st;R=r;
         }
         cout<<L<<" "<<R<<"\n";
      }
   }
}

/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
 */

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 26 / 26
• Subtask 4: 0 / 44