Eulerian Trail (Directed) (verify/graph/euler_directed.test.cpp)

• View this file on GitHub
• Last update: 2025-12-12 22:29:00+01:00
• Problem: https://judge.yosupo.jp/problem/eulerian_trail_directed

Depends on

• cp-algo/graph/base.hpp
• cp-algo/graph/concepts.hpp
• cp-algo/graph/edge_types.hpp
• cp-algo/graph/euler.hpp
• cp-algo/structures/stack_union.hpp
• cp-algo/util/big_alloc.hpp

Code

// @brief Eulerian Trail (Directed)
#define PROBLEM "https://judge.yosupo.jp/problem/eulerian_trail_directed"
#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;
    digraph 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	AC	64 ms	10 MB
g++	euler_tour_01	AC	64 ms	10 MB
g++	euler_tour_02	AC	63 ms	10 MB
g++	euler_tour_03	AC	64 ms	10 MB
g++	example_00	AC	6 ms	4 MB
g++	example_01	AC	5 ms	4 MB
g++	many_same_vertex_00	AC	61 ms	12 MB
g++	many_same_vertex_01	AC	63 ms	12 MB
g++	many_same_vertex_02	AC	62 ms	12 MB
g++	max_random_00	AC	31 ms	8 MB
g++	max_random_01	AC	32 ms	8 MB
g++	max_random_02	AC	36 ms	9 MB
g++	max_random_walk_00	AC	57 ms	10 MB
g++	max_random_walk_01	AC	60 ms	10 MB
g++	max_random_walk_02	AC	75 ms	12 MB
g++	mid_random_00	AC	32 ms	4 MB
g++	mid_random_01	AC	25 ms	4 MB
g++	mid_random_02	AC	25 ms	4 MB
g++	mid_random_walk_00	AC	44 ms	4 MB
g++	mid_random_walk_01	AC	45 ms	4 MB
g++	mid_random_walk_02	AC	46 ms	4 MB
g++	small_random_00	AC	28 ms	4 MB
g++	small_random_01	AC	28 ms	4 MB
g++	small_random_02	AC	27 ms	4 MB
g++	small_random_walk_00	AC	48 ms	4 MB
g++	small_random_walk_01	AC	47 ms	4 MB
g++	small_random_walk_02	AC	47 ms	4 MB

Back to top page