結果

問題 No.1030 だんしんぐぱーりない
ユーザー ThistleThistle
提出日時 2020-04-02 02:57:54
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 456 ms / 2,000 ms
コード長 5,580 bytes
コンパイル時間 2,062 ms
コンパイル使用メモリ 134,816 KB
実行使用メモリ 48,168 KB
最終ジャッジ日時 2023-09-15 23:20:21
合計ジャッジ時間 15,022 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
23,896 KB
testcase_01 AC 10 ms
24,204 KB
testcase_02 AC 10 ms
23,952 KB
testcase_03 AC 10 ms
23,908 KB
testcase_04 AC 9 ms
23,872 KB
testcase_05 AC 319 ms
45,468 KB
testcase_06 AC 276 ms
40,592 KB
testcase_07 AC 207 ms
30,912 KB
testcase_08 AC 202 ms
33,280 KB
testcase_09 AC 256 ms
45,288 KB
testcase_10 AC 145 ms
26,320 KB
testcase_11 AC 317 ms
35,828 KB
testcase_12 AC 276 ms
44,796 KB
testcase_13 AC 232 ms
40,372 KB
testcase_14 AC 346 ms
40,544 KB
testcase_15 AC 195 ms
24,260 KB
testcase_16 AC 300 ms
37,664 KB
testcase_17 AC 252 ms
47,356 KB
testcase_18 AC 373 ms
40,576 KB
testcase_19 AC 223 ms
30,616 KB
testcase_20 AC 242 ms
35,520 KB
testcase_21 AC 222 ms
40,268 KB
testcase_22 AC 236 ms
37,420 KB
testcase_23 AC 304 ms
35,404 KB
testcase_24 AC 253 ms
28,744 KB
testcase_25 AC 282 ms
33,440 KB
testcase_26 AC 200 ms
24,268 KB
testcase_27 AC 233 ms
24,460 KB
testcase_28 AC 328 ms
37,972 KB
testcase_29 AC 203 ms
42,696 KB
testcase_30 AC 215 ms
37,432 KB
testcase_31 AC 235 ms
35,312 KB
testcase_32 AC 297 ms
40,484 KB
testcase_33 AC 283 ms
44,980 KB
testcase_34 AC 146 ms
28,364 KB
testcase_35 AC 456 ms
48,148 KB
testcase_36 AC 437 ms
48,168 KB
testcase_37 AC 447 ms
48,072 KB
testcase_38 AC 447 ms
47,960 KB
testcase_39 AC 436 ms
48,160 KB
testcase_40 AC 10 ms
23,896 KB
testcase_41 AC 10 ms
23,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>

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 xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#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 range(i,v) for(auto& (i) : v)
#define mkp make_pair
#define mem(x,k) memset(x,k,sizeof(x))
#define vec vector
#define pb emplace_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==(ll)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define itn int
#define pri_que priority_queue
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cdf int q810; cin>>q810; rep(q114,q810) 
#define cyes cout<<"Yes\n"
#define cno cout<<"No\n"
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
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; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; ll k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
	return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
	if (!fact_[0]) {
		fact_[0] = 1; comp_[0] = 1;
		for (int i = 1; i < fn_; i++)
			fact_[i] = fact_[i - 1] * i % Mod;
		comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
		for (int i = fn_ - 2; i > 0; i--)
			comp_[i] = comp_[i + 1] * (i + 1) % Mod;
	}
	if (x < y) return 0;
	return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
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--;
			a[x] = y;
			update(x, y);
		}
		else {
			x--;
			int r = query(x, y);
			cout << dp[r] << endl;
		}
	}
}
signed main() {
	solve();
}
0