結果
| 問題 | No.277 根掘り葉掘り |
| コンテスト | |
| ユーザー |
 zeta
|
| 提出日時 | 2026-03-26 17:10:57 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 52 ms / 3,000 ms |
| コード長 | 21,098 bytes |
| 記録 | |
| コンパイル時間 | 2,744 ms |
| コンパイル使用メモリ | 292,776 KB |
| 実行使用メモリ | 23,384 KB |
| 最終ジャッジ日時 | 2026-03-26 17:11:03 |
| 合計ジャッジ時間 | 5,224 ms |
|
ジャッジサーバーID （参考情報） |
judge2_1 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 18 |
ソースコード
#define YRSD
#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>
#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define bg begin
#define ed end
#define all(x) bg(x), ed(x)
#define ov(a, b, c, d, e, ...) e
#define FO1(a) for (int _ = 0; _ < (a); ++_)
#define FO2(i, a) for (int i = 0; i < (a); ++i)
#define FO3(i, a, b) for (int i = (a); i < (b); ++i)
#define FO4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) ov(__VA_ARGS__, FO4, FO3, FO2, FO1)(__VA_ARGS__)
#define FF1(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FF2(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FF3(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FF4(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) ov(__VA_ARGS__, FF4, FF3, FF2, FF1)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))
#define sort ranges::sort
using namespace std;
TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long; using ull = unsigned long long;
using ld = long double; using i128 = __int128; using u128 = __uint128_t; using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>; using PLL = pair<ll, ll>;
#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
istream &operator>>(istream &I, i128 &x) {
static string s;
I >> s;
int f = s[0] == '-';
x = 0;
const int N = (int)s.size();
FOR(i, f, N) x = x * 10 + s[i] - '0';
if (f) x = -x;
return I;
}
ostream &operator<<(ostream &O, i128 x) {
static string s;
s.clear();
bool f = x < 0;
if (f) x = -x;
while (x) s += '0' + x % 10, x /= 10;
if (s.empty()) s += '0';
if (f) s += '-';
reverse(all(s));
return O << s;
}
istream &operator>>(istream &I, f128 &x) {
static string s;
I >> s, x = stold(s);
return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
for (Z &e : c) I >> e;
return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, const char*>) and
(not is_same_v<decay_t<T>, string>) and
(not is_array_v<remove_reference_t<T>> or
not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
if (a.empty()) return O;
Z i = a.begin();
O << *i++;
for (; i != a.end(); ++i) O << ' ' << *i;
return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
cout << x;
if constexpr (sizeof...(S)) cout << ' ';
print(forward<S>(y)...);
}
void put() {}
TES void put(T &&x, S &&...y) {
cout << x;
put(forward<S>(y)...);
}
#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128 __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)
void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi_v<ld>;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};
TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll si(const Z &a) { return a.size(); }
void reverse(Z &a) { reverse(all(a)); }
void unique(Z &a) {
sort(a);
a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
int N = si(a);
vc<int> b(N, -1);
FOR(i, N) if (a[i] != -1) b[a[i]] = i;
return b;
}
Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
TE Z QMAX(T l, T r) { return *max_element(l, r); }
TE Z QMIN(T l, T r) { return *min_element(l, r); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }
vc<int> argsort(const Z &a) {
vc<int> I(si(a));
iota(all(I), 0);
sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
int N = si(I);
vc<T> b(N);
FOR(i, N) b[i] = a[I[i]];
return b;
}
template <int of = 1, typename T>
vc<T> pre_sum(const vc<T> &a) {
int N = si(a);
vc<T> c(N + 1);
FOR(i, N) c[i + 1] = c[i] + a[i];
if (of == 0) c.erase(c.begin());
return c;
}
TE constexpr static int topbit(T x) {
if (x == 0) return - 1;
if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
if (x == 0) return -1;
if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
else return __builtin_ctzll(x);
}
TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * y; }
TE constexpr pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return pair{q, x - q * y};
}
TE T SUM(const Z &v) { return accumulate(all(v), T()); }
TE T SUM(Z l, Z r) { return accumulate(l, r, T()); }
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
TE int lb(T l, T r, Z x) { return lower_bound(l, r, x) - l; }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
TE int ub(T l, T r, Z x) { return upper_bound(l, r, x) - l; }
template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
if (ck) assert(f(l));
while (abs(l - r) > 1) {
ll x = (r + l) >> 1;
(f(x) ? l : r) = x;
}
return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
while (c--) {
T x = (l + r) / 2;
(f(x) ? l : r) = x;
}
return (l + r) / 2;
}
TE T pop(vc<T> &a) {
T x = a.back();
a.pop_back();
return x;
}
TE T pop(max_heap<T> &q) {
T x = q.top();
q.pop();
return x;
}
TE T pop(min_heap<T> &q) {
T x = q.top();
q.pop();
return x;
}
char pop(string &s) {
char x = s.back();
s.pop_back();
return x;
}
void setp(int x) { cout << fixed << setprecision(x); }
TE inline void sh(vc<T> &a, int N, T b = {}) {
a.resize(N, b);
}
#ifdef YRSD
void DBG() { cerr << "]" << endl; }
TES void DBG(T &&x, S &&...y) {
cerr << x;
if constexpr (sizeof...(S)) cerr << ", ";
DBG(forward<S>(y)...);
}
#define debug(...) cerr << "[" << __LINE__ << "]: [" #__VA_ARGS__ "] = [", DBG(__VA_ARGS__)
void ERR() { cerr << endl; }
TES void ERR(T &&x, S &&...y) {
cerr << x;
if constexpr (sizeof...(S)) cerr << ", ";
ERR(forward<S>(y)...);
}
#define err(...) cerr << "[" << __LINE__ << "]: ", ERR(__VA_ARGS__)
#else
#define debug(...) void(0721)
#define err(...) void(0721)
#endif
#include <random>
#ifdef MeIoN
mt19937 rg(0);
mt19937_64 rd_64(0);
#else
mt19937 rg(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rd_64(chrono::steady_clock::now().time_since_epoch().count());
#endif
uint rng() { return rg(); }
uint rng(uint lim) { return rg() % lim; }
int rng(int l, int r) { return l + rg() % (r - l); }
ull rng_64() { return rd_64(); }
ull rng_64(ull lim) { return rd_64() % lim; }
ll rng_64(ll l, ll r) { return l + rd_64() % (r - l); }
TE void shuffle(vc<T> &a) {
int N = si(a);
FOR(i, 1, N) {
int k = rng(0, i + 1);
if (i != k) swap(a[i], a[k]);
}
}
TE ull hsh(const pair<T, T> &X) {
static ull B = rng_64();
if (not B) B = rng_64();
return B * X.fi + X.se;
}
TE struct hashmap {
uint ls, msk;
vc<ull> ke;
vc<T> val;
vc<u8> vis;
ull hash(ull x) const {
static const ull bs =
chrono::steady_clock::now().time_since_epoch().count();
x += bs;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return (x ^ (x >> 31)) & msk;
}
void extend() {
vc<pair<ull, T>> dat;
const int N = si(vis);
dat.reserve(N / 2 - ls);
FOR(i, N) if (vis[i]) dat.ep(ke[i], val[i]);
build(dat.size() << 1);
for (Z &[a, b] : dat) (*this)[a] = b;
}
hashmap(uint N = 0) { build(N); }
void build(uint N) {
uint k = 8;
while (k < (N << 1)) k <<= 1;
ls = k >> 1, msk = k - 1;
ke.resize(k);
val.resize(k);
vis.assign(k, 0);
}
void clear() {
fill(all(vis), 0);
ls = (msk + 1) >> 1;
}
ll size() const { return vis.size() / 2 - ls; }
int id(ull k) const {
int i = hash(k);
while (vis[i] and ke[i] != k) i = (i + 1) & msk;
return i;
}
T &operator[](ull k) {
if (ls == 0) extend();
int i = id(k);
if (not vis[i]) {
vis[i] = 1;
ke[i] = k;
val[i] = T {};
--ls;
}
return val[i];
}
T &operator[](PII p) {
ll k = hsh(p);
if (ls == 0) extend();
int i = id(k);
if (not vis[i]) {
vis[i] = 1;
ke[i] = k;
val[i] = T {};
--ls;
}
return val[i];
}
T get(ull k, T fail) const {
int i = id(k);
return (vis[i] ? val[i] : fail);
}
bool contains(ull k) const {
int i = id(k);
return vis[i] and ke[i] == k;
}
vc<pair<ull, T>> get_all() const {
int N = si(vis);
vc<pair<ull, T>> s;
FOR(i, N) if (vis[i]) s.ep(ke[i], val[i]);
return s;
}
void enumerate_all(Z f) const {
const int N = si(vis);
FOR(i, N) if (vis[i]) f(ke[i], val[i]);
}
};
TE struct edge {
int f, to;
T w;
int id;
};
template <typename T = int, bool dir = 0>
struct graph {
static constexpr bool is_dir = dir;
int N, M;
using cost_type = T;
using ee = edge<T>;
vc<ee> es;
vc<int> in;
vc<ee> c;
bool ok;
bool isok() { return ok; }
struct px {
const graph *g;
int l, r;
px(const graph *g, int l, int r) : g(g), l(l), r(r) {}
const ee *begin() const {
if (l == r) return 0;
return &g->c[l];
}
const ee *end() const {
if (l == r) return 0;
return &g->c[r];
}
};
px operator[](int i) const {
assert(ok);
return {this, in[i], in[i + 1]};
}
graph() : N(0), M(0), ok(0) {}
graph(int N) : N(N), M(0), ok(0) {}
void add(int f, int t, T w = 1, int i = -1) {
assert(not ok);
assert(-1 < f and -1 < t and t < N and f < N);
if (i == -1) i = M;
es.ep(ee{f, t, w, i});
++M;
}
void build() {
assert(not ok);
ok = 1;
in.assign(N + 1, 0);
for (Z &&e : es) {
in[e.f + 1]++;
if (not dir) in[e.to + 1]++;
}
FOR(i, N) in[i + 1] += in[i];
Z cc = in;
c.resize(in.back() + 1);
for (Z &&e : es) {
c[cc[e.f]++] = e;
if (not dir) c[cc[e.to]++] = {e.to, e.f, e.w, e.id};
}
}
template <bool wt = 0, int of = 1>
void sc() { sc<wt, of>(N - 1); }
template <bool wt = 0, int of = 1>
void sc(int M) {
es.reserve(M * (dir ? 1 : 2));
FOR(M) {
INT(x, y);
x -= of, y -= of;
if (not wt) {
add(x, y);
} else {
T w;
IN(w);
add(x, y, w);
}
}
build();
}
vc<int> deg() {
vc<int> in(N);
for (Z &&e : es) ++in[e.f], ++in[e.to];
return in;
}
pair<vc<int>, vc<int>> deg_inout() {
vc<int> in(N), ou(N);
for (Z &&e : es) ++in[e.to], ++ou[e.f];
return {in, ou};
}
vc<int> ni;
vc<u8> vis;
graph<T, dir> rearrange(const vc<int> &v, bool keep_eid = 0) {
if (si(ni) != N) ni.assign(N, -1);
int N = si(v);
FOR(i, N) ni[v[i]] = i;
graph<T, dir> g(N);
vc<int> s;
FOR(i, N) {
for (Z &&e : (*this)[v[i]]) {
if (si(vis) <= e.id) vis.resize(e.id + 1);
if (vis[e.id]) continue;
int f = e.f, to = e.to;
if (ni[f] != -1 and ni[to] != -1) {
s.ep(e.id);
vis[e.id] = 1;
int id = (keep_eid ? e.id : -1);
g.add(ni[f], ni[to], e.w, id);
}
}
}
FOR(i, N) ni[v[i]] = -1;
for (int i : s) vis[i] = 0;
return g.build(), g;
}
ull has(ull x, ull y) {
if (not dir and x > y) swap(x, y);
return x * N + y;
}
hashmap<int> mp;
int get_eid(ull x, ull y) {
if (mp.size() == 0) {
mp.build(N - 1);
for (Z &&e : es) {
ull x = e.f, y = e.to;
ull k = has(x, y);
mp[k] = e.id;
}
}
return mp.get(has(x, y), -1);
}
graph rev() const requires(dir) {
graph ng(N);
for (Z &&[f, t, w, id] : es) ng.add(t, f, w, id);
return ng;
}
};
TE struct hld {
using G = graph<T, 0>;
G &g;
int N, t = 0;
vc<int> L, R, hd, V, fa, to, d;
hld(G &g, int r = 0)
: g(g), N(g.N), L(N, -1), R(L), hd(N, r), V(L), fa(L), to(L), d(N) {
if (r == -1) return;
assert(g.isok());
dfs(r, -1);
hl(r, r);
}
void dfs(int n, int f) {
fa[n] = f;
R[n] = 1;
int l = g.in[n], r = g.in[n + 1], m = 0;
Z &c = g.c;
if (r - l > 1 and c[l].to == f) swap(c[l], c[l + 1]);
FOR(i, l, r) if (c[i].to != f) {
Z e = c[i];
to[e.to] = e.id;
d[e.to] = d[n] + 1;
dfs(e.to, n);
R[n] += R[e.to];
if (chmax(m, R[e.to]) and l < i) swap(c[l], c[i]);
}
}
void hl(int n, int p) {
R[n] += L[n] = t;
V[t++] = n;
bool f = 1;
for (Z &&e : g[n]) if (e.to != p) {
hd[e.to] = f ? hd[n] : e.to;
f = 0;
hl(e.to, n);
}
}
vc<int> hp(int n) {
vc<int> s{n};
while (1) {
int x = hc(s.back());
if (x == -1 or hd[x] != n) return s;
s.ep(x);
}
}
inline int hc(int x) {
int i = L[x] + 1;
if (i == N) return -1;
int a = V[i];
return fa[a] == x ? a : -1;
}
int ev(int i) {
Z &e = g.es[i];
return (fa[e.f] == e.to ? e.f : e.to);
}
int ve(int x) { return to[x]; }
int gei(int x, int y) {
if (fa[x] != y) swap(x, y);
assert(fa[x] == y);
return to[x];
}
int el(int i) { return 2 * L[i] - d[i]; }
int er(int i) { return 2 * R[i] - d[i] - 1; }
int la(int n, int k) {
assert(k <= d[n]);
while (1) {
int x = hd[n];
if (L[n] - k >= L[x]) return V[L[n] - k];
k -= L[n] - L[x] + 1;
n = fa[x];
}
}
int lca(int x, int y) {
for (;; y = fa[hd[y]]) {
if (L[x] > L[y]) swap(x, y);
if (hd[x] == hd[y]) return x;
}
}
int dist(int a, int b) { return d[a] + d[b] - 2 * d[lca(a, b)]; }
int meet(int a, int b, int c) { return lca(a, b) ^ lca(a, c) ^ lca(b, c); }
bool ins(int x, int y) { return L[y] <= L[x] and L[x] < R[y]; }
int jump(int x, int y, int k) {
if (k == 1) {
if (x == y) return -1;
return ins(y, x) ? la(y, d[y] - d[x] - 1) : fa[x];
}
int c = lca(x, y);
int a = d[x] - d[c];
int b = d[y] - d[c];
if (k > a + b) return -1;
if (k <= a) return la(x, k);
return la(y, a + b - k);
}
int size(int x, int r = -1) {
if (r == -1) return R[x] - L[x];
if (x == r) return N;
int y = jump(x, r, 1);
if (ins(x, y)) return R[x] - L[x];
return N - R[y] + L[y];
}
vc<int> size_arr(int r = -1) {
vc<int> sz(N);
FOR(i, N) sz[i] = size(i, r);
return sz;
}
vc<int> cc(int n) {
static vc<int> s;
s.clear();
for (Z &&e : g[n]) if (e.to != fa[n]) s.ep(e.to);
return s;
}
vc<int> cl(int n) {
vc<int> s;
bool f = 1;
for (Z &&e : g[n]) {
if (e.to != fa[n]) {
if (not f) s.ep(e.to);
f = 0;
}
}
return s;
}
vc<PII> dec(int x, int y, bool e) {
vc<PII> a, b;
while (1) {
if (hd[x] == hd[y]) break;
if (L[x] < L[y]) {
b.ep(L[hd[y]], L[y]);
y = fa[hd[y]];
} else {
a.ep(L[x], L[hd[x]]);
x = fa[hd[x]];
}
}
if (L[x] < L[y]) b.ep(L[x] + e, L[y]);
else if (L[y] + e <= L[x]) a.ep(L[x], L[y] + e);
reverse(b);
a.insert(a.end(), all(b));
return a;
}
vc<int> rest_path(int x, int y) {
vc<int> s;
for (Z [a, b] : dec(x, y, 0)) {
if (a <= b) FOR(i, a, b + 1) s.ep(V[i]);
else FOR_R(i, b, a + 1) s.ep(V[i]);
}
return s;
}
PII cross(int a, int b, int c, int d) {
int ab = lca(a, b), ac = lca(a, c), ad = lca(a, d);
int bc = lca(b, c), bd = lca(b, d), cd = lca(c, d);
int x = ab ^ ac ^ bc, y = ab ^ ad ^ bd;
if (x != y) return {x, y};
int z = ac ^ ad ^ cd;
if (x != z) x = -1;
return {x, x};
}
int max_path(Z f, int x, int y) {
if (not f(x)) return -1;
for (Z [a, b] : dec(x, y, 0)) {
if (not f(V[a])) return x;
if (f(V[b])) {
x = V[b];
continue;
}
int c = bina<0>([&](int c) -> bool { return f(V[c]); }, a, b);
return V[c];
}
return x;
}
};
template <typename T, typename X>
struct rerooting_tree_dp {
hld<T> &t;
vc<X> dp1, dp2, dp;
rerooting_tree_dp(hld<T> &t, Z fee, Z fev, Z fve, const X unit) : t(t) {
build(fee, fev, fve, unit);
}
void build(Z fee, Z fev, Z fve, const X unit) {
int N = t.N;
dp1.assign(N, unit);
FOR_R(i, N) {
int n = t.V[i];
for (Z &&e : t.g[n]) {
if (e.to == t.fa[n]) continue;
dp1[n] = fee(dp1[n], fve(dp1[e.to], e));
}
dp1[n] = fev(dp1[n], n);
}
dp2.assign(N, unit);
dp.assign(N, unit);
FOR(i, N) {
int n = t.V[i];
vc<int> ch;
vc<X> ch_dat;
X x = unit;
for (Z &&e : t.g[n]) {
if (e.to == t.fa[n]) {
x = fve(dp2[n], e);
} else {
ch.ep(e.to);
ch_dat.ep(fve(dp1[e.to], e));
}
}
int sz = si(ch);
if (not sz) {
dp[n] = fev(x, n);
continue;
}
vc<X> L(sz, x);
FOR(i, sz - 1) L[i + 1] = fee(L[i], ch_dat[i]);
X R = unit;
FOR_R(i, sz) {
dp2[ch[i]] = fev(fee(L[i], R), n);
R = fee(R, ch_dat[i]);
}
dp[n] = fev(fee(x, R), n);
}
}
X operator[](int x) { return dp[x]; }
X get(int x, int rt) {
if (rt == x) return dp[x];
if (not t.ins(rt, x)) return dp1[x];
x = t.jump(x, rt, 1);
return dp2[x];
}
};
void Yorisou() {
INT(N);
graph g(N);
g.sc();
hld v(g);
vc<u8> vis(N);
FOR(i, N) if (si(v.cc(i)) == 0) vis[i] = 1;
Z fee = [&](int x, int y) {
return min(x, y);
};
Z fev = [&](int x, int i) {
return vis[i] ? 0 : x;
};
Z fve = [&](int x, Z e) {
return x + 1;
};
rerooting_tree_dp<int, int> dp(v, fee, fev, fve, inf<int> / 2);
FOR(i, N) print(min(v.d[i], dp[i]));
}
constexpr int tests = 0, fl = 0, DB = 10;
int main() {
cin.tie(0)->sync_with_stdio(0);
int T = 1;
if (fl) cerr.tie(0);
if (tests and not fl) IN(T);
for (int i = 0; i < T or fl; ++i) {
Yorisou();
if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
}
return 0;
}