library
This documentation is automatically generated by online-judge-tools/verification-helper
verify/aoj-1595.test.cpp
- View this file on GitHub
- Last update: 2023-09-23 21:29:16+09:00
- Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595
Depends on
Code
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595"
#include "library/template/template.cpp"
// library
#include "library/graph/tree/ReRooting.cpp"
int main() {
int n;
cin >> n;
//各頂点から最も遠い点への距離を求める
auto f = [&](ll x, int u) { return x + 1; };
auto merge = [&](ll x, ll y) { return max(x, y); };
ReRooting<ll> rr(n, f, merge, 0);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
rr.add_edge(u, v);
}
rr.build();
rep(i, n) { print((n - 1) * 2 - rr.query(i)); }
}#line 1 "verify/aoj-1595.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595"
#line 2 "library/template/template.cpp"
/* #region header */
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
// types
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair<ll, ll> Pl;
typedef pair<int, int> Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vc;
template <typename T>
using mat = vector<vector<T>>;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<vector<char>> vvc;
// abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) for (ll i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) \
for (ll i = (b - 1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define srep(i, a, b, c) for (ll i = (a), max_i = (b); i < max_i; i += c)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
//入出力
#define print(x) cout << x << endl
template <class T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
for (auto &e : v)
cout << e << " ";
cout << endl;
return os;
}
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T>
void scan(vector<T> &a)
{
for (auto &i : a)
scan(i);
}
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
// functions
// gcd(0, x) fails.
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class T>
bool chmax(T &a, const T &b)
{
if (a < b)
{
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
if (b < a)
{
a = b;
return 1;
}
return 0;
}
template <typename T>
T mypow(T x, ll n)
{
T ret = 1;
while (n > 0)
{
if (n & 1)
(ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
ll modpow(ll x, ll n, const ll mod)
{
ll ret = 1;
while (n > 0)
{
if (n & 1)
(ret *= x);
(x *= x);
n >>= 1;
x %= mod;
ret %= mod;
}
return ret;
}
ll safemod(ll x, ll mod) { return (x % mod + mod) % mod; }
int popcnt(ull x) { return __builtin_popcountll(x); }
template <typename T>
vector<int> IOTA(vector<T> a)
{
int n = a.size();
vector<int> id(n);
iota(all(id), 0);
sort(all(id), [&](int i, int j)
{ return a[i] < a[j]; });
return id;
}
long long xor64(long long range) {
static uint64_t x = 88172645463325252ULL;
x ^= x << 13;
x ^= x >> 7;
return (x ^= x << 17) % range;
}
struct Timer
{
clock_t start_time;
void start() { start_time = clock(); }
int lap()
{
// return x ms.
return (clock() - start_time) * 1000 / CLOCKS_PER_SEC;
}
};
template <typename T = int>
struct Edge
{
int from, to;
T cost;
int idx;
Edge() = default;
Edge(int from, int to, T cost = 1, int idx = -1)
: from(from), to(to), cost(cost), idx(idx) {}
operator int() const { return to; }
};
template <typename T = int>
struct Graph
{
vector<vector<Edge<T>>> g;
int es;
Graph() = default;
explicit Graph(int n) : g(n), es(0) {}
size_t size() const { return g.size(); }
void add_directed_edge(int from, int to, T cost = 1)
{
g[from].emplace_back(from, to, cost, es++);
}
void add_edge(int from, int to, T cost = 1)
{
g[from].emplace_back(from, to, cost, es);
g[to].emplace_back(to, from, cost, es++);
}
void read(int M, int padding = -1, bool weighted = false,
bool directed = false)
{
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
a += padding;
b += padding;
T c = T(1);
if (weighted)
cin >> c;
if (directed)
add_directed_edge(a, b, c);
else
add_edge(a, b, c);
}
}
};
/* #endregion*/
// constant
#define inf 1000000000ll
#define INF 4000000004000000000LL
#define endl '\n'
const long double eps = 0.000000000000001;
const long double PI = 3.141592653589793;
#line 4 "verify/aoj-1595.test.cpp"
// library
#line 1 "library/graph/tree/ReRooting.cpp"
template <typename T>
struct ReRooting {
using F = function<T(T, int)>; // apply to a child dp value:function dp,
// child index to value
using F2 = function<T(T, T)>; // apply to get parent dp values
int V;
vector<vector<int>> E; // graph
vector<vector<T>> dp;
// dp_v = g(merge(f(dp_c1,c1), f(dp_c2,c2), ..., f(dp_ck,ck)) , v)
F f, g;
F2 merge; // merge children values
T mi; // identity of merge
ReRooting(
int V_, F f_, F2 merge_, T mi_, F g_ = [](T a, int b) { return a; })
: V(V_), f(f_), merge(merge_), mi(mi_), g(g_) {
E.resize(V);
dp.resize(V);
}
void add_edge(int a, int b) {
E[a].push_back(b);
E[b].push_back(a);
}
T dfs1(int p, int v) {
T res = mi;
for (int i = 0; i < E[v].size(); ++i) {
if (E[v][i] == p) continue;
dp[v][i] = dfs1(v, E[v][i]);
res = merge(res, f(dp[v][i], E[v][i]));
}
return g(res, v);
}
void dfs2(int p, int v, T add) {
for (int i = 0; i < E[v].size(); ++i) {
if (E[v][i] == p) {
dp[v][i] = add;
break;
}
}
vector<T> pL(E[v].size() + 1), pR(E[v].size() + 1);
pL[0] = mi;
for (int i = 0; i < E[v].size(); ++i)
pL[i + 1] = merge(pL[i], f(dp[v][i], E[v][i]));
pR[E[v].size()] = mi;
for (int i = E[v].size(); i > 0; --i)
pR[i - 1] = merge(pR[i], f(dp[v][i - 1], E[v][i - 1]));
for (int i = 0; i < E[v].size(); ++i) {
if (E[v][i] == p) continue;
T val = merge(pL[i], pR[i + 1]);
dfs2(v, E[v][i], g(val, v));
}
}
// build rerooting
void build(int root = 0) {
for (int i = 0; i < V; ++i) dp[i].resize(E[i].size());
dfs1(-1, root);
dfs2(-1, root, mi);
}
// answer for root v
T query(int v) {
T ans = mi;
for (int i = 0; i < E[v].size(); ++i) {
ans = merge(ans, f(dp[v][i], E[v][i]));
}
return g(ans, v);
}
};
#line 6 "verify/aoj-1595.test.cpp"
int main() {
int n;
cin >> n;
//各頂点から最も遠い点への距離を求める
auto f = [&](ll x, int u) { return x + 1; };
auto merge = [&](ll x, ll y) { return max(x, y); };
ReRooting<ll> rr(n, f, merge, 0);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
rr.add_edge(u, v);
}
rr.build();
rep(i, n) { print((n - 1) * 2 - rr.query(i)); }
}