結果

問題 No.1197 モンスターショー
コンテスト
ユーザー HIR180
提出日時 2020-08-22 13:55:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,897 bytes
コンパイル時間 3,883 ms
コンパイル使用メモリ 260,624 KB
最終ジャッジ日時 2025-01-13 08:12:09
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 34 TLE * 7
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:168:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  168 |         scanf("%d%d%d", &n, &k, &q);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp:170:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  170 |                 scanf("%d", &c[i]);
      |                 ~~~~~^~~~~~~~~~~~~
main.cpp:173:32: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  173 |                 int a, b; scanf("%d%d", &a, &b);
      |                           ~~~~~^~~~~~~~~~~~~~~~
main.cpp:179:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  179 |                 int ty; scanf("%d", &ty);
      |                         ~~~~~^~~~~~~~~~~
main.cpp:181:34: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  181 |                 if(ty == 1) scanf("%d%d", &a, &b);
      |                             ~~~~~^~~~~~~~~~~~~~~~
main.cpp:182:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  182 |                 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];
P ar[SZ*2]={};
int pos[SZ]={},id=0,up[SZ],dep[SZ];
P mn[2][20][SZ*2]={};
int sz[SZ*2]={},in[SZ],out[SZ],rev[SZ*2];

struct adj_finder{
	//SZは元の木の頂点数より大
	//外部でedge[]に隣接状況を持って置く必要あり
	void dfs(int v,int u,int d){
		pos[v] = in[v] = id;
		up[v] = u;
		dep[v] = d;
		rev[id] = v;
		ar[id++] = mp(d,id);
		for(int i=0;i<edge[v].size();i++){
			if(edge[v][i] == u) continue;
			dfs(edge[v][i],v,d+1);
			rev[id] = v;
			ar[id++] = mp(d,id);
		}
		out[v] = id-1;
	}
	void prepare(){
		dfs(1,-1,0);
		for(int i=0;i<id;i++){
			mn[0][0][i] = ar[i];
			mn[1][0][i] = mp(INF,INF);
		}
		for(int j=0;j<19;j++){
			for(int i=0;i<id;i++){
				if(i+(1<<j) >= id) rep(x,2) mn[x][j+1][i] = mn[x][j][i];
				else{
					mn[0][j+1][i] = min(mn[0][j][i], mn[0][j][i+(1<<j)]);
					mn[1][j+1][i] = mp(INF,INF);
					int best_v = rev[mn[0][j+1][i].second];
					rep(x,2){
						if(mn[x][j][i].second != INF && rev[mn[x][j][i].second] != best_v) mn[1][j+1][i] = min(mn[1][j+1][i], mn[x][j][i]);
						if(mn[x][j][i+(1<<j)].second != INF && rev[mn[x][j][i+(1<<j)].second] != best_v) mn[1][j+1][i] = min(mn[1][j+1][i], mn[x][j][i+(1<<j)]);
					}
				}
			}
		}
		for(int i=1;i<SZ*2;i++){
			for(int j=0;j<20;j++){
				if((1<<j) <= i && i <= (2<<j)){
					sz[i] = j;
					break;
				}
			}
		}
	}
	int get1(int a,int b){
		int len = b-a+1;
		int ty = sz[len];
		P p = min(mn[0][ty][a],mn[0][ty][b-(1<<ty)+1]);
		return p.second;
	}
	int get_dist(int a, int b){
	    int c = rev[get1(min(pos[a],pos[b]), max(pos[a],pos[b]))];
	    return dep[a]+dep[b]-2*dep[c];
	}
	int get2(int a,int b){
		int len = b-a+1;
		int ty = sz[len];
		P p = mp(INF,INF);
		int x = rev[get1(a,b)];
		rep(i,2){
			if(mn[i][ty][a].second != INF && rev[mn[i][ty][a].second] != x) p = min(p, mn[i][ty][a]);
			if(mn[i][ty][b-(1<<ty)+1].second != INF && rev[mn[i][ty][b-(1<<ty)+1].second] != x) p = min(p, mn[i][ty][b-(1<<ty)+1]);
		}
		return rev[p.second];
	}
	int near_v(int u,int v){
		if(in[u] <= in[v] && out[v] <= out[u]){
			return get2(pos[v], out[u]);
		}
		else return up[u];
	}
}kaede;

int n, k, q, c[100005];
int cnt[100005];
constexpr int B = 500;
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));
		memset(sub, 0, sizeof(sub));
		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);
		}
		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