結果

問題 No.1197 モンスターショー
コンテスト
ユーザー HIR180
提出日時 2020-08-22 13:39:31
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,124 bytes
コンパイル時間 6,217 ms
コンパイル使用メモリ 255,944 KB
最終ジャッジ日時 2025-01-13 07:54:43
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 7 WA * 15 TLE * 19
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:154:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  154 |         scanf("%d%d%d", &n, &k, &q);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp:156:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  156 |                 scanf("%d", &c[i]);
      |                 ~~~~~^~~~~~~~~~~~~
main.cpp:159:32: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  159 |                 int a, b; scanf("%d%d", &a, &b);
      |                           ~~~~~^~~~~~~~~~~~~~~~
main.cpp:165:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  165 |                 int ty; scanf("%d", &ty);
      |                         ~~~~~^~~~~~~~~~~
main.cpp:167:34: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  167 |                 if(ty == 1) scanf("%d%d", &a, &b);
      |                             ~~~~~^~~~~~~~~~~~~~~~
main.cpp:168:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  168 |                 else scanf("%d", &a);
      |                      ~~~~~^~~~~~~~~~

ソースコード

diff # 

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}

#define SZ 100005
vector<int>edge[SZ];
int up[20][SZ],dep[SZ];
struct dbling{
	bool ready = 0;
	void dfs(int v,int u,int d){
		up[0][v] = u; dep[v] = d;
		rep(i,edge[v].size()){
			if(edge[v][i] == u) continue;
			dfs(edge[v][i], v, d+1);
		}
	}
	void prepare(){
	    dfs(1,-1,0);
		rep(j,19){
			rep(i,SZ){
				if(up[j][i] == -1) up[j+1][i] = up[j][i];
				else up[j+1][i] = up[j][up[j][i]];
			}
		}
		ready = 1;
	}
	int get(int a,int b){
		if(dep[a] > dep[b]) swap(a,b);
		int D = dep[b]-dep[a];
		rep(i,20){
			if(((D>>i)&1)) b = up[i][b];
		}
		if(a == b) return a;
		for(int i=19;i>=0;i--){
			if(up[i][a] != up[i][b]){
				a = up[i][a];
				b = up[i][b];
			}
		}
		return up[0][a];
	}
	int get_dist(int a,int b){
		int c = get(a,b);
		return dep[a]+dep[b]-2*dep[c];
	}
	int get_dist(int a,int b,int c){
		//assuming c is lca of (a,b)
		return dep[a]+dep[b]-2*dep[c];
	}
	int go_up(int v,int a){
	    if(dep[v] < a) return -1;
	    rep(i,20) if(((a>>i)&1)) v = up[i][v];
	    return v;
	}
	//a ---- b
	//と並べたときのx番目 (1-indexed)
	//存在しない場合は-1を返す
	//verified : opencup Warsaw I
	int v_on_path(int a,int b,int x){
		int c = get(a,b);
		int d = get_dist(a,b,c);
		if(x <= 0 || x > d+1) return -1;
		if(x <= dep[a]-dep[c]+1){
			return go_up(a, x-1);
		}
		else{
			x = d+2-x;
			return go_up(b, x-1);
		}
	}
}kaede;

int n, k, q, c[100005];
int cnt[100005];
constexpr int B = 334;
vector<P1>Q;
ll sum[100005];
int sub[100005];
void dfs(int v, int u, int d){
	sum[1] += 1LL * d * cnt[v];
	rep(i, edge[v].size()){
		if(edge[v][i] == u) continue;
		dfs(edge[v][i], v, d+1);
		sub[v] += sub[edge[v][i]];
	}
	sub[v] += cnt[v];
}
void dfs2(int v, int u){
	rep(i, edge[v].size()){
		if(edge[v][i] == u) continue;
		sum[edge[v][i]] = sum[v] + k - 2*sub[edge[v][i]];
		dfs2(edge[v][i], v);
	}
}
int main(){
	scanf("%d%d%d", &n, &k, &q);
	repn(i, k){
		scanf("%d", &c[i]);
	}
	rep(i, n-1){
		int a, b; scanf("%d%d", &a, &b);
		edge[a].pb(b);
		edge[b].pb(a);
	}
	kaede.prepare();
	rep(i, q){
		int ty; scanf("%d", &ty);
		int a, b = -1;
		if(ty == 1) scanf("%d%d", &a, &b);
		else scanf("%d", &a);
		Q.pb(mp(ty, mp(a, b)));
	}
	for(int i=0;i<q;i+=B){
		memset(cnt, 0, sizeof(cnt));
		repn(j, k) cnt[c[j]] ++;
		sum[1] = 0;
		dfs(1, -1, 0);
		dfs2(1, -1);
		vector<int>vec;
		for(int j=i;j<i+B && j<q;j++){
			if(Q[j].fi == 1) vec.pb(Q[j].sc.fi);
		}
		//repn(i, n) cout << sum[i] << endl;
		SORT(vec); ERASE(vec);
		vector<int>gen;
		rep(i, vec.size()) gen.pb(c[vec[i]]);
		for(int j=i;j<i+B && j<q;j++){
			if(Q[j].fi == 1) {
				c[Q[j].sc.fi] = Q[j].sc.sc;
			}
			else{
				ll ans = sum[Q[j].sc.fi];
				rep(k, vec.size()){
					ans -= kaede.get_dist(Q[j].sc.fi, gen[k]);
					ans += kaede.get_dist(Q[j].sc.fi, c[vec[k]]);
				}
				printf("%lld\n", ans);
			}
		}
	}
}
0