algo

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub kuhaku-space/algo

:heavy_check_mark: test/yosupo/tree/lowest_common_ancestor.2.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/lca
#include <iostream>
#include <vector>
#include "graph/graph.hpp"
#include "tree/linear_lca.hpp"

int main(void) {
    int n, q;
    std::cin >> n >> q;
    std::vector<int> p(n - 1);
    for (auto &e : p) std::cin >> e;
    Graph<void> g(n);
    for (int i = 0; i < n - 1; ++i) g.add_edges(p[i], i + 1);
    linear_lca tr(g);
    while (q--) {
        int u, v;
        std::cin >> u >> v;
        std::cout << tr.lca(u, v) << '\n';
    }

    return 0;
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, 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 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: graph/graph.hpp: line -1: no such header

Test cases

Env Name Status Elapsed Memory
g++ almost_line_00 :heavy_check_mark: AC 1287 ms 63 MB
g++ almost_line_01 :heavy_check_mark: AC 1300 ms 63 MB
g++ binary_00 :heavy_check_mark: AC 1404 ms 64 MB
g++ binary_01 :heavy_check_mark: AC 1381 ms 64 MB
g++ binary_02 :heavy_check_mark: AC 1377 ms 64 MB
g++ example_00 :heavy_check_mark: AC 3 ms 4 MB
g++ line_00 :heavy_check_mark: AC 994 ms 50 MB
g++ line_01 :heavy_check_mark: AC 1018 ms 57 MB
g++ line_02 :heavy_check_mark: AC 702 ms 9 MB
g++ line_03 :heavy_check_mark: AC 201 ms 52 MB
g++ line_04 :heavy_check_mark: AC 298 ms 36 MB
g++ max_line_00 :heavy_check_mark: AC 1208 ms 60 MB
g++ max_line_01 :heavy_check_mark: AC 1241 ms 60 MB
g++ max_line_02 :heavy_check_mark: AC 1175 ms 60 MB
g++ max_random_00 :heavy_check_mark: AC 1303 ms 63 MB
g++ max_random_01 :heavy_check_mark: AC 1280 ms 63 MB
g++ max_random_02 :heavy_check_mark: AC 1245 ms 63 MB
g++ path_graph_root_centroid_00 :heavy_check_mark: AC 1134 ms 60 MB
g++ path_graph_root_centroid_01 :heavy_check_mark: AC 1145 ms 60 MB
g++ path_graph_root_centroid_02 :heavy_check_mark: AC 1155 ms 60 MB
g++ random_00 :heavy_check_mark: AC 987 ms 52 MB
g++ random_01 :heavy_check_mark: AC 1081 ms 59 MB
g++ random_02 :heavy_check_mark: AC 724 ms 10 MB
g++ random_03 :heavy_check_mark: AC 317 ms 55 MB
g++ random_04 :heavy_check_mark: AC 367 ms 37 MB
Back to top page