# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261814 | atoiz | Toll (APIO13_toll) | C++14 | 1946 ms | 7672 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 <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <map>
#include <functional>
#include <numeric>
using namespace std;
struct DSU
{
int N;
vector<int> A;
DSU(int _N = 0): N(_N), A(_N + 1, -1) {};
void reset(int _N) { N = _N, A.assign(N + 1, -1); }
int get(int u) { return A[u] < 0 ? u : A[u] = get(A[u]); }
bool same(int u, int v) { return get(u) == get(v); }
void join(int u, int v)
{
u = get(u), v = get(v);
if (u == v) return;
if (A[u] > A[v]) swap(u, v);
A[u] += A[v], A[v] = u;
}
};
const int MAXN = 100007, MAXM = 300007, MAXK = 20, INF = 1e8;
int N, M, K, C;
int label[MAXN], P[MAXN];
# | 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... |