# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104289 | naoai | Parachute rings (IOI12_rings) | C++14 | 2245 ms | 124656 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 nmax = 1e6 + 5;
static int n;
static int grad[nmax + 1];
static vector<int> ciclu;
static vector<int> cen, g3, trk;
static vector<int> vec[nmax + 1];
struct Str {
bool valid;
int t[nmax + 1];
int g[nmax + 1];
void init () {
valid = 1;
for (int i = 0; i < n; ++ i) {
t[i] = i;
}
}
inline int find_tata (int x) {
if (x == t[x]) return x;
return t[x] = find_tata(t[x]);
}
void link (int A, int B, int type = -1) {
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... |