test/tree/tree_diameter.test.cpp

• View this file on GitHub
• Last update: 2026-08-12 07:38:15+00:00
• Problem: https://judge.yosupo.jp/problem/tree_diameter

Depends on

• graph/csr_graph.hpp
• tree/tree_diameter.hpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/tree_diameter"
#include <graph/csr_graph.hpp>
#include <tree/tree_diameter.hpp>

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int N;
    cin >> N;
    CSRGraph<long long> g(N);
    for (auto i = 0; i < N - 1; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        g.add_edge(u, v, w);
    }
    g.build_undirected();
    auto [d, path] = tree_diameter(g);
    cout << d << " " << path.size() << "\n";
    for (auto u : path) {
        cout << u << " ";
    }
}

#line 1 "test/tree/tree_diameter.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/tree_diameter"
#include <graph/csr_graph.hpp>
#include <tree/tree_diameter.hpp>

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int N;
    cin >> N;
    CSRGraph<long long> g(N);
    for (auto i = 0; i < N - 1; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        g.add_edge(u, v, w);
    }
    g.build_undirected();
    auto [d, path] = tree_diameter(g);
    cout << d << " " << path.size() << "\n";
    for (auto u : path) {
        cout << u << " ";
    }
}

Back to top page