제출 #334901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334901		amunduzbaev	Birthday gift (IZhO18_treearray)	C++14	30 / 100	3111 ms	620 KiB

treearray

#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 505;

int n, m, q, a[N], tin[N], tout[N], l;
vector<int>edges[N];
vector<int>order;
vector<pii>tree;
int t;
int up[N][32];
void dfs(int u, int p){
	tin[u] = ++t;
	up[u][0] = p;
	for(int i=1; i<=l; i++){
		up[u][i] = up[up[u][i-1]][i-1];
	}
	for(auto x:edges[u]){
		if(x == p) continue;
		dfs(x, u);
	}
	tout[u] = ++t;
}

bool upper(int a, int b){
	return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int lca(int a, int b){
	if(upper(a, b)) return a;
	if(upper(b, a)) return b;
	for(int i=l; i>=0; i--){
		if(!upper(up[a][i], b)) a = up[a][i];
	}
	return up[a][0];
}

void solve(){
	cin>>n>>m>>q;
	for(int i=1;i<n;i++){
		int a, b;
		cin>>a>>b;
		edges[a].pb(b);
		edges[b].pb(a);
	}
	l = 1;
	while((1<<l) <= n) l++; 
	dfs(1, 1);
	for(int i=1;i<=m;i++) cin>>a[i];
	while(q--){
		int t;
		cin>>t;
		if(t == 1){
			int pos, val;
			cin>>pos>>val;
			a[pos] = val;
		}
		else{
			int l, r, val, rr;
			cin>>l>>r>>val;
			int la = -1, ra = -1;
			for(;l<= r; l++){
				int prev = -1;
				for(rr = l; rr <= r; rr++){
					int lx = a[l], rx = a[rr];
					int res = lca(lx, rx);
					if(prev != -1) res = lca(prev, res);
					//cout<<res<<" ";
					if(res == val){
						if(ra == -1 || ra - la +1 < rr - l +1) ra = rr, la = l;
					}
					prev = res;
				}
			}
			cout<<la<<" "<<ra<<"\n";
		}
	}
	
	return;
}

int main(){
	fastios
	int t = 1;
	//cin>>t;
	while(t--) solve();
	return 0;
}

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