結果
問題 | No.2618 除霊 |
ユーザー |
|
提出日時 | 2024-01-26 23:15:32 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,784 bytes |
コンパイル時間 | 2,227 ms |
コンパイル使用メモリ | 181,052 KB |
実行使用メモリ | 42,624 KB |
最終ジャッジ日時 | 2024-09-28 09:03:51 |
合計ジャッジ時間 | 22,725 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 27 WA * 16 |
ソースコード
#include<bits/stdc++.h>using namespace std;using ll = long long;using pll = pair<ll, ll>;#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)#define rep(i, n) drep(i, 0, n - 1)#define all(a) (a).begin(), (a).end()#define pb push_back#define fi first#define se secondmt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());const ll MOD1000000007 = 1000000007;const ll MOD998244353 = 998244353;const ll MOD[3] = {999727999, 1070777777, 1000000007};const ll LINF = 1LL << 60LL;const int IINF = (1 << 30) - 1;template<typename T>struct edge{int from, to;T cost;edge(){}edge(int to, T cost = 1) : from(-1), to(to), cost(cost){}edge(int from, int to, T cost) : from(from), to(to), cost(cost){}};template<typename T>struct redge{int from, to;T cap, cost;int rev;redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){}redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){}};template<typename T> using Edges = vector<edge<T>>;template<typename T> using weighted_graph = vector<Edges<T>>;template<typename T> using tree = vector<Edges<T>>;using unweighted_graph = vector<vector<int>>;template<typename T> using residual_graph = vector<vector<redge<T>>>;void solve(){int n; cin >> n;tree<int> T(n);for(int i=0; i<n-1; i++){int u, v; cin >> u >> v;u--; v--;T[u].push_back(edge<int>(v));T[v].push_back(edge<int>(u));}int m; cin >> m;vector<bool> check(n, false);for(int i=0; i<m; i++){int v; cin >> v;v--;check[v] = true;}vector<int> dp1(n, 0);vector<int> dp2(n, 0);vector<bool> marked(n, false);function<void(int, int)> dfs12 = [&](int v, int p){//calc dp1bool flg = false;for(edge<int> e : T[v]) if(e.to!=p){dfs12(e.to, v);dp1[v] += dp2[e.to];if(check[e.to]) flg = true;}dp1[v] += flg;if(!check[v]){if(flg){marked[v] = true;for(edge<int> e : T[v]) if(e.to!=p){dp2[v] += dp2[e.to];}dp2[v]++;}else{for(edge<int> e : T[v]) if(e.to!=p){dp2[v] += dp2[e.to];}}}else{marked[v] = true;dp2[v] = 1;for(edge<int> e : T[v]) if(e.to!=p){if(!marked[e.to]){dp2[v] += dp2[e.to]+1;}else{dp2[v] += dp2[e.to];}}}}; dfs12(0, -1);//for(int i=0; i<n; i++) cout << dp1[i] << " \n"[i==n-1];//for(int i=0; i<n; i++) cout << dp2[i] << " \n"[i==n-1];vector<int> dp3(n, 0), dp4(n, 0);vector<bool> marked2(n, false);vector<int> ans(n, 0);function<void(int, int)> dfs3 = [&](int v, int p){//calc ans{ans[v] = dp3[v];for(edge<int> e : T[v]) if(e.to!=p){ans[v] += dp1[e.to];}}//calc dp3{int sum = dp4[v];int cnt = 0;if(p>-1){if(check[p]) cnt++;}for(edge<int> e : T[v]) if(e.to!=p){sum += dp2[e.to];if(check[e.to]) cnt++;}for(edge<int> e : T[v]) if(e.to!=p){dp3[e.to] = sum - dp2[e.to];if(check[e.to]){if(cnt>1) dp3[e.to]++;}else{if(cnt>0) dp3[e.to]++;}}}//calc dp4{if(!check[v]){int sum = dp4[v];int cnt = 0;if(p!=-1&&check[p]) cnt++;for(edge<int> e : T[v]) if(e.to!=p){sum += dp2[e.to];if(check[e.to]) cnt++;}for(edge<int> e : T[v]) if(e.to!=p){if(check[e.to]){if(cnt>1){dp4[e.to] = sum-dp2[e.to]+1;marked2[e.to] = true;}else{dp4[e.to] = sum-dp2[e.to];}}else{if(cnt>0){dp4[e.to] = sum-dp2[e.to]+1;marked2[e.to] = true;}else{dp4[e.to] = sum-dp2[e.to];}}}}if(check[v]){int sum = dp4[v];if(!marked2[v]) sum++;for(edge<int> e : T[v]) if(e.to!=p){sum += dp2[e.to];if(!marked[e.to]) sum++;}for(edge<int> e : T[v]) if(e.to!=p){marked2[e.to] = true;if(marked[e.to]){dp4[e.to] = sum - dp2[e.to];}else{dp4[e.to] = sum - (dp2[e.to]+1);}dp4[e.to]++;}}}for(edge<int> e : T[v]) if(e.to!=p){dfs3(e.to, v);}}; dfs3(0, -1);//for(int i=0; i<n; i++) cout << dp3[i] << " \n"[i==n-1];//for(int i=0; i<n; i++) cout << dp4[i] << " \n"[i==n-1];for(int i=0; i<n; i++) cout << ans[i] << endl;}int main(){cin.tie(nullptr);ios::sync_with_stdio(false);int T=1;//cin >> T;while(T--) solve();}