# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
50139 | top34051 | Parachute rings (IOI12_rings) | C++17 | 826 ms | 51584 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;
const int maxn = 1e6 + 5;
int n, m, ok;
pair<int,int> e[maxn];
int cyc, cysz, head0[maxn], deg0[maxn], sz0[maxn];
int ban[5], bad[5], head[5][maxn], deg[5][maxn];
void Init(int _n) {
n = _n;
for(int i=1;i<=n;++i) head0[i] = i, sz0[i] = 1;
for(int k=1;k<=4;++k) {
for(int i=1;i<=n;++i) head[k][i] = i;
}
}
int CountCritical() {
if(!ok) {
if(cyc==0) return n;
if(cyc==1) return cysz;
return 0;
}
else {
int res = 0;
for(int i=1;i<=4;i++) res += !bad[i];
return res;
# | 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... |