# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832889 | Username4132 | Thousands Islands (IOI22_islands) | C++17 | 1087 ms | 8696 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 <variant>
#include<iostream>
#include <vector>
using namespace std;
using pii = pair<int, int>;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back
const int MAXN = 100010;
int n, m;
bool marked[MAXN], inst[MAXN], vis[MAXN];
vector<int> g[MAXN];
vector<int> st;
bool dfs1(int v){
vis[v]=inst[v]=true;
st.PB(v);
bool ret=false;
for(int to:g[v]) if(!marked[to] && !vis[to]){
ret|=dfs1(to);
}
else if(inst[to]){
ret=true;
}
st.pop_back();
inst[v]=false;
return ret;
}
# | 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... |