algo

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

View the Project on GitHub kuhaku-space/algo

:heavy_check_mark: test/yosupo/data_structure/unionfind_with_potential.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/unionfind_with_potential
#include <iostream>
#include <vector>
#include "math/modint.hpp"
#include "tree/weighted_union_find.hpp"

using Mint = modint998;

int main(void) {
    int n, q;
    std::cin >> n >> q;
    weighted_union_find<Mint> uf(n);
    while (q--) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int u, v;
            Mint x;
            std::cin >> u >> v >> x;
            if (uf.same(u, v)) std::cout << (uf.diff(v, u) == x) << '\n';
            else std::cout << uf.unite(v, u, x) << '\n';
        } else {
            int u, v;
            std::cin >> u >> v;
            if (uf.same(u, v)) std::cout << uf.diff(v, u) << '\n';
            else std::cout << -1 << '\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: math/modint.hpp: line -1: no such header

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 3 ms 4 MB
g++ max_random_00 :heavy_check_mark: AC 404 ms 4 MB
g++ max_random_01 :heavy_check_mark: AC 417 ms 4 MB
g++ max_random_02 :heavy_check_mark: AC 397 ms 4 MB
g++ path_00 :heavy_check_mark: AC 434 ms 5 MB
g++ path_01 :heavy_check_mark: AC 422 ms 5 MB
g++ path_02 :heavy_check_mark: AC 484 ms 5 MB
g++ path_03 :heavy_check_mark: AC 457 ms 5 MB
g++ random_00 :heavy_check_mark: AC 327 ms 4 MB
g++ random_01 :heavy_check_mark: AC 327 ms 4 MB
g++ random_02 :heavy_check_mark: AC 286 ms 4 MB
g++ random_03 :heavy_check_mark: AC 58 ms 4 MB
g++ random_04 :heavy_check_mark: AC 205 ms 4 MB
g++ random_05 :heavy_check_mark: AC 279 ms 4 MB
g++ random_06 :heavy_check_mark: AC 220 ms 5 MB
g++ random_07 :heavy_check_mark: AC 41 ms 4 MB
g++ random_08 :heavy_check_mark: AC 98 ms 4 MB
g++ random_09 :heavy_check_mark: AC 427 ms 4 MB
Back to top page