# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442061 | Dormi | Keys (IOI21_keys) | C++17 | 1868 ms | 173612 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"
#include "keys.h"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
int sz(const T &a){return int(a.size());}
const int MN=3e5+1;
struct dsu {
pii t[MN];
void reset(int n) {
for (int i = 0; i <= n; i++)t[i] = {i, 1};
}
int find(int a) {
if (t[a].first == a)return a;
return t[a].first = find(t[a].first);
}
bool uni(int a, int b) {
int ap = find(a), bp = find(b);
if (ap == bp)return false;
if (t[ap].second < t[bp].second)swap(ap, bp);
t[bp].first = ap;
t[ap].second += t[bp].second;
return true;
}
}cn,cc;
# | 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... |