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: Eulerian Trail (Undirected) (verify/graph/euler_undirected.test.cpp)

Depends on

Code

// @brief Eulerian Trail (Undirected)
#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_undirected"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/graph/euler.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::graph;

void solve() {
    int n, m;
    cin >> n >> m;
    graph g(n);
    g.read_edges(m);
    auto trail = euler_trail(g);
    if(!trail) {
        cout << "No" << "\n";
    } else {
        auto [v, es] = *trail;
        cout << "Yes" << "\n";
        cout << v;
        for(auto e: es) {
            v = g.edge(e).traverse(v);
            cout << ' ' << v;
        }
        cout << "\n";
        for(auto e: es) {cout << e << ' ';}
        cout << "\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_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 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ euler_tour_00 :heavy_check_mark: AC 63 ms 13 MB
g++ euler_tour_01 :heavy_check_mark: AC 65 ms 13 MB
g++ euler_tour_02 :heavy_check_mark: AC 65 ms 13 MB
g++ euler_tour_03 :heavy_check_mark: AC 66 ms 13 MB
g++ example_00 :heavy_check_mark: AC 5 ms 4 MB
g++ example_01 :heavy_check_mark: AC 4 ms 4 MB
g++ many_same_vertex_00 :heavy_check_mark: AC 70 ms 15 MB
g++ many_same_vertex_01 :heavy_check_mark: AC 70 ms 15 MB
g++ many_same_vertex_02 :heavy_check_mark: AC 68 ms 15 MB
g++ max_random_00 :heavy_check_mark: AC 30 ms 12 MB
g++ max_random_01 :heavy_check_mark: AC 30 ms 12 MB
g++ max_random_02 :heavy_check_mark: AC 37 ms 13 MB
g++ max_random_walk_00 :heavy_check_mark: AC 51 ms 13 MB
g++ max_random_walk_01 :heavy_check_mark: AC 55 ms 13 MB
g++ max_random_walk_02 :heavy_check_mark: AC 73 ms 15 MB
g++ mid_random_00 :heavy_check_mark: AC 27 ms 4 MB
g++ mid_random_01 :heavy_check_mark: AC 26 ms 4 MB
g++ mid_random_02 :heavy_check_mark: AC 26 ms 4 MB
g++ mid_random_walk_00 :heavy_check_mark: AC 47 ms 4 MB
g++ mid_random_walk_01 :heavy_check_mark: AC 52 ms 4 MB
g++ mid_random_walk_02 :heavy_check_mark: AC 49 ms 4 MB
g++ small_random_00 :heavy_check_mark: AC 35 ms 4 MB
g++ small_random_01 :heavy_check_mark: AC 34 ms 4 MB
g++ small_random_02 :heavy_check_mark: AC 34 ms 4 MB
g++ small_random_walk_00 :heavy_check_mark: AC 48 ms 4 MB
g++ small_random_walk_01 :heavy_check_mark: AC 47 ms 4 MB
g++ small_random_walk_02 :heavy_check_mark: AC 48 ms 4 MB
Back to top page