# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1173662 | SpyrosAliv | Thousands Islands (IOI22_islands) | C++20 | 24 ms | 7140 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> u, v;
vector<vector<int>> av;
bool cycle;
vector<bool> vis;
void dfs(int node) {
if (cycle) return;
vis[node] = true;
vector<int> targs;
for (int i = 1; i < (int)av[node].size(); i++) {
targs.push_back(v[av[node][i]]);
}
sort(targs.begin(), targs.end());
int s = targs.size();
for (int i = 1; i < s; i++) {
if (targs[i] == targs[i-1] || vis[targs[i]]) {
cycle = true;
return;
}
}
if (targs.size() > 0 && vis[targs[0]]) {
cycle = true;
return;
}
for (int i = 0; i < s; i++) {
dfs(targs[i]);
# | 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... |