# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
438410 | mango_lassi | Keys (IOI21_keys) | C++17 | 2109 ms | 120008 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 <vector>
#include <bits/stdc++.h>
using namespace std;
class DSU {
private:
vector<int> comp, siz;
public:
DSU(int n) : comp(n), siz(n, 1) {
for (int i = 0; i < n; ++i) comp[i] = i;
}
int getc(int i) {
if (comp[i] != i) comp[i] = getc(comp[i]);
return comp[i];
}
bool join(int a, int b) {
a = getc(a);
b = getc(b);
siz[a] += siz[b];
comp[b] = a;
return true;
}
int compSize(int i) { return siz[getc(i)]; }
};
struct Targets {
set<int> act_outs, keys;
set<pair<int, int>> outs;
};
# | 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... |