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/bipartite_matching.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/GRL_7_A
#include <iostream>
#include "flow/max_flow.hpp"

int main(void) {
    int x, y, e;
    std::cin >> x >> y >> e;
    mf_graph<int> mf(x + y + 2);
    while (e--) {
        int s, t;
        std::cin >> s >> t;
        mf.add_edge(s, x + t, 1);
    }

    int s = x + y, t = s + 1;
    for (int i = 0; i < x; ++i) mf.add_edge(s, i, 1);
    for (int i = 0; i < y; ++i) mf.add_edge(x + i, t, 1);
    std::cout << mf.flow(s, t) << '\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: flow/max_flow.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++ 01_small_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 01_small_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 02_corner_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 02_corner_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 03_medium_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 03_medium_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 03_medium_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 03_medium_03 :heavy_check_mark: AC 2 ms 4 MB
g++ 03_medium_04 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_03 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_04 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_05 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_06 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_07 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_08 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_rand_09 :heavy_check_mark: AC 2 ms 4 MB
g++ 05_large_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 05_large_01 :heavy_check_mark: AC 3 ms 4 MB
g++ 05_large_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 05_large_03 :heavy_check_mark: AC 2 ms 4 MB
g++ 06_sparse_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 06_sparse_01 :heavy_check_mark: AC 2 ms 3 MB
g++ 06_sparse_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 06_sparse_03 :heavy_check_mark: AC 2 ms 4 MB
g++ 07_all_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 07_all_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 07_all_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 07_all_03 :heavy_check_mark: AC 2 ms 4 MB
g++ 07_all_04 :heavy_check_mark: AC 2 ms 4 MB
g++ 07_all_05 :heavy_check_mark: AC 2 ms 4 MB
g++ 08_biased_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 08_biased_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 09_complete_00 :heavy_check_mark: AC 4 ms 4 MB
g++ 09_complete_01 :heavy_check_mark: AC 4 ms 4 MB
g++ 09_complete_02 :heavy_check_mark: AC 4 ms 4 MB
g++ 09_complete_03 :heavy_check_mark: AC 4 ms 4 MB
Back to top page