# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546184 | keta_tsimakuridze | Parachute rings (IOI12_rings) | C++14 | 1616 ms | 111660 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;
#define f first
#define s second
#define pii pair<int,int>
const int N = 1e6 + 5;
int n, sz = 0, h[N];
int cycle[6], tried[6] , rem[6], stop = 0, p[N][6], built[2], d[6][N];
pii deg;
vector<int> V[N];
void Init(int N_) {
n = N_;
for(int i = 0; i < n; i++) {
for(int t = 0; t < 6; t++) {
p[i][t] = i;
}
}
}
int find(int a, int t) {
return (p[a][t] == a ? p[a][t] : p[a][t] = find(p[a][t], t));
}
void merge(int a,int b, int t) {
a = find(a, t); b = find(b, t);
if(a == b) return;
p[a][t] = b;
return;
}
void dfs(int a, int p) {
if(p == -1) h[a] = 1;
else
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... |