# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
62499 | zetapi | Parachute rings (IOI12_rings) | C++14 | 1040 ms | 57172 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.
int n, cyc, Res;
int E[1010000][3], deg[5][1010000], chk[5], Num[5];
int par[5][1010000], SZ[1010000];
void Init(int N_) {
n = N_;
Res = n;
int i;
for (i = 1; i <= n; i++)SZ[i] = 1, par[0][i] = i;
}
int Find(int ck, int a){
if (par[ck][a] == a)return a;
return par[ck][a] = Find(ck, par[ck][a]);
}
void Add(int ck, int a, int b){
if (chk[ck])return;
if (ck && (Num[ck] == a || Num[ck] == b))return;
if (!ck){
E[a][deg[0][a]] = b, E[b][deg[0][b]] = a;
}
deg[ck][a]++, deg[ck][b]++;
if (ck && (deg[ck][a] >= 3 || deg[ck][b] >= 3)){
chk[ck] = 1;
return;
}
a = Find(ck, a), b = Find(ck, b);
if (a == b){
if (!ck){
cyc++;
# | 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... |