# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
348411 | dennisstar | Parachute rings (IOI12_rings) | C++17 | 2230 ms | 111620 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 MX = 1e6 + 5;
int N, deg[MX], cy, fl;
int dd[4][MX], p[4][MX], chk[4];
vector<int> adj[MX];
int pr[MX], sz[MX];
int gp(int a) { return pr[a]?(pr[a]=gp(pr[a])):a; }
bool un(int a, int b) {
a=gp(a), b=gp(b);
if (a!=b) {
pr[b]=a;
sz[a]+=sz[b];
}
return a!=b;
}
int gp(int a, int *p) { return p[a]?(p[a]=gp(p[a], p)):a; }
bool un(int a, int b, int *p) {
a=gp(a, p), b=gp(b, p);
if (a!=b) p[b]=a;
return a!=b;
}
vector<int> al;
void add(int u, int v) {
for (int t=0; t<al.size(); t++) {
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... |