# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994209 | vjudge1 | Jail (JOI22_jail) | C++17 | 5056 ms | 1048576 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;
using ll = long long;
const int MAXN = 120'001;
const int K = 20;
vector<int> g[MAXN], g2[MAXN];
int tin[MAXN], tout[MAXN], s[MAXN], e[MAXN], col[MAXN], hv[MAXN], up[MAXN][K], timer;
bool ok;
void dfs(int u, int p = -1) {
tin[u] = timer++;
up[u][0] = p == -1 ? 0 : p;
for (int v : g[u]) {
if (v != p) dfs(v, u);
}
tout[u] = timer++;
}
void dfs2(int u, stack<int> &top) {
col[u] = 1;
for (int v : g2[u]) {
if (col[v] == 0) dfs2(v, top);
else if (col[v] == 1) ok = false;
}
col[u] = 2;
top.push(u);
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |