test/verify/aoj-1595.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595

Depends on

• graph/tree/rerooting.hpp
• template/template.hpp

Code

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

#include "../../template/template.hpp"

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

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"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1595

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
#line 4 "test/verify/aoj-1595.test.cpp"

#line 1 "graph/tree/rerooting.hpp"
template <typename sum_t, typename key_t>
struct ReRooting {
  struct Edge {
    int to;
    key_t data;
    sum_t dp, ndp;
  };

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

  vector<vector<Edge> > g;
  const F f;
  const G gg;
  const sum_t ident;
  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);
    }
  }

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

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	6 ms	4 MB
g++	testcase_01	AC	6 ms	4 MB
g++	testcase_02	AC	111 ms	13 MB
g++	testcase_03	AC	113 ms	13 MB
g++	testcase_04	AC	126 ms	13 MB
g++	testcase_05	AC	136 ms	13 MB
g++	testcase_06	AC	130 ms	13 MB
g++	testcase_07	AC	112 ms	13 MB
g++	testcase_08	AC	127 ms	13 MB
g++	testcase_09	AC	130 ms	13 MB
g++	testcase_10	AC	120 ms	13 MB
g++	testcase_11	AC	131 ms	13 MB
g++	testcase_12	AC	139 ms	13 MB
g++	testcase_13	AC	117 ms	13 MB
g++	testcase_14	AC	136 ms	13 MB
g++	testcase_15	AC	114 ms	13 MB
g++	testcase_16	AC	113 ms	13 MB
g++	testcase_17	AC	128 ms	13 MB
g++	testcase_18	AC	137 ms	13 MB
g++	testcase_19	AC	121 ms	13 MB
g++	testcase_20	AC	122 ms	13 MB
g++	testcase_21	AC	126 ms	13 MB
g++	testcase_22	AC	116 ms	26 MB
g++	testcase_23	AC	104 ms	12 MB
clang++	testcase_00	AC	6 ms	4 MB
clang++	testcase_01	AC	6 ms	4 MB
clang++	testcase_02	AC	117 ms	13 MB
clang++	testcase_03	AC	112 ms	13 MB
clang++	testcase_04	AC	121 ms	13 MB
clang++	testcase_05	AC	125 ms	13 MB
clang++	testcase_06	AC	127 ms	13 MB
clang++	testcase_07	AC	136 ms	13 MB
clang++	testcase_08	AC	113 ms	13 MB
clang++	testcase_09	AC	130 ms	13 MB
clang++	testcase_10	AC	112 ms	13 MB
clang++	testcase_11	AC	122 ms	13 MB
clang++	testcase_12	AC	120 ms	13 MB
clang++	testcase_13	AC	125 ms	13 MB
clang++	testcase_14	AC	132 ms	13 MB
clang++	testcase_15	AC	135 ms	13 MB
clang++	testcase_16	AC	121 ms	13 MB
clang++	testcase_17	AC	114 ms	13 MB
clang++	testcase_18	AC	136 ms	13 MB
clang++	testcase_19	AC	119 ms	13 MB
clang++	testcase_20	AC	127 ms	13 MB
clang++	testcase_21	AC	112 ms	13 MB
clang++	testcase_22	AC	118 ms	24 MB
clang++	testcase_23	AC	99 ms	12 MB

Back to top page