test/verify/aoj-1595.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 15:36:17+00:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595

Depends on

• graph/tree/rerooting.hpp

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595
// clang-format on

#include <algorithm>
#include <iostream>

#include "../../graph/tree/rerooting.hpp"

using namespace std;

int main() {
  int N;
  cin >> N;

  auto f1 = [](int a, int b) { return max(a, b); };

  auto f2 = [](int a, int data) { return a + data; };

  ReRooting<int, int> g(N, f1, f2, 0);
  for (int i = 1; i < N; i++) {
    int s, t;
    cin >> s >> t;
    --s, --t;
    g.add_edge(s, t, 1);
  }
  for (auto& p : g.build()) {
    cout << (N - 1) * 2 - p << endl;
  }
}

#line 1 "test/verify/aoj-1595.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595
// clang-format on

#include <algorithm>
#include <iostream>

#line 2 "graph/tree/rerooting.hpp"

#include <functional>
#include <vector>

template <typename sum_t, typename key_t>
struct ReRooting {
  struct Edge {
    int to;
    key_t data;
    sum_t dp, ndp;
  };

  using F = std::function<sum_t(sum_t, sum_t)>;
  using G = std::function<sum_t(sum_t, key_t)>;

  std::vector<std::vector<Edge> > g;
  const F f;
  const G gg;
  const sum_t ident;
  std::vector<sum_t> subdp, dp;

  ReRooting(int V, const F f, const G g, const sum_t& ident)
      : g(V), f(f), gg(g), ident(ident), subdp(V, ident), dp(V, ident) {}

  void add_edge(int u, int v, const key_t& d) {
    g[u].emplace_back((Edge){v, d, ident, ident});
    g[v].emplace_back((Edge){u, d, ident, ident});
  }

  void add_edge_bi(int u, int v, const key_t& d, const key_t& e) {
    g[u].emplace_back((Edge){v, d, ident, ident});
    g[v].emplace_back((Edge){u, e, ident, ident});
  }

  void dfs_sub(int idx, int par) {
    for (auto& e : g[idx]) {
      if (e.to == par) continue;
      dfs_sub(e.to, idx);
      subdp[idx] = f(subdp[idx], gg(subdp[e.to], e.data));
    }
  }

  void dfs_all(int idx, int par, const sum_t& top) {
    sum_t buff{ident};
    for (int i = 0; i < (int)g[idx].size(); i++) {
      auto& e = g[idx][i];
      e.ndp = buff;
      e.dp = gg(par == e.to ? top : subdp[e.to], e.data);
      buff = f(buff, e.dp);
    }
    dp[idx] = buff;
    buff = ident;
    for (int i = (int)g[idx].size() - 1; i >= 0; i--) {
      auto& e = g[idx][i];
      if (e.to != par) dfs_all(e.to, idx, f(e.ndp, buff));
      e.ndp = f(e.ndp, buff);
      buff = f(buff, e.dp);
    }
  }

  std::vector<sum_t> build() {
    dfs_sub(0, -1);
    dfs_all(0, -1, ident);
    return dp;
  }
};
#line 9 "test/verify/aoj-1595.test.cpp"

using namespace std;

int main() {
  int N;
  cin >> N;

  auto f1 = [](int a, int b) { return max(a, b); };

  auto f2 = [](int a, int data) { return a + data; };

  ReRooting<int, int> g(N, f1, f2, 0);
  for (int i = 1; i < N; i++) {
    int s, t;
    cin >> s >> t;
    --s, --t;
    g.add_edge(s, t, 1);
  }
  for (auto& p : g.build()) {
    cout << (N - 1) * 2 - p << endl;
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	testcase_00	AC	3 ms	3 MB
g++	testcase_01	AC	2 ms	4 MB
g++	testcase_02	AC	165 ms	13 MB
g++	testcase_03	AC	175 ms	13 MB
g++	testcase_04	AC	169 ms	13 MB
g++	testcase_05	AC	163 ms	13 MB
g++	testcase_06	AC	166 ms	13 MB
g++	testcase_07	AC	167 ms	13 MB
g++	testcase_08	AC	170 ms	13 MB
g++	testcase_09	AC	174 ms	13 MB
g++	testcase_10	AC	175 ms	13 MB
g++	testcase_11	AC	167 ms	13 MB
g++	testcase_12	AC	166 ms	13 MB
g++	testcase_13	AC	174 ms	13 MB
g++	testcase_14	AC	171 ms	13 MB
g++	testcase_15	AC	167 ms	13 MB
g++	testcase_16	AC	164 ms	13 MB
g++	testcase_17	AC	170 ms	13 MB
g++	testcase_18	AC	170 ms	13 MB
g++	testcase_19	AC	164 ms	13 MB
g++	testcase_20	AC	168 ms	13 MB
g++	testcase_21	AC	175 ms	13 MB
g++	testcase_22	AC	158 ms	26 MB
g++	testcase_23	AC	137 ms	11 MB
clang++	testcase_00	AC	3 ms	4 MB
clang++	testcase_01	AC	2 ms	4 MB
clang++	testcase_02	AC	171 ms	13 MB
clang++	testcase_03	AC	184 ms	13 MB
clang++	testcase_04	AC	176 ms	13 MB
clang++	testcase_05	AC	169 ms	13 MB
clang++	testcase_06	AC	168 ms	13 MB
clang++	testcase_07	AC	173 ms	13 MB
clang++	testcase_08	AC	164 ms	13 MB
clang++	testcase_09	AC	164 ms	13 MB
clang++	testcase_10	AC	166 ms	13 MB
clang++	testcase_11	AC	169 ms	13 MB
clang++	testcase_12	AC	163 ms	13 MB
clang++	testcase_13	AC	161 ms	13 MB
clang++	testcase_14	AC	162 ms	13 MB
clang++	testcase_15	AC	171 ms	13 MB
clang++	testcase_16	AC	167 ms	13 MB
clang++	testcase_17	AC	164 ms	13 MB
clang++	testcase_18	AC	162 ms	13 MB
clang++	testcase_19	AC	162 ms	13 MB
clang++	testcase_20	AC	161 ms	13 MB
clang++	testcase_21	AC	168 ms	13 MB
clang++	testcase_22	AC	155 ms	24 MB
clang++	testcase_23	AC	134 ms	11 MB

Back to top page