# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102997 | wxh010910 | Parachute rings (IOI12_rings) | C++17 | 1370 ms | 64688 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;
class dsu {
public:
vector<int> p, sz, deg;
bool ans;
void init(int n) {
p.resize(n);
sz.resize(n);
deg.resize(n);
ans = true;
for (int i = 0; i < n; ++i) {
p[i] = i;
sz[i] = 1;
deg[i] = 0;
}
}
inline int find(int x) {
while (x != p[x]) {
x = p[x] = p[p[x]];
}
return x;
}
void unite(int x, int y) {
++deg[x];
# | 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... |