結果

問題 No.1197 モンスターショー
ユーザー heno239heno239
提出日時 2023-02-01 20:53:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 798 ms / 3,000 ms
コード長 8,060 bytes
コンパイル時間 2,165 ms
コンパイル使用メモリ 157,320 KB
実行使用メモリ 78,612 KB
最終ジャッジ日時 2023-09-14 06:48:01
合計ジャッジ時間 17,685 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 17 ms
19,696 KB
testcase_01 AC 17 ms
19,768 KB
testcase_02 AC 17 ms
19,772 KB
testcase_03 AC 17 ms
19,764 KB
testcase_04 AC 17 ms
19,772 KB
testcase_05 AC 17 ms
19,764 KB
testcase_06 AC 17 ms
19,768 KB
testcase_07 AC 224 ms
65,988 KB
testcase_08 AC 155 ms
39,836 KB
testcase_09 AC 326 ms
55,564 KB
testcase_10 AC 316 ms
54,252 KB
testcase_11 AC 119 ms
31,432 KB
testcase_12 AC 71 ms
25,284 KB
testcase_13 AC 171 ms
42,936 KB
testcase_14 AC 229 ms
43,384 KB
testcase_15 AC 112 ms
30,548 KB
testcase_16 AC 393 ms
61,932 KB
testcase_17 AC 407 ms
62,552 KB
testcase_18 AC 118 ms
33,924 KB
testcase_19 AC 349 ms
54,056 KB
testcase_20 AC 86 ms
30,776 KB
testcase_21 AC 68 ms
22,424 KB
testcase_22 AC 31 ms
22,244 KB
testcase_23 AC 249 ms
45,532 KB
testcase_24 AC 222 ms
44,968 KB
testcase_25 AC 137 ms
36,456 KB
testcase_26 AC 169 ms
37,076 KB
testcase_27 AC 351 ms
57,776 KB
testcase_28 AC 196 ms
39,736 KB
testcase_29 AC 201 ms
44,328 KB
testcase_30 AC 218 ms
48,192 KB
testcase_31 AC 179 ms
41,628 KB
testcase_32 AC 49 ms
21,000 KB
testcase_33 AC 123 ms
36,520 KB
testcase_34 AC 494 ms
64,892 KB
testcase_35 AC 462 ms
64,320 KB
testcase_36 AC 483 ms
64,812 KB
testcase_37 AC 485 ms
65,060 KB
testcase_38 AC 482 ms
65,132 KB
testcase_39 AC 477 ms
64,904 KB
testcase_40 AC 798 ms
78,612 KB
testcase_41 AC 17 ms
19,776 KB
testcase_42 AC 17 ms
20,056 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
メンバ関数 ‘ll Centroid_Decomposition::query(int)’ 内,
    inlined from ‘void solve()’ at main.cpp:385:21:
main.cpp:351:62: 警告: ‘id’ may be used uninitialized [-Wmaybe-uninitialized]
  351 |                                 res += pdist[g] - dists[g][id];
      |                                                              ^
main.cpp: 関数 ‘void solve()’ 内:
main.cpp:340:32: 備考: ‘id’ はここで定義されています
  340 |                 int g = c; int id;
      |                                ^~
メンバ関数 ‘void Centroid_Decomposition::add(int, int)’ 内,
    inlined from ‘void solve()’ at main.cpp:381:38:
main.cpp:331:43: 警告: ‘id’ may be used uninitialized [-Wmaybe-uninitialized]
  331 |                                 nums[g][id] += a;
      |                                           ^
main.cpp: 関数 ‘void solve()’ 内:
main.cpp:322:32: 備考: ‘id’ はここで定義されています
  322 |                 int g = c; int id;
      |                                ^~
メンバ関数 ‘void Centroid_Decomposition::add(int, int)’ 内,
    inlined from ‘void solve()’ at main.cpp:381:10:
