# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
842264 | WLZ | Logičari (COCI21_logicari) | C++17 | 79 ms | 36608 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 MAXN = (int) 1e5;
const int INF = 0x3f3f3f3f;
class dsu {
private: vector<int> p, rank, sz;
public:
dsu(int n) {
p.assign(n, -1);
rank.assign(n, 0);
sz.assign(n, 1);
}
int root(int x) {
if (p[x] == -1) return x;
return p[x] = root(p[x]);
}
bool connected(int x, int y) {
return root(x) == root(y);
}
void connect(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (rank[x] > rank[y]) p[y] = x, sz[x] += sz[y];
else {
p[x] = y;
# | 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... |