Tree Diameter (verify/tree/diameter.test.cpp)

• View this file on GitHub
• Last update: 2025-12-12 22:29:00+01:00
• Problem: https://judge.yosupo.jp/problem/tree_diameter

Depends on

• cp-algo/graph/base.hpp
• cp-algo/graph/concepts.hpp
• cp-algo/graph/edge_types.hpp
• cp-algo/structures/stack_union.hpp
• cp-algo/tree/ascending_dfs.hpp
• cp-algo/tree/diameter.hpp
• cp-algo/util/big_alloc.hpp

Code

// @brief Tree Diameter
#define PROBLEM "https://judge.yosupo.jp/problem/tree_diameter"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/tree/diameter.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::graph;

void solve() {
    int n;
    cin >> n;
    weighted_graph g(n);
    g.read_edges(n - 1);
    auto [d, v, path] = tree_diameter<diameter_mode::recover_path>(g);
    cout << d << ' ' << size(path) + 1 << '\n';
    cout << v;
    for(auto e: path) {
        v = g.edge(e).traverse(v);
        cout << ' ' << v;
    }
    cout << "\n";
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	4 MB
g++	hack_00	AC	4 ms	4 MB
g++	line_00	AC	182 ms	45 MB
g++	max_random_00	AC	153 ms	41 MB
g++	max_random_01	AC	161 ms	41 MB
g++	random_00	AC	125 ms	34 MB
g++	random_01	AC	157 ms	39 MB
g++	random_02	AC	19 ms	7 MB
g++	random_03	AC	147 ms	37 MB
g++	random_04	AC	81 ms	28 MB
g++	small_random_00	AC	5 ms	4 MB
g++	small_random_01	AC	4 ms	4 MB
g++	small_random_02	AC	4 ms	4 MB
g++	small_random_03	AC	4 ms	4 MB
g++	small_random_04	AC	4 ms	4 MB
g++	uni_00	AC	126 ms	41 MB

Back to top page