algo

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

View the Project on GitHub kuhaku-space/algo

:heavy_check_mark: test/aoj/grl/range_query_on_tree_2.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/GRL_5_E
#include <cstdint>
#include <iostream>
#include "binary_tree/fenwick_tree_raq.hpp"
#include "tree/hld.hpp"

int main(void) {
    int n;
    std::cin >> n;
    Graph<void> g(n);
    for (int i = 0; i < n; ++i) {
        int k;
        std::cin >> k;
        while (k--) {
            int c;
            std::cin >> c;
            g.add_edges(i, c);
        }
    }

    heavy_light_decomposition hld(g);
    fenwick_tree_raq<std::int64_t> ft(n);
    int q;
    std::cin >> q;
    while (q--) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int v, w;
            std::cin >> v >> w;
            auto f = [&](int a, int b) { ft.add(a, b, w); };
            hld.for_each_edge(0, v, f);
        } else {
            int v;
            std::cin >> v;
            std::int64_t ans = 0;
            auto f = [&](int a, int b) { ans += ft.sum(a, b); };
            hld.for_each_edge(0, v, f);
            std::cout << ans << '\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: binary_tree/fenwick_tree_raq.hpp: line -1: no such header

Test cases

Env Name Status Elapsed Memory
g++ 00_sample_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 00_sample_01 :heavy_check_mark: AC 2 ms 3 MB
g++ 01_small_00 :heavy_check_mark: AC 2 ms 3 MB
g++ 02_medium_00 :heavy_check_mark: AC 2 ms 3 MB
g++ 03_corner_00 :heavy_check_mark: AC 2 ms 3 MB
g++ 03_corner_01 :heavy_check_mark: AC 2 ms 3 MB
g++ 04_rand_00 :heavy_check_mark: AC 2 ms 3 MB
g++ 04_rand_01 :heavy_check_mark: AC 2 ms 3 MB
g++ 04_rand_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_03 :heavy_check_mark: AC 2 ms 3 MB
g++ 04_rand_04 :heavy_check_mark: AC 3 ms 4 MB
g++ 04_rand_05 :heavy_check_mark: AC 4 ms 4 MB
g++ 04_rand_06 :heavy_check_mark: AC 6 ms 4 MB
g++ 04_rand_07 :heavy_check_mark: AC 15 ms 4 MB
g++ 05_grape_100 :heavy_check_mark: AC 2 ms 4 MB
g++ 05_grape_1000 :heavy_check_mark: AC 4 ms 4 MB
g++ 05_grape_100000 :heavy_check_mark: AC 330 ms 13 MB
g++ 05_grape_50000 :heavy_check_mark: AC 256 ms 8 MB
g++ 06_linear_10000 :heavy_check_mark: AC 18 ms 4 MB
g++ 06_linear_100000 :heavy_check_mark: AC 271 ms 12 MB
g++ 07_stair_1000 :heavy_check_mark: AC 14 ms 4 MB
g++ 07_stair_10000 :heavy_check_mark: AC 247 ms 4 MB
g++ 07_stair_100000 :heavy_check_mark: AC 292 ms 12 MB
g++ 08_star_100000_1 :heavy_check_mark: AC 273 ms 12 MB
g++ 08_star_100000_5 :heavy_check_mark: AC 276 ms 13 MB
g++ 08_star_10000_1 :heavy_check_mark: AC 233 ms 4 MB
g++ 08_star_10000_4 :heavy_check_mark: AC 225 ms 4 MB
g++ 09_nstar_100000_100_10 :heavy_check_mark: AC 296 ms 12 MB
g++ 09_nstar_100000_10_100 :heavy_check_mark: AC 320 ms 12 MB
g++ 09_nstar_10000_10_10 :heavy_check_mark: AC 235 ms 4 MB
g++ 09_nstar_10000_20_5 :heavy_check_mark: AC 251 ms 4 MB
g++ 10_extreme_00 :heavy_check_mark: AC 350 ms 12 MB
Back to top page