제출 #1084587

#제출 시각아이디문제언어결과실행 시간메모리
1084587SamueleVid수천개의 섬 (IOI22_islands)C++17
1.75 / 100
20 ms7908 KiB
#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;

    bool tolto_p = 0;
    for (auto x : adj[u]) {
        if (x == p && !tolto_p) {
            tolto_p = 1;
            continue;
        }
        dfs(x, u);
    }
}   

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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...