main.cpp:331:43: 警告: ‘id’ may be used uninitialized [-Wmaybe-uninitialized]
  331 |                                 nums[g][id] += a;
      |                                           ^
main.cpp: 関数 ‘void solve()’ 内:
main.cpp:322:32: 備考: ‘id’ はここで定義されています
  322 |                 int g = c; int id;
      |                                ^~
メンバ関数 ‘void Centroid_Decomposition::add(int, int)’ 内,
    inlined from ‘void solve()’ at main.cpp:376:17:
main.cpp:331:43: 警告: ‘id’ may be used uninitialized [-Wmaybe-uninitialized]
  331 |                                 nums[g][id] += a;
      |                                           ^
main.cpp: 関数 ‘void solve()’ 内:
main.cpp:322:32: 備考: ‘id’ はここで定義され��

ソースコード

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>
#include<array>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
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 double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % 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, ll 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 = 1 << 20;
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];
}

ul gcd(ul a, ul b) {
	if (a < b)swap(a, b);
	while (b) {
		ul r = a % b; a = b; b = r;
	}
	return a;
}



struct lcagraph {
private:
	int n;
	vector<vector<int>> G;
	vector<vector<int>> parent;
	vector<int> depth;
	int root;
	int tmp;
public:
	lcagraph(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	lcagraph() {}
	void init(int n_) {
		n = n_;
		G.resize(n);
		parent.resize(n);
		depth.resize(n);
		tmp = 0;
		int cop = n;
		while (cop) {
			tmp++; cop /= 2;
		}
		rep(i, n)parent[i].resize(tmp);
		root = 0;
	}
	void add_edge(int a, int b) {
		G[a].push_back(b);
		G[b].push_back(a);
	}
	void dfs(int id, int fr, int d) {
		parent[id][0] = fr;
		depth[id] = d;
		rep(j, G[id].size()) {
			int to = G[id][j];
			if (to == fr)continue;
			dfs(to, id, d + 1);
		}
	}
	void complete(int r = 0) {
		root = r;
		dfs(root, -1, 0);
		rep(j, tmp - 1)rep(i, n) {
			if (parent[i][j] < 0)parent[i][j + 1] = -1;
			else parent[i][j + 1] = parent[parent[i][j]][j];
		}
	}
	int lca(int u, int v) {
		if (depth[u] > depth[v])swap(u, v);
		for (int k = 0; k < tmp; k++) {
			if ((depth[v] - depth[u]) >> k & 1) {
				v = parent[v][k];
			}
		}
		if (u == v)return u;
		for (int k = tmp - 1; k >= 0; k--) {
			if (parent[u][k] != parent[v][k]) {
				u = parent[u][k];
				v = parent[v][k];
			}
		}
		return parent[u][0];
	}
	int dep(int x) {
		return depth[x];
	}
	int dist(int x, int y) {
		int l = lca(x, y);
		return depth[x] + depth[y] - 2 * depth[l];
	}
	int find_par(int x, int d) {
		rep(i, tmp)if (d & (1 << i))x = parent[x][i];
		return x;
	}
};



struct edge {
	int to;
};
struct Centroid_Decomposition {
private:
	int n;
	vector<vector<edge>> G;

	vector<vector<int>> fG; int root;
	vector<int> par, parid;
	vector<vector<int>> pardists;
	vector<vector<ll>> dists;
	vector<vector<int>> nums;
	vector<ll> pdist;
	vector<int> pnum;

	lcagraph lg;
public:
	Centroid_Decomposition(int n_) {
		n = n_;
		G.resize(n);
		par.resize(n);
		parid.resize(n);
		pardists.resize(n);

		fG.resize(n); root = -1;
		dists.resize(n);
		nums.resize(n);
		pdist.resize(n);
		pnum.resize(n);
	}
	void add_edge(int a, int b) {
		G[a].push_back({ b });
		G[b].push_back({ a });
	}

