library2

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

View the Project on GitHub goodstudyqaq/library2

:heavy_check_mark: test/aoj-0334.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0334
#include <bits/stdc++.h>

#include "../graph/flow/bipartite-flow.hpp"

using namespace std;

#ifdef LOCAL
#include "copypaste/debug.h"
#else
#define debug(...) 42
#endif

#define endl '\n'

struct fast_ios {
    fast_ios() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    };
} fast_ios_;

int main() {
#ifdef LOCAL
    freopen("./data.in", "r", stdin);
#endif

    int n;
    cin >> n;
    n--;

    BipartiteFlow flow(n, n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int b;
            cin >> b;
            if (b) flow.add_edge(j, i);
        }
    }

    auto v = flow.lex_max_matching();
    if (v.size() < n) {
        cout << "no" << endl;
    } else {
        cout << "yes" << endl;
        for (auto &p : v) {
            cout << p.second + 1 << endl;
        }
    }
}
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 477, in update
    raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: test/aoj-0334.test.cpp: line 9: unable to process #include in #if / #ifdef / #ifndef other than include guards

Test cases

Env Name Status Elapsed Memory
g++ 00_sample_00.in :heavy_check_mark: AC 5 ms 4 MB
g++ 00_sample_01.in :heavy_check_mark: AC 4 ms 4 MB
g++ 00_sample_02.in :heavy_check_mark: AC 4 ms 4 MB
g++ 01_small_00.in :heavy_check_mark: AC 4 ms 4 MB
g++ 02_rand_00.in :heavy_check_mark: AC 4 ms 4 MB
g++ 02_rand_01.in :heavy_check_mark: AC 4 ms 4 MB
g++ 02_rand_02.in :heavy_check_mark: AC 4 ms 4 MB
g++ 02_rand_03.in :heavy_check_mark: AC 4 ms 4 MB
g++ 02_rand_04.in :heavy_check_mark: AC 5 ms 4 MB
g++ 02_rand_05.in :heavy_check_mark: AC 5 ms 4 MB
g++ 02_rand_06.in :heavy_check_mark: AC 5 ms 4 MB
g++ 02_rand_07.in :heavy_check_mark: AC 5 ms 4 MB
g++ 03_grid_00.in :heavy_check_mark: AC 4 ms 3 MB
g++ 03_grid_01.in :heavy_check_mark: AC 4 ms 4 MB
g++ 03_grid_02.in :heavy_check_mark: AC 6 ms 4 MB
g++ 03_grid_03.in :heavy_check_mark: AC 6 ms 4 MB
g++ 03_grid_04.in :heavy_check_mark: AC 6 ms 4 MB
g++ 03_grid_05.in :heavy_check_mark: AC 6 ms 4 MB
g++ 03_grid_06.in :heavy_check_mark: AC 6 ms 4 MB
g++ 03_grid_07.in :heavy_check_mark: AC 6 ms 4 MB
g++ 04_no_00.in :heavy_check_mark: AC 4 ms 4 MB
g++ 04_no_01.in :heavy_check_mark: AC 4 ms 4 MB
g++ 08_bf_killer_00.in :heavy_check_mark: AC 16 ms 4 MB
g++ 09_bf_attack_00.in :heavy_check_mark: AC 5 ms 4 MB
Back to top page