# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
252560 | Kubin | Parachute rings (IOI12_rings) | C++17 | 21 ms | 25472 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;
struct disjoint_sets
{
vector<size_t> repr, rank;
disjoint_sets(size_t n) : repr(n), rank(n)
{
for(size_t i = 0; i < n; i++)
repr[i] = i;
}
size_t find(size_t v)
{
return v == repr[v] ? v : repr[v] = find(repr[v]);
}
bool unite(size_t u, size_t v)
{
if((u = repr[u]) == (v = repr[v]))
return false;
if(rank[u] > rank[v])
swap(u, v);
rank[v] += (rank[u] == rank[v]);
repr[u] = v;
return true;
}
};
# | 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... |