제출 #345574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345574		nandonathaniel	Birthday gift (IZhO18_treearray)	C++14	56 / 100	4073 ms	38936 KiB

treearray

#include<bits/stdc++.h>
using namespace std;
const int MAXN=200005,LOG=18;

vector<int> adj[MAXN];
int depth[MAXN],pa[LOG][MAXN],a[MAXN];

void dfs(int now,int par){
	for(auto nxt : adj[now]){
		if(nxt==par)continue;
		depth[nxt]=depth[now]+1;
		pa[0][nxt]=now;
		for(int i=1;i<LOG;i++)pa[i][nxt]=pa[i-1][pa[i-1][nxt]];
		dfs(nxt,now);
	}
}

int LCA(int u,int v){
	if(depth[u]<depth[v])swap(u,v);
	int diff=depth[u]-depth[v];
	for(int i=LOG-1;i>=0;i--){
		if(diff&(1<<i))u=pa[i][u];
	}
	if(u==v)return u;
	for(int i=LOG-1;i>=0;i--){
		if(pa[i][u]!=pa[i][v]){
			u=pa[i][u];
			v=pa[i][v];
		}
	}
	return pa[0][u];
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n,m,q,op,x,y,u,v;
	cin >> n >> m >> q;
	for(int i=1;i<n;i++){
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	dfs(1,-1);
	for(int i=1;i<=m;i++)cin >> a[i];
	while(q--){
		cin >> op >> x >> y;
		if(op==1)a[x]=y;
		else{
			cin >> v;
			bool sudah=false;
			for(int i=x;i<=y;i++){
				if(a[i]==v){
					sudah=true;
					cout << i << " " << i << '\n';
					break;
				}
				if(i<y){
					if(LCA(a[i],a[i+1])==v){
						sudah=true;
						cout << i << " " << i+1 << '\n';
						break;
					}
				}
			}
			if(!sudah){
				cout << -1 << " " << -1 << '\n';
			}
		}
	}
	return 0;
}

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