Lowest Common Ancestor (verify/tree/lca.test.cpp)

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

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/hld.hpp
• cp-algo/util/big_alloc.hpp

Code

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

using namespace std;
using namespace cp_algo::graph;

void solve() {
    int n, q;
    cin >> n >> q;
    graph g(n);
    cp_algo::big_vector<edge_index> p(n);
    p[0] = -1;
    for(int i = 1; i < n; i++) {
        node_index v;
        cin >> v;
        p[i] = g.add_edge(v, i);
    }
    heavy_light hld(g, 0, &p);
    for(int i = 0; i < q; i++) {
        node_index u, v;
        cin >> u >> v;
        cout << hld.lca(u, v) << '\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++	almost_line_00	AC	175 ms	29 MB
g++	almost_line_01	AC	194 ms	29 MB
g++	binary_00	AC	416 ms	29 MB
g++	binary_01	AC	452 ms	29 MB
g++	binary_02	AC	385 ms	29 MB
g++	example_00	AC	5 ms	4 MB
g++	line_00	AC	116 ms	26 MB
g++	line_01	AC	132 ms	28 MB
g++	line_02	AC	70 ms	6 MB
g++	line_03	AC	56 ms	27 MB
g++	line_04	AC	52 ms	22 MB
g++	max_line_00	AC	142 ms	29 MB
g++	max_line_01	AC	157 ms	29 MB
g++	max_line_02	AC	142 ms	29 MB
g++	max_random_00	AC	283 ms	29 MB
g++	max_random_01	AC	269 ms	29 MB
g++	max_random_02	AC	248 ms	29 MB
g++	path_graph_root_centroid_00	AC	133 ms	29 MB
g++	path_graph_root_centroid_01	AC	142 ms	29 MB
g++	path_graph_root_centroid_02	AC	134 ms	29 MB
g++	random_00	AC	189 ms	26 MB
g++	random_01	AC	214 ms	28 MB
g++	random_02	AC	94 ms	6 MB
g++	random_03	AC	93 ms	27 MB
g++	random_04	AC	80 ms	22 MB

Back to top page