結果
| 問題 | No.1718 Random Squirrel |
| ユーザー |
 otera
|
| 提出日時 | 2021-10-23 00:24:26 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 201 ms / 2,000 ms |
| コード長 | 9,813 bytes |
| コンパイル時間 | 2,976 ms |
| コンパイル使用メモリ | 223,780 KB |
| 最終ジャッジ日時 | 2025-01-25 04:40:51 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 31 |
ソースコード
/*** author: otera* created: 22.10.2021 22:23:55**/#include<bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using ull = unsigned long long;using uint = unsigned;#define repa(i, n) for(int i = 0; i < n; ++ i)#define repb(i, a, b) for(int i = a; i < b; ++ i)#define repc(i, a, b, c) for(int i = a; i < b; i += c)#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)#define rep1a(i, n) for(int i = 0; i <= n; ++ i)#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)#define per(i,n) for(int i=n-1;i>=0;i--)#define per1(i,n) for(int i=n;i>=1;i--)typedef pair<int, int> P;typedef pair<ll, ll> LP;#define pb push_back#define eb emplace_back#define fr first#define sc second#define all(c) c.begin(),c.end()#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define Sort(a) sort(all(a))#define Rev(a) reverse(all(a))#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))#define si(c) (int)(c).size()inline ll popcnt(ull a){ return __builtin_popcountll(a); }#define tpow(n) (1LL<<(n))#define unless(A) if(!(A))ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)#define vec(type,name,...) vector<type>name(__VA_ARGS__)#define VEC(type,name,size) vector<type>name(size);in(name)#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))template <class T> using vc = vector<T>;template <class T> using vvc = vector<vc<T>>;template <class T> using vvvc = vector<vvc<T>>;template <class T> using vvvvc = vector<vvvc<T>>;template <class T> using pq = priority_queue<T>;template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;template<class T> void scan(T& a){ cin >> a; }template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }void in(){}template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }void print(){ cout << ' '; }template<class T> void print(const T& a){ cout << a; }template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }int out(){ cout << '\n'; return 0; }template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }#define CHOOSE(a) CHOOSE2 a#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x#define debug_1(x1) cout<<#x1<<": "<<x1<<endl#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl#ifdef DEBUG#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }#else#define debug(...)#define dump(...)#endif#define int long longtemplate< typename U, typename T>struct Rerooting {struct Edge {int to;U date;T dp;};using F1 = function< T(T, T) >;using F2 = function< T(T, U) >;vector<vector<Edge>> g;vector<T> dp, subdp;const T ident;const F1 f1;const F2 f2;Rerooting(int n, const F1 &f1, const F2 &f2, const T &ident) : g(n), f1(f1), f2(f2), dp(n, ident), subdp(n, ident), ident(ident) {}void add_edge(int s, int t, const U &d) {g[s].emplace_back((Edge) {t, d, ident});g[t].emplace_back((Edge) {s, d, ident});}void add_edge_bi(int s, int t, const U &d, const U &e) {g[s].emplace_back((Edge) {t, d, ident});g[t].emplace_back((Edge) {s, e, ident});}void rec(int v, int par) {for(auto &e: g[v]) {if(e.to == par) continue;rec(e.to, v);subdp[v] = f1(subdp[v], f2(subdp[e.to], e.date));}}void rerec(int v, int par, const T &pval) {int sz = (int)g[v].size();vector<T> left(sz + 1, ident), right(sz + 1, ident);for(int i = 0; i < sz; ++ i) {auto &e = g[v][i];e.dp = f2(par == e.to ? pval : subdp[e.to], e.date);left[i + 1] = f1(left[i], e.dp);}dp[v] = left[sz];for(int i = 0; i < sz; ++ i) {auto &e = g[v][sz - 1 - i];if(e.to != par) {rerec(e.to, v, f1(left[sz - 1 - i], right[i]));}right[i + 1] = f1(right[i], e.dp);}}vector<T> build(int r) {rec(r, -1);rerec(r, -1, ident);return dp;}};void solve() {INT(n, k);vvc<int> g(n);vc<int> deg(n);vc<P> es(n - 1);rep(i, n - 1) {INT(u, v); -- u, -- v;es[i] = {u, v};g[u].eb(v);g[v].eb(u);++ deg[u], ++ deg[v];}VEC(int, d, k);vc<int> check(n, 0);rep(i, k) {-- d[i];check[d[i]] = 1;}vc<P> di(n);queue<tuple<int, int, int>> que;vc<int> used(n, 0);vc<int> noneed(n, 0);queue<int> nque;rep(i, n) {if(deg[i] == 1 and !check[i]) {// leafnque.push(i);}}while(nque.size()) {int v = nque.front(); nque.pop();noneed[v] = 1;for(int nv: g[v]) {-- deg[nv];if(noneed[nv]) continue;if(deg[nv] == 1 and !check[nv]) {nque.push(nv);}}}rep(i, n) {if(!noneed[i]) {que.push({i, i, 0});used[i] = 1;di[i] = {0, i};}}while(que.size()) {auto [v, from, dist] = que.front(); que.pop();debug(v, from, dist);for(int nv: g[v]) {if(used[nv]) continue;que.push({nv, from, dist + 1});di[nv] = {dist + 1, from};used[nv] = 1;}}// queue<int> nque;// rep(i, n) {// if(deg[i] == 1 and !check[i]) {// // leaf// nque.push(i);// }// }// vc<int> noneed(n, 0);// while(nque.size()) {// int v = nque.front(); nque.pop();// noneed[v] = 1;// for(int nv: g[v]) {// -- deg[nv];// if(noneed[nv]) continue;// if(deg[nv] == 1 and !check[nv]) {// nque.push(nv);// }// }// }int r = d[0];function<P(P, P)> f1 = [&](P a, P b) -> P {return P(a.first + b.first,a.first + b.first - max(a.first - a.second, b.first - b.second));};function<P(P, int)> f2 = [&](P a, int c) -> P {return P(a.fr + 2, a.sc + 1);};vc<int> vs;rep(i, n) {if(!noneed[i]) {vs.eb(i);}}Uniq(vs);int N = si(vs);debug(N);vvc<int> G(N);rep(i, n - 1) {if(noneed[es[i].fr] or noneed[es[i].sc]) continue;int u = lb(vs, es[i].fr), v = lb(vs, es[i].sc);// ++ deg2[u], ++ deg2[v];G[u].eb(v);G[v].eb(u);}vc<int> ans(n);auto rec = [&](auto&&self, int v, int p) -> int {int res = 0;for(int nv: G[v]) {if(nv == p) continue;res += self(self, nv, v) + 2;}return res;};int sum = rec(rec, 0, -1);auto dfs = [&](auto&&self, int v, int p, vc<int> &dist, int d) -> void {dist[v] = d;for(int nv: G[v]) {if(nv == p) continue;self(self, nv, v, dist, d + 1);}};vc<int> di0(N);dfs(dfs, 0, -1, di0, 0);int now = -1, x = -1;rep(i, N) {if(chmax(now, di0[i])) {x = i;}}vc<int> dix(N), diy(N);dfs(dfs, x, -1, dix, 0);now = -1;int y = -1;rep(i, N) {if(chmax(now, dix[i])) {y = i;}}dfs(dfs, y, -1, diy, 0);rep(i, n) {if(!noneed[i]) {ans[i] = sum - max(dix[lb(vs, i)], diy[lb(vs, i)]);}}rep(i, n) {if(noneed[i]) {int dist = di[i].fr, from = di[i].sc;debug(dist);ans[i] = ans[from] + dist;}}rep(i, n) {out(ans[i]);}}signed main() {ios::sync_with_stdio(false);cin.tie(0);// cout << fixed << setprecision(20);// INT(t); rep(i, t)solve();solve();return 0;}