結果
| 問題 | No.1718 Random Squirrel |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2021-10-22 23:55:32 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 155 ms / 2,000 ms |
| コード長 | 7,515 bytes |
| コンパイル時間 | 3,256 ms |
| コンパイル使用メモリ | 221,240 KB |
| 最終ジャッジ日時 | 2025-01-25 04:37:30 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 31 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < n; i++)#define rep2(i, x, n) for (int i = x; i <= n; i++)#define rep3(i, x, n) for (int i = x; i >= n; i--)#define each(e, v) for (auto &e : v)#define pb push_back#define eb emplace_back#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;const int inf = (1 << 30) - 1;const ll INF = (1LL << 60) - 1;const int MOD = 1000000007;// const int MOD = 998244353;template <bool directed = false>struct Graph {struct edge {int to, id;edge(int to, int id) : to(to), id(id) {}};vector<vector<edge>> es;const int n;int m;vector<vector<int>> par; // par[i][j] := 頂点jの2^i個前の祖先vector<int> depth;int height;vector<int> ids, col;int cnt = 0;Graph(int n) : es(n), n(n), m(0), depth(n), ids(n), col(n, inf) {height = 1;while ((1 << height) < n) height++;par.assign(height, vector<int>(n));}void add_edge(int from, int to) {es[from].emplace_back(to, m);if (!directed) es[to].emplace_back(from, m);m++;}void prepare(int now, int pre = -1) {if (pre == -1) depth[now] = 0;par[0][now] = pre;ids[now] = cnt++;for (auto &e : es[now]) {if (e.to != pre) {depth[e.to] = depth[now] + 1;prepare(e.to, now);}}}void build(int root = 0) { // rootを根として前準備するprepare(root);for (int j = 0; j < height - 1; j++) {for (int i = 0; i < n; i++) {if (par[j][i] == -1) {par[j + 1][i] = -1;} else {par[j + 1][i] = par[j][par[j][i]];}}}}int lca(int u, int v) {if (depth[u] < depth[v]) swap(u, v);int D = depth[u] - depth[v];for (int i = 0; i < height; i++) {if ((D >> i) & 1) u = par[i][u];}if (u == v) return u;for (int i = height - 1; i >= 0; i--) {if (par[i][u] != par[i][v]) u = par[i][u], v = par[i][v];}return par[0][u];}int dist(int u, int v) { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }void path(int u, int v) {while (u != v) {if (depth[u] < depth[v]) swap(u, v);col[u] = 0;u = par[0][u];}col[u] = 0;}vector<int> solve(vector<int> c) {build();sort(all(c), [&](int i, int j) { return ids[i] < ids[j]; });int K = sz(c);col[c[0]] = 0;rep(i, K - 1) path(c[i], c[i + 1]);int T = 0;queue<int> que;rep(i, n) {if (col[i] == 0) T++, que.emplace(i);}vector<int> ret(n, 2 * (T - 1));while (!empty(que)) {int i = que.front();que.pop();each(e, es[i]) {if (chmin(col[e.to], col[i] + 1)) que.emplace(e.to);}}rep(i, n) ret[i] += 2 * col[i];return ret;}};template <typename sum_t, typename key_t, bool directed = false>struct Rerooting {struct edge {int to;key_t data;sum_t dp, ndp; // to側の部分木dp(辺も含む)、from側の部分木dp(辺は含まない)edge(int to, key_t data, sum_t dp, sum_t ndp) : to(to), data(data), dp(dp), ndp(ndp) {}};using F = function<sum_t(sum_t, sum_t)>;using G = function<sum_t(sum_t, key_t)>;vector<vector<edge>> es;vector<sum_t> subdp, dp; // 部分木のdp、全方位のdpconst F f; // 1頂点を間に挟んで隣り合う2つの部分木の情報をマージconst G g; // 部分木の根に1本辺を足すconst sum_t e1; // fの単位元vector<sum_t> base; // 1頂点の場合のdpの値Rerooting(int n, const F &f, const G &g, const sum_t &e1, const vector<sum_t> &base) : es(n), subdp(base), dp(n), f(f), g(g), e1(e1), base(base){}void add_edge(int from, int to, const key_t &data) {es[from].emplace_back(to, data, e1, base[from]);if (!directed) es[to].emplace_back(from, data, e1, base[to]);}void dfs_sub(int now, int pre = -1) {for (auto &e : es[now]) {if (e.to == pre) continue;dfs_sub(e.to, now);subdp[now] = f(subdp[now], g(subdp[e.to], e.data));}}void dfs_all(int now, const sum_t &top, int pre = -1) {sum_t S = e1;for (int i = 0; i < (int)es[now].size(); i++) {auto &e = es[now][i];e.ndp = f(e.ndp, S);e.dp = g(e.to == pre ? top : subdp[e.to], e.data);S = f(S, e.dp);}dp[now] = f(base[now], S);S = e1;for (int i = (int)es[now].size() - 1; i >= 0; i--) {auto &e = es[now][i];e.ndp = f(e.ndp, S);if (e.to != pre) dfs_all(e.to, e.ndp, now);S = f(S, e.dp);}}vector<sum_t> solve() {dfs_sub(0);dfs_all(0, e1);return dp;}};int main() {int N, K;cin >> N >> K;vector<int> u(N - 1), v(N - 1);rep(i, N - 1) {cin >> u[i] >> v[i];u[i]--, v[i]--;}vector<int> c(K);rep(i, K) {cin >> c[i];c[i]--;}vector<int> base(N, -inf);rep(i, K) base[c[i]] = 0;auto f = [](int a, int b) { return max(a, b); };auto g = [](int a, int b) { return a + b; };Graph G1(N);Rerooting<int, int> G2(N, f, g, -inf, base);rep(i, N - 1) { G2.add_edge(u[i], v[i], 1); }vector<int> d = G2.solve();// print(d);rep(i, N - 1) G1.add_edge(u[i], v[i]);vector<int> a = G1.solve(c);rep(i, N) a[i] -= d[i];printn(a);}