結果
| 問題 | No.1030 だんしんぐぱーりない |
| ユーザー |
 Thistle
|
| 提出日時 | 2020-04-16 19:18:02 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 466 ms / 2,000 ms |
| コード長 | 5,392 bytes |
| コンパイル時間 | 2,086 ms |
| コンパイル使用メモリ | 135,304 KB |
| 実行使用メモリ | 49,892 KB |
| 最終ジャッジ日時 | 2024-11-14 22:18:45 |
| 合計ジャッジ時間 | 16,556 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 8 ms
15,232 KB |
| testcase_01 | AC | 9 ms
15,220 KB |
| testcase_02 | AC | 8 ms
15,232 KB |
| testcase_03 | AC | 9 ms
15,232 KB |
| testcase_04 | AC | 11 ms
15,360 KB |
| testcase_05 | AC | 330 ms
38,656 KB |
| testcase_06 | AC | 282 ms
32,896 KB |
| testcase_07 | AC | 197 ms
23,040 KB |
| testcase_08 | AC | 199 ms
25,216 KB |
| testcase_09 | AC | 263 ms
38,656 KB |
| testcase_10 | AC | 136 ms
18,816 KB |
| testcase_11 | AC | 315 ms
27,520 KB |
| testcase_12 | AC | 296 ms
36,096 KB |
| testcase_13 | AC | 241 ms
33,792 KB |
| testcase_14 | AC | 410 ms
33,124 KB |
| testcase_15 | AC | 180 ms
24,596 KB |
| testcase_16 | AC | 300 ms
36,736 KB |
| testcase_17 | AC | 267 ms
44,556 KB |
| testcase_18 | AC | 367 ms
41,296 KB |
| testcase_19 | AC | 213 ms
27,332 KB |
| testcase_20 | AC | 234 ms
34,276 KB |
| testcase_21 | AC | 225 ms
37,500 KB |
| testcase_22 | AC | 228 ms
34,388 KB |
| testcase_23 | AC | 296 ms
34,296 KB |
| testcase_24 | AC | 244 ms
25,676 KB |
| testcase_25 | AC | 267 ms
32,872 KB |
| testcase_26 | AC | 190 ms
24,708 KB |
| testcase_27 | AC | 220 ms
23,008 KB |
| testcase_28 | AC | 329 ms
37,492 KB |
| testcase_29 | AC | 209 ms
41,624 KB |
| testcase_30 | AC | 214 ms
34,352 KB |
| testcase_31 | AC | 225 ms
34,300 KB |
| testcase_32 | AC | 293 ms
40,176 KB |
| testcase_33 | AC | 289 ms
42,308 KB |
| testcase_34 | AC | 140 ms
25,184 KB |
| testcase_35 | AC | 460 ms
45,792 KB |
| testcase_36 | AC | 439 ms
49,000 KB |
| testcase_37 | AC | 466 ms
45,664 KB |
| testcase_38 | AC | 459 ms
49,892 KB |
| testcase_39 | AC | 447 ms
45,804 KB |
| testcase_40 | AC | 9 ms
21,960 KB |
| testcase_41 | AC | 8 ms
22,224 KB |
ソースコード
#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 = long long;
using ld = long double;
#define int long long
#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 mkp make_pair
#define vec vector
#define pb emplace_back
#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==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) for(int qq123_=(n);qq123_;qq123_--)
//#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; int 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 lcm(ll i, ll j) { return i / gcd(i, j) * j; }
ll mod_pow(ll x, ll n, ll p = mod) {
ll res = 1; x %= p;
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;
LCA lca;
vec<int>e[MXN];
int c[200000];
int a[200000];
void dfs(int x, int p, int d) {
chmax(c[x], d);
for (auto g : e[x]) {
if (g != p) dfs(g, x, c[x]);
}
}
int dat[500000];
int rr;
void update(int x, int t) {
x += rr - 1;
dat[x] = t;
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 0;
if (a <= l && r <= b) return dat[i];
int res = query(i * 2 + 1, a, b, l, (l + r) / 2);
int k=query(i * 2 + 2, a, b, (l + r) / 2, r);
if (res == 0) res = k;
else if (k && res) res = lca.get(k, res);
return res;
}
signed main() {
cin >> n >> k >> q;
rng(i, 1, n + 1) c[i] = read();
rep(i, k) a[i] = read();
rep(i, n - 1) {
int u, v; cin >> u >> v;
e[u].pb(v); e[v].pb(u);
}
dfs(1, 0, -1);
lca.init(n, e);
lca.build(1);
rr = 1; while (rr < k) rr *= 2;
rep(i, k) update(i, a[i]);
rep(i, q) {
if (read() == 1) {
int u = read() - 1;
a[u] = read();
update(u, a[u]);
}
else {
int u, v; cin >> u >> v;
u--;
int g = query(0, u, v, 0, rr);
cout << c[g] << endl;
}
}
}