//#pragma optimize ("g",on)
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define db double
#define ld long double
#define pb push_back
#define pf push_front
#define ppb pop_back()
#define ppf pop_front()
#define len(x) (int)x.size()
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define vvi vector<vi>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mii map<int,int>
#define y1 u_will_not_notice_this15
#define hash u_will_not_notice_this
#define tm (tl+tr>>1)
#define ls v<<1,tl,tm
#define rs v<<1|1,tm+1,tr
#define pii pair<int,int>
#define lb lower_bound
#define ub upper_bound
#define f first
#define s second
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define str string
#define ins insert
#define elif else if
using namespace std;
using namespace __gnu_pbds;
const int maxn=2e5+5,mod=1e9+7,inf=1e18,bir=1,nol=0;
const bool TEST=0;
const str tch="+abcdefghijklmnopqrstuvwxyz",Tch="+ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const str Sunday_13_10_24[5]={"NO\n","YES\n","-1\n","0\n","1\n"};
void at(int ok){cout<<Sunday_13_10_24[ok];}
bool bit(int mask,int i){return ((bir<<i)&mask);}
int gcd(int a,int b){while(b){if(a>b) swap(a,b);b%=a;}return a;}
int lcm(int a,int b){return a/gcd(a,b)*b;}
int rnd(){return (rand()<<15)^rand();}
int bpm(int a,int b){a%=mod;if(b==0) return 1;if(b&1)return bpm(a,b-1)*a%mod;int x=bpm(a,b>>1);return x*x%mod;}
int bp(int a,int b){if(b==0) return 1;if(b&1)return bp(a,b-1)*a;int x=bp(a,b>>1);return x*x;}
//CODE STARTS HERE:
//don't get stuck on one aproach
int n,m,q,a[maxn],t,tin[maxn],tout[maxn],up[maxn][30];
vi g[maxn];
void dfs(int v=1,int p=1){
tin[v]=++t,up[v][0]=p;
for(int j=1;j<=20;j++)up[v][j]=up[up[v][j-1]][j-1];
for(auto to:g[v])if(to!=p)dfs(to,v);
tout[v]=t;
}
bool f(int x,int y){
return tin[x]<=tin[y]&&tout[x]>=tout[y];
}
int lca(int x,int y){
if(f(x,y))return x;
if(f(y,x))return y;
int a=x,b=y;
for(int i=20;i>=0;i--)if(!f(up[a][i],b))a=up[a][i];
return up[a][0];
}
void whyareucopying(){
cin>>n>>m>>q;
for(int i=1;i<n;i++){
int x,y;cin>>x>>y;g[x].pb(y),g[y].pb(x);
}
for(int i=1;i<=m;i++)cin>>a[i];
dfs();
while(q--){
int tp;
cin>>tp;
if(tp==1){
int pos,val;cin>>pos>>val;a[pos]=val;
}
else{
int l,r,v;cin>>l>>r>>v;
bool ok=0;
for(int i=l;i<r;i++){
if(lca(a[i],a[i])==v){
cout<<i<<' '<<i<<'\n';ok=1;break;
}
if(lca(a[i],a[i+1])==v){
cout<<i<<' '<<i+1<<'\n';ok=1;break;
}
}
if(!ok)cout<<"-1 -1\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
*/
signed main(){
// freopen("txt.in","r",stdin),freopen("txt.out","w",stdout);
ios_base::sync_with_stdio(0),cin.tie(0);
srand(time(0));
int T=1;
if(TEST)cin>>T;
for(int i=1;i<=T;i++){
// cout<<"Case "<<i<<": ";
whyareucopying();
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
10832 KB |
n=5 |
| 2 |
Incorrect |
3 ms |
10832 KB |
Jury has the answer but participant has not |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
10832 KB |
n=5 |
| 2 |
Incorrect |
3 ms |
10832 KB |
Jury has the answer but participant has not |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
10832 KB |
n=5 |
| 2 |
Incorrect |
3 ms |
10832 KB |
Jury has the answer but participant has not |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
10832 KB |
n=5 |
| 2 |
Incorrect |
3 ms |
10832 KB |
Jury has the answer but participant has not |
| 3 |
Halted |
0 ms |
0 KB |
- |
