This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
constexpr int MAXN = 1e5 + 5;
vector<int> adj[MAXN];
bool v[MAXN];
bool ciclo = 0;
void dfs(int u, int p) {
    // cout << "u, p " << u << " " << p << '\n';
    if (v[u]) {
        ciclo = 1;
        return;
    }
    v[u] = 1;
    for (auto x : adj[u]) {
        dfs(x, u);
        if (ciclo) return;
        
    }
    v[u] = 0;
}   
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    fill(v, v + MAXN, 0);
    for (int i = 0; i < M; i ++) {
        adj[U[i]].push_back(V[i]);
    }
    dfs(0, -1);
    return ciclo;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |