# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23659 | Hiasat | Parachute rings (IOI12_rings) | C++14 | 4040 ms | 114480 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;
int N;
int dsu[1000001], E[1000001], freq[1000001][5], sz[1000001], in[1000001], big[1000001][5], vis[1000001], vsId;
vector<int> adj[1000001];
bool block[1000001];
bool fn(int u, int p) {
if (vis[u] == vsId) {
return false;
}
if (!block[u] && in[u] > 2)
return false;
vis[u] = vsId;
for (int i = 0; i < adj[u].size(); ++i) {
int v = adj[u][i];
if (v == p || block[v])
continue;
if (block[u] && vis[v] == vsId)
continue;
if (!fn(v, u))
return false;
}
return true;
}
bool check(int u , int p) {
Compilation message (stderr)
# | 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... |