	void complete() {
		vector<int> exi(n, 0);
		vector<int> ori(n); rep(i, n)ori[i] = i;


		int tmp = 0;
		function<int(int, int, int&, int&)> szdfs = [&](int id, int fr, int& g, int& sz)->int {
			int res = 1;
			int ma = 0;
			for (edge e : G[id]) {
				if (tmp != exi[e.to])continue;
				if (e.to == fr)continue;
				int nex = szdfs(e.to, id, g, sz);
				ma = max(ma, nex);
				res += nex;
			}
			if (ma <= sz / 2 && sz - res <= sz / 2)g = id;
			return res;
		};

		function<int(vector<int>)> cdfs = [&](vector<int> v)->int {
			tmp++;
			if (v.empty())return 0;

			for (int id : v) {
				exi[id]++;
			}
			int g;
			int sz = v.size();
			szdfs(v[0], -1, g, sz);

			pnum[g] = 0;
			pardists[g].push_back(0);

			for (edge e : G[g]) {
				if (!exi[e.to])continue;
				if (exi[e.to] != tmp)continue;
				int tm = dists[g].size();
				dists[g].push_back(0);
				nums[g].push_back(0);

				queue<P> vs;
				vs.push({ e.to,g });
				int d = 0;
				vector<int> nex;
				while (!vs.empty()) {
					d++;
					int len = vs.size();
					rep(aa, len) {
						P p = vs.front(); vs.pop();
						int v = p.first, fr = p.second;

						pardists[v].push_back(d);
						nex.push_back(v);
						for (edge e : G[v]) {
							if (e.to == fr)continue;
							if (tmp != exi[e.to])continue;
							vs.push({ e.to,v });
						}
					}
				}

				int ng = cdfs(nex);
				fG[g].push_back(ng);
				par[ng] = g;
				parid[ng] = tm;

			}
			for (int id : v) {
				exi[id]--;
			}
			tmp--;
			return g;
		};
		root = cdfs(ori); par[root] = -1;

		rep(i, n)reverse(all(pardists[i]));
		//lca
		lg.init(n);
		rep(i, n) {
			for (edge e : G[i]) {
				if (i < e.to) {
					lg.add_edge(i, e.to);
				}
			}
		}
		lg.complete();
	}
	void add(int c, int a) {
		int g = c; int id;
		for(int i=0;g>=0;i++){
			if (g == c) {
				pnum[g] += a;
			}
			else {
				//d(g,c)
				int dist = pardists[c][i];
				pnum[g] += a;
				nums[g][id] += a;
				pdist[g] += a * dist;
				dists[g][id] += a * dist;
			}
			id = parid[g];
			g = par[g];
		}
	}
	ll query(int c) {
		int g = c; int id;
		ll res = 0;
		for(int i=0;g>=0;i++){
			if (g == c) {
				res += pdist[g];
			}
			else {
				//d(g,c)
				ll dist = pardists[c][i];
				//cout << res << "\n";

				res += pdist[g] - dists[g][id];
				//cout << res << "\n";
				//cout << pnum[g] << "wow" << nums[g][id] << "\n";
				res += (pnum[g] - nums[g][id]) * dist;
				//cout << "? " << g << " " << c << " " << dist << " " << res << "\n";
			}
			id = parid[g];
			g = par[g];
		}
		return res;
	}
};


void solve() {
	int n, k, q; cin >> n >> k >> q;
	vector<int> c(k); rep(i, k) {
		cin >> c[i]; c[i]--;
	}
	Centroid_Decomposition cd(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		cd.add_edge(a, b);
	}
	cd.complete();
	rep(i, k)cd.add(c[i], 1);
	rep(i, q) {
		int t; cin >> t;
		if (t == 1) {
			int p, d; cin >> p >> d; p--; d--;
			cd.add(c[p], -1); c[p] = d; cd.add(c[p], 1);
		}
		else {
			int p; cin >> p; p--;
			ll ans = cd.query(p);
			cout << ans << "\n";
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}
0