# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476255 | Hamed5001 | Carnival (CEOI14_carnival) | C++14 | 19 ms | 316 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;
typedef long long ll;
const int mxN = 150;
struct DSU {
int N;
vector<int> P;
DSU(int N) : N(N) {
P.resize(N);
for (int i = 0; i < N; i++)
P[i] = i;
}
int getParent(int a) {
return P[a] = (P[a] == a ? a : getParent(P[a]));
}
void unite(int a, int b) {
a = getParent(a);
b = getParent(b);
P[a] = b;
}
};
DSU d(mxN);
Compilation message (stderr)
# | 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... |