#line 1 "test/aoj_1595.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595"
#include <cstdio>
#line 1 "algorithm/dp_on_tree.cpp"
/**
* @brief 木 DP
* @author えびちゃん
*/
#include <cstddef>
#include <utility>
#include <vector>
#line 1 "utility/make/fix_point.cpp"
/**
* @brief ラムダ式の再帰
* @author えびちゃん
*/
#ifndef H_make_fix_point
#define H_make_fix_point
#line 10 "utility/make/fix_point.cpp"
template <typename Fn>
class fix_point: Fn {
public:
explicit constexpr fix_point(Fn&& f) noexcept: Fn(std::forward<Fn>(f)) {}
template <typename... Args>
constexpr decltype(auto) operator ()(Args&&... args) const {
return Fn::operator ()(*this, std::forward<Args>(args)...);
}
};
template <typename Fn>
static inline constexpr decltype(auto) make_fix_point(Fn&& f) noexcept {
return fix_point<Fn>{std::forward<Fn>(f)};
}
#endif /* !defined(H_make_fix_point) */
#line 14 "algorithm/dp_on_tree.cpp"
template <typename Monoid, typename AdjacencyList, typename Fn>
std::vector<Monoid> dp_on_tree(AdjacencyList const& g, Fn f, Monoid e = Monoid{}) {
size_t n = g.size();
std::vector<size_t> par(n, n);
std::vector<std::vector<Monoid>> dpl(n), dpr(n);
std::vector<Monoid> dp(n);
for (size_t i = 0; i < n; ++i) {
dpl[i].resize(g[i].size()+1, e);
dpr[i].resize(g[i].size()+1, e);
}
make_fix_point([&](auto& dfs, size_t v, size_t p) -> Monoid {
Monoid res = e;
typename AdjacencyList::weight_type w{};
for (size_t i = 0; i < g[v].size(); ++i) {
auto const& e = g[v][i];
size_t u = e.target();
if (u == p) {
par[v] = i;
w = e.weight();
continue;
}
Monoid tmp = dfs(u, v);
res += tmp;
dpl[v][i+1] = dpr[v][i] = tmp;
}
return f(res, w);
})(0, n);
make_fix_point([&](auto& dfs, size_t v, size_t p, size_t pi) -> void {
if (p != n) {
Monoid tmp = f(dpl[p][pi] + dpr[p][pi+1], g[p][pi].weight());
dpl[v][par[v]+1] = dpr[v][par[v]] = tmp;
}
for (size_t i = 1; i < dpl[v].size(); ++i)
dpl[v][i] = dpl[v][i-1] + std::move(dpl[v][i]);
for (size_t i = dpr[v].size()-1; i--;)
dpr[v][i] += dpr[v][i+1];
dp[v] = dpr[v][0];
for (size_t i = 0; i < g[v].size(); ++i){
size_t u = g[v][i].target();
if (u != p) dfs(u, v, i);
}
})(0, n, n);
return dp;
}
#line 1 "Graph/adjacency_list.cpp"
/**
* @brief 重みつきグラフの隣接リスト
* @author えびちゃん
*/
#line 10 "Graph/adjacency_list.cpp"
#include <algorithm>
#include <type_traits>
#line 13 "Graph/adjacency_list.cpp"
template <typename WeightType>
class weighted_edge {
public:
using size_type = size_t;
using weight_type = WeightType;
protected:
size_type M_src, M_dst;
weight_type M_weight;
public:
weighted_edge() = default;
weighted_edge(weighted_edge const&) = default;
weighted_edge(weighted_edge&&) = default;
weighted_edge(size_type s, size_type d, weight_type w):
M_src(s), M_dst(d), M_weight(w)
{}
weighted_edge& operator =(weighted_edge const&) = default;
weighted_edge& operator =(weighted_edge&&) = default;
bool operator <(weighted_edge const& other) const {
if (M_weight < other.M_weight) return true;
if (other.M_weight < M_weight) return false;
if (M_src != other.M_src) return M_src < other.M_src;
return M_dst < other.M_dst;
}
size_type source() const { return M_src; }
size_type target() const { return M_dst; }
weight_type weight() const { return M_weight; }
};
struct directed_tag {};
struct undirected_tag {};
template <typename Edge, typename Directedness>
class adjacency_list {
public:
using size_type = size_t;
using edge_type = Edge;
using weight_type = typename Edge::weight_type;
private:
std::vector<std::vector<edge_type>> M_g;
public:
adjacency_list() = default;
adjacency_list(adjacency_list const&) = default;
adjacency_list(adjacency_list&&) = default;
explicit adjacency_list(size_type n): M_g(n) {}
template <typename... Args>
void emplace(size_type src, size_type dst, Args... args) {
M_g[src].emplace_back(src, dst, args...);
if (std::is_same<Directedness, undirected_tag>::value)
M_g[dst].emplace_back(dst, src, args...);
}
void sort_by_index() {
auto cmp = [](auto const& e1, auto const& e2) {
return e1.target() < e2.target();
};
for (auto v: M_g) std::sort(v.begin(), v.end(), cmp);
}
size_type size() const { return M_g.size(); }
auto const& operator [](size_type i) const { return M_g[i]; }
};
#line 1 "utility/monoid/max.cpp"
/**
* @brief max を得る演算のモノイド
* @author えびちゃん
*/
#line 11 "utility/monoid/max.cpp"
#line 1 "utility/limits.cpp"
/**
* @brief 型依存の定数
* @author えびちゃん
*/
#include <limits>
#line 11 "utility/limits.cpp"
template <typename Tp>
class limits: public std::numeric_limits<Tp> {};
template <typename T1, typename T2>
class limits<std::pair<T1, T2>> {
public:
static constexpr auto min() {
return std::make_pair(limits<T1>::min(), limits<T2>::min());
}
static constexpr auto max() {
return std::make_pair(limits<T1>::max(), limits<T2>::max());
}
};
#line 13 "utility/monoid/max.cpp"
template <typename Tp>
class max_monoid {
public:
using value_type = Tp;
private:
value_type M_x = limits<value_type>::min();
public:
max_monoid() = default; // identity
max_monoid(max_monoid const&) = default;
max_monoid(max_monoid&&) = default;
max_monoid(value_type const& x): M_x(x) {};
max_monoid(value_type&& x): M_x(std::move(x)) {};
max_monoid& operator =(max_monoid const&) = default;
max_monoid& operator =(max_monoid&&) = default;
max_monoid& operator +=(max_monoid const& that) {
M_x = std::max(M_x, that.M_x);
return *this;
}
max_monoid& operator +=(max_monoid&& that) {
M_x = std::max(M_x, std::move(that.M_x));
return *this;
}
max_monoid operator +(max_monoid const& that) const {
return max_monoid(*this) += that;
}
max_monoid operator +(max_monoid&& that) const {
return max_monoid(*this) += std::move(that);
}
value_type const& get() const { return M_x; }
};
#line 8 "test/aoj_1595.test.cpp"
int main() {
size_t n;
scanf("%zu", &n);
adjacency_list<weighted_edge<int>, undirected_tag> g(n);
for (size_t i = 1; i < n; ++i) {
size_t a, b;
scanf("%zu %zu", &a, &b);
--a, --b;
g.emplace(a, b, 1);
}
auto dp = dp_on_tree<max_monoid<unsigned>>(g, [](max_monoid<unsigned> x, int) -> max_monoid<unsigned> {
return x.get() + 1;
});
for (size_t i = 0; i < n; ++i) {
int res = 2*(n-1) - dp[i].get();
printf("%d\n", res);
}
}
test/aoj_1595.test.cpp