# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1086052 | SamueleVid | Thousands Islands (IOI22_islands) | C++17 | 1046 ms | 9052 KiB |
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;
set<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]].insert(V[i]); // no stesso arco sennò diventa non lineare sui nodi
# | 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... |