# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
674071 | US3RN4M3 | Thousands Islands (IOI22_islands) | C++17 | 52 ms | 18188 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"islands.h"
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
using ll = long long;
const int mx = 200005;
vector<pair<int, int>> fwd[mx];
vector<pair<int, int>> bck[mx];
int vis[mx];
bool is_cycle[mx];
int N;
int bit;
bool toggle;
bool has_cycle(int cur) {
vis[cur] = 1;
for(auto [nxt, id] : fwd[cur]) {
if(cur == 0) {
if(toggle) {
if((id >> bit) & 1) continue;
} else {
if(!((id >> bit) & 1)) continue;
}
}
if(vis[nxt] == 0) {
if(has_cycle(nxt)) return true;
} else if(vis[nxt] == 1) {
return true;
}
}
# | 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... |