CP-Algorithms Library

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

View the Project on GitHub cp-algorithms/cp-algorithms-aux

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

Depends on

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/resolver.py", line 290, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus.py", line 243, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus_bundle.py", line 322, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ almost_line_00 :heavy_check_mark: AC 309 ms 36 MB
g++ almost_line_01 :heavy_check_mark: AC 306 ms 37 MB
g++ almost_line_02 :heavy_check_mark: AC 296 ms 36 MB
g++ almost_line_03 :heavy_check_mark: AC 303 ms 36 MB
g++ almost_uni_00 :heavy_check_mark: AC 220 ms 37 MB
g++ almost_uni_01 :heavy_check_mark: AC 226 ms 37 MB
g++ example_00 :heavy_check_mark: AC 3 ms 3 MB
g++ line_00 :heavy_check_mark: AC 236 ms 37 MB
g++ max_random_00 :heavy_check_mark: AC 334 ms 37 MB
g++ max_random_01 :heavy_check_mark: AC 343 ms 37 MB
g++ random_00 :heavy_check_mark: AC 287 ms 30 MB
g++ random_01 :heavy_check_mark: AC 322 ms 34 MB
g++ random_02 :heavy_check_mark: AC 154 ms 6 MB
g++ random_03 :heavy_check_mark: AC 302 ms 32 MB
g++ random_04 :heavy_check_mark: AC 249 ms 23 MB
g++ small_random_00 :heavy_check_mark: AC 92 ms 4 MB
g++ small_random_01 :heavy_check_mark: AC 92 ms 4 MB
g++ small_random_02 :heavy_check_mark: AC 91 ms 3 MB
g++ small_random_03 :heavy_check_mark: AC 91 ms 3 MB
g++ small_random_04 :heavy_check_mark: AC 96 ms 4 MB
g++ uni_00 :heavy_check_mark: AC 206 ms 36 MB
Back to top page