#456498 (C++14) No.1030 だんしんぐぱーりない

• 問題: No.1030 だんしんぐぱーりない
• ユーザー: Thistle
• 提出日時: 2020-04-02 03:31:00
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 548 ms / 2,000 ms
• コード長: 2,962 bytes
• コンパイル時間: 1,753 ms
• コンパイル使用メモリ: 172,832 KB
• 実行使用メモリ: 42,676 KB
• 最終ジャッジ日時: 2024-07-03 00:36:52
• 合計ジャッジ時間: 15,936 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	9 ms; 18,304 KB
testcase_01	AC	9 ms; 18,432 KB
testcase_02	AC	8 ms; 18,304 KB
testcase_03	AC	8 ms; 18,304 KB
testcase_04	AC	8 ms; 18,432 KB
testcase_05	AC	373 ms; 39,580 KB
testcase_06	AC	344 ms; 33,544 KB
testcase_07	AC	240 ms; 24,676 KB
testcase_08	AC	229 ms; 26,660 KB
testcase_09	AC	312 ms; 39,500 KB
testcase_10	AC	176 ms; 21,164 KB
testcase_11	AC	388 ms; 28,640 KB
testcase_12	AC	336 ms; 37,916 KB
testcase_13	AC	274 ms; 34,972 KB
testcase_14	AC	406 ms; 34,204 KB
testcase_15	AC	232 ms; 19,372 KB
testcase_16	AC	356 ms; 32,416 KB
testcase_17	AC	290 ms; 40,992 KB
testcase_18	AC	461 ms; 35,128 KB
testcase_19	AC	265 ms; 24,064 KB
testcase_20	AC	284 ms; 29,976 KB
testcase_21	AC	259 ms; 33,548 KB
testcase_22	AC	265 ms; 30,492 KB
testcase_23	AC	346 ms; 28,396 KB
testcase_24	AC	297 ms; 21,896 KB
testcase_25	AC	319 ms; 27,724 KB
testcase_26	AC	229 ms; 19,708 KB
testcase_27	AC	264 ms; 19,512 KB
testcase_28	AC	367 ms; 32,748 KB
testcase_29	AC	219 ms; 37,536 KB
testcase_30	AC	255 ms; 31,136 KB
testcase_31	AC	266 ms; 29,208 KB
testcase_32	AC	345 ms; 33,800 KB
testcase_33	AC	326 ms; 37,916 KB
testcase_34	AC	176 ms; 21,896 KB
testcase_35	AC	548 ms; 42,544 KB
testcase_36	AC	521 ms; 42,668 KB
testcase_37	AC	548 ms; 42,672 KB
testcase_38	AC	528 ms; 42,676 KB
testcase_39	AC	539 ms; 42,544 KB
testcase_40	AC	9 ms; 18,432 KB
testcase_41	AC	9 ms; 18,304 KB

ソースコード

#include<bits/stdc++.h>

using namespace std;
using ll = int_fast64_t;
using ld = long double;
#define int ll
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define H pair<int, int>
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)
#define vec vector
#define pb emplace_back
constexpr int MXN = 500000 + 100;
constexpr ll inf = 3 * 1e18;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }



class LCA {
	int n;
	int table[MXN][25];
	vec<int>(*e)[MXN];
	int dep[MXN];
public:
	void init(const int& size, vector<int>(&f)[MXN]) {
		n = size;
		e = &f;
		for (int i = 0; i <= n; i++) for (int j = 0; j < 25; j++)
			table[i][j] = -1;
	}
	void build(const int& st) {
		dfs(st, -1, 0);
		for (int j = 0; j < 24; j++)for (int i = 0; i <= n; i++) {
			if (table[i][j] > -1) table[i][j + 1] = table[table[i][j]][j];
		}
	}
	int get(int x, int y) {
		if (dep[x] > dep[y]) swap(x, y);
		for (int i = 24; i >= 0; i--) {
			if (((dep[y] - dep[x]) >> i) & 1) y = table[y][i];
		}
		if (x == y) return x;
		for (int i = 24; i >= 0; i--) {
			if (table[x][i] != table[y][i]) {
				x = table[x][i], y = table[y][i];
			}
		}
		return table[x][0];
	}
	int operator[](const int& x) const {
		return dep[x];
	}
private:
	void dfs(int v, int p, int d) {
		table[v][0] = p;
		dep[v] = d;
		for (auto& to : (*e)[v]) {
			if (to != p) dfs(to, v, d + 1);
		}
	}
};



int n, k, q;
vec<int>a, c;
int dp[200000];
LCA lca;
int rr;
vec<int>e[MXN];
int dat[400000];
void update(int x, int y) {
	x += rr - 1;
	dat[x] = y;
	while (x > 0) {
		x = (x - 1) / 2;
		dat[x] = dat[x * 2 + 1];
		if (dat[x * 2 + 2] >= 0) dat[x] = lca.get(dat[x], dat[x * 2 + 2]);
	}
}
int query(int i, int a, int b, int l, int r) {
	if (b <= l || r <= a) return -1;
	if (a <= l && r <= b) return dat[i];
	int x = query(i * 2 + 1, a, b, l, (l + r) / 2);
	int y = query(i * 2 + 2, a, b, (l + r) / 2, r);
	if (x < y) swap(x, y);
	if (x >= 0 && y >= 0) return lca.get(x, y);
	return x;
}
int query(int a, int b) {
	return query(0, a, b, 0, rr);
}


void dfs(int x, int p, int v) {
	dp[x] = v;
	for (auto g : e[x]) {
		dfs(g, x, max(v, c[g]));
	}
}


void solve() {
	cin >> n >> k >> q;
	a.clear(); c.clear();
	rep(i, n) c.pb(read());
	rep(i, k) a.pb(read() - 1);
	rep(i, n - 1) {
		int u, v; cin >> u >> v;
		u--; v--;
		e[v].pb(u);
	}
	rep(i, 400000) dat[i] = -1;
	lca.init(n, e);
	lca.build(0);
	rr = 1;
	while (rr < k) rr *= 2;
	rep(i, k) update(i, a[i]);
	dfs(0, -1, c[0]);
	while (q > 0) {
		q--;
		int t, x, y; cin >> t >> x >> y;
		if (t == 1) {
			x--; y--;
			update(x, y);
		}
		else {
			x--;
			int r = query(x, y);
			cout << dp[r] << endl;
		}
	}
}
signed main() {
	solve();
}