結果

問題 No.1030 だんしんぐぱーりない
ユーザー heno239heno239
提出日時 2020-04-17 22:06:22
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 294 ms / 2,000 ms
コード長 5,043 bytes
コンパイル時間 1,583 ms
コンパイル使用メモリ 126,100 KB
実行使用メモリ 16,644 KB
最終ジャッジ日時 2024-04-14 14:17:14
合計ジャッジ時間 10,142 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
11,796 KB
testcase_01 AC 5 ms
11,672 KB
testcase_02 AC 4 ms
12,044 KB
testcase_03 AC 4 ms
12,244 KB
testcase_04 AC 4 ms
11,224 KB
testcase_05 AC 191 ms
15,608 KB
testcase_06 AC 178 ms
15,264 KB
testcase_07 AC 126 ms
13,480 KB
testcase_08 AC 129 ms
13,640 KB
testcase_09 AC 158 ms
16,268 KB
testcase_10 AC 84 ms
11,996 KB
testcase_11 AC 207 ms
14,028 KB
testcase_12 AC 148 ms
14,712 KB
testcase_13 AC 143 ms
14,948 KB
testcase_14 AC 224 ms
15,456 KB
testcase_15 AC 126 ms
12,812 KB
testcase_16 AC 173 ms
14,388 KB
testcase_17 AC 149 ms
15,720 KB
testcase_18 AC 228 ms
15,568 KB
testcase_19 AC 123 ms
12,604 KB
testcase_20 AC 132 ms
13,392 KB
testcase_21 AC 136 ms
14,400 KB
testcase_22 AC 128 ms
13,432 KB
testcase_23 AC 182 ms
14,212 KB
testcase_24 AC 162 ms
13,120 KB
testcase_25 AC 176 ms
14,452 KB
testcase_26 AC 114 ms
11,860 KB
testcase_27 AC 138 ms
13,152 KB
testcase_28 AC 193 ms
14,424 KB
testcase_29 AC 106 ms
14,720 KB
testcase_30 AC 112 ms
13,736 KB
testcase_31 AC 133 ms
13,068 KB
testcase_32 AC 188 ms
15,592 KB
testcase_33 AC 169 ms
15,512 KB
testcase_34 AC 86 ms
12,788 KB
testcase_35 AC 294 ms
16,644 KB
testcase_36 AC 274 ms
16,636 KB
testcase_37 AC 286 ms
16,644 KB
testcase_38 AC 291 ms
16,520 KB
testcase_39 AC 280 ms
16,644 KB
testcase_40 AC 5 ms
12,776 KB
testcase_41 AC 4 ms
11,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 10000;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

vector<int> G[100000];
int n;
int root;
int parent[17][100000];
int depth[100000];
void dfs(int v, int p, int d) {
	parent[0][v] = p;
	depth[v] = d;
	for (int i = 0; i < (int)G[v].size(); i++) {
		if (G[v][i] != p)dfs(G[v][i], v, d + 1);
	}
}
void init(int V) {
	dfs(root, -1, 0);
	for (int k = 0; k + 1 < 17; k++) {
		for (int v = 0; v < V; v++) {
			if (parent[k][v] < 0)parent[k + 1][v] = -1;
			else parent[k + 1][v] = parent[k][parent[k][v]];
		}
	}
}
int lca(int u, int v) {
	if (depth[u] > depth[v])swap(u, v);
	for (int k = 0; k < 17; k++) {
		if ((depth[v] - depth[u]) >> k & 1) {
			v = parent[k][v];
		}
	}
	if (u == v)return u;
	for (int k = 16; k >= 0; k--) {
		if (parent[k][u] != parent[k][v]) {
			u = parent[k][u];
			v = parent[k][v];
		}
	}
	return parent[0][u];
}

struct SegT {
private:
	int sz; vector<int> node;
	const int init_c = n;
public:
	SegT(int n) {
		sz = 1;
		while (sz < n)sz *= 2;
		node.resize(2 * sz - 1, init_c);
	}
	int f(int a, int b) {
		if (a >= n)return b;
		else if (b >= n)return a;
		return lca(a,b);
	}
	void update(int k, int a) {
		k += sz - 1;
		node[k] = a;
		while (k > 0) {
			k = (k - 1) / 2;
			node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
		}
	}
	int query(int a, int b, int k = 0, int l = 0, int r = -1) {
		if (r < 0)r = sz;
		if (r <= a || b <= l)return init_c;
		else if (a <= l && r <= b)return node[k];
		else {
			int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
			int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
			return f(vl, vr);
		}
	}
};
void solve() {
	int k, q; cin >> n >> k >> q;
	vector<int> c(n);
	rep(i, n)cin >> c[i];
	vector<int> a(k);
	rep(i, k) {
		cin >> a[i]; a[i]--;
	}
	SegT st(k);
	rep(i, n - 1) {
		int e, f; cin >> e >> f; e--; f--;
		G[f].push_back(e);
	}
	init(n);
	rep(i, k) {
		st.update(i, a[i]);
	}

	vector<int> maxcost(c);
	queue<P> que; que.push({ 0,c[0] });
	while (!que.empty()) {
		P p = que.front(); que.pop();
		int id = p.first;
		maxcost[id] = p.second;
		for (int to : G[id]) {
			que.push({ to,max(p.second,c[to]) });
		}
	}

	rep(aa, q) {
		int t; cin >> t;
		if (t == 1) {
			int x, y; cin >> x >> y; x--; y--;
			st.update(x, y);
		}
		else {
			int l, r; cin >> l >> r; l--; r--;
			int v = st.query(l, r + 1);
			cout << maxcost[v] << "\n";
		}
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(7);
	//init_f();
	//init();
	//experi();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}
0