Jump on Tree (verify/tree/jump.test.cpp)

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

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 Jump on Tree
#define PROBLEM "https://judge.yosupo.jp/problem/jump_on_tree"
#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);
    g.read_edges(n - 1);
    heavy_light hld(g);
    for(int i = 0; i < q; i++) {
        node_index u, v;
        int k;
        cin >> u >> v >> k;
        auto ores = hld.jump(u, v, k);
        if (!ores) {
            cout << -1 << '\n';
        } else {
            cout << *ores << '\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	481 ms	37 MB
g++	almost_line_01	AC	510 ms	37 MB
g++	almost_line_02	AC	466 ms	37 MB
g++	almost_line_03	AC	382 ms	37 MB
g++	almost_uni_00	AC	282 ms	37 MB
g++	almost_uni_01	AC	271 ms	37 MB
g++	example_00	AC	5 ms	4 MB
g++	line_00	AC	265 ms	37 MB
g++	max_random_00	AC	361 ms	37 MB
g++	max_random_01	AC	391 ms	37 MB
g++	random_00	AC	318 ms	30 MB
g++	random_01	AC	347 ms	34 MB
g++	random_02	AC	167 ms	6 MB
g++	random_03	AC	366 ms	32 MB
g++	random_04	AC	268 ms	23 MB
g++	small_random_00	AC	101 ms	3 MB
g++	small_random_01	AC	98 ms	3 MB
g++	small_random_02	AC	97 ms	4 MB
g++	small_random_03	AC	96 ms	4 MB
g++	small_random_04	AC	100 ms	4 MB
g++	uni_00	AC	239 ms	37 MB

Back to top page