test/verify/aoj-grl-5-a.test.cpp

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

Depends on

• Graph Template (グラフテンプレート) (graph/graph-template.hpp)
• Tree Diameter (木の直径) (graph/tree/tree-diameter.hpp)

Code

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

#include <iostream>

#include "../../graph/tree/tree-diameter.hpp"

using namespace std;

int main() {
  int N;
  cin >> N;
  TreeDiameter<int> g(N);
  g.read(N - 1, 0, true);
  cout << g.build() << endl;
}

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

#include <iostream>

#line 2 "graph/tree/tree-diameter.hpp"

#include <utility>
#include <vector>

#line 2 "graph/graph-template.hpp"

#include <cstddef>
#line 6 "graph/graph-template.hpp"

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 {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::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;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 7 "graph/tree/tree-diameter.hpp"

/**
 * @brief Tree-Diameter(木の直径)
 *
 */
template <typename T = int>
struct TreeDiameter : Graph<T> {
 public:
  using Graph<T>::Graph;
  using Graph<T>::g;
  std::vector<Edge<T> > path;

  T build() {
    to.assign(g.size(), -1);
    auto p = dfs(0, -1);
    auto q = dfs(p.second, -1);

    int now = p.second;
    while (now != q.second) {
      for (auto& e : g[now]) {
        if (to[now] == e.to) {
          path.emplace_back(e);
        }
      }
      now = to[now];
    }
    return q.first;
  }

  explicit TreeDiameter(const Graph<T>& g) : Graph<T>(g) {}

 private:
  std::vector<int> to;

  std::pair<T, int> dfs(int idx, int par) {
    std::pair<T, int> ret(0, idx);
    for (auto& e : g[idx]) {
      if (e.to == par) continue;
      auto cost = dfs(e.to, idx);
      cost.first += e.cost;
      if (ret < cost) {
        ret = cost;
        to[idx] = e.to;
      }
    }
    return ret;
  }
};
#line 8 "test/verify/aoj-grl-5-a.test.cpp"

using namespace std;

int main() {
  int N;
  cin >> N;
  TreeDiameter<int> g(N);
  g.read(N - 1, 0, true);
  cout << g.build() << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00	AC	3 ms	4 MB
g++	00_sample_01	AC	2 ms	4 MB
g++	01_small_00	AC	2 ms	4 MB
g++	01_small_01	AC	2 ms	4 MB
g++	01_small_02	AC	2 ms	4 MB
g++	01_small_03	AC	2 ms	4 MB
g++	02_medium_00	AC	2 ms	3 MB
g++	02_medium_01	AC	2 ms	4 MB
g++	02_medium_02	AC	2 ms	4 MB
g++	02_medium_03	AC	2 ms	4 MB
g++	03_corner_00	AC	2 ms	4 MB
g++	03_corner_01	AC	2 ms	4 MB
g++	04_binary_00	AC	2 ms	3 MB
g++	04_binary_01	AC	2 ms	4 MB
g++	04_binary_02	AC	2 ms	4 MB
g++	04_binary_03	AC	3 ms	4 MB
g++	05_linear_00	AC	2 ms	4 MB
g++	05_linear_01	AC	3 ms	4 MB
g++	05_linear_02	AC	4 ms	4 MB
g++	05_linear_03	AC	5 ms	4 MB
g++	06_rand_00	AC	2 ms	4 MB
g++	06_rand_01	AC	3 ms	4 MB
g++	06_rand_02	AC	5 ms	4 MB
g++	06_rand_03	AC	8 ms	4 MB
g++	07_large_00	AC	14 ms	5 MB
g++	07_large_01	AC	20 ms	6 MB
g++	07_large_02	AC	21 ms	6 MB
g++	07_large_03	AC	19 ms	7 MB
g++	08_maximum_00	AC	59 ms	10 MB
g++	08_maximum_01	AC	60 ms	11 MB
g++	08_maximum_02	AC	66 ms	11 MB
g++	08_maximum_03	AC	69 ms	17 MB
clang++	00_sample_00	AC	3 ms	4 MB
clang++	00_sample_01	AC	2 ms	4 MB
clang++	01_small_00	AC	2 ms	4 MB
clang++	01_small_01	AC	2 ms	4 MB
clang++	01_small_02	AC	2 ms	4 MB
clang++	01_small_03	AC	2 ms	4 MB
clang++	02_medium_00	AC	2 ms	4 MB
clang++	02_medium_01	AC	2 ms	4 MB
clang++	02_medium_02	AC	2 ms	4 MB
clang++	02_medium_03	AC	2 ms	4 MB
clang++	03_corner_00	AC	2 ms	4 MB
clang++	03_corner_01	AC	2 ms	4 MB
clang++	04_binary_00	AC	2 ms	4 MB
clang++	04_binary_01	AC	2 ms	4 MB
clang++	04_binary_02	AC	2 ms	4 MB
clang++	04_binary_03	AC	3 ms	4 MB
clang++	05_linear_00	AC	2 ms	4 MB
clang++	05_linear_01	AC	3 ms	4 MB
clang++	05_linear_02	AC	4 ms	4 MB
clang++	05_linear_03	AC	5 ms	4 MB
clang++	06_rand_00	AC	2 ms	4 MB
clang++	06_rand_01	AC	3 ms	4 MB
clang++	06_rand_02	AC	5 ms	4 MB
clang++	06_rand_03	AC	8 ms	4 MB
clang++	07_large_00	AC	14 ms	5 MB
clang++	07_large_01	AC	21 ms	6 MB
clang++	07_large_02	AC	21 ms	6 MB
clang++	07_large_03	AC	20 ms	8 MB
clang++	08_maximum_00	AC	57 ms	10 MB
clang++	08_maximum_01	AC	60 ms	11 MB
clang++	08_maximum_02	AC	71 ms	11 MB
clang++	08_maximum_03	AC	82 ms	21 MB

Back to top page