# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1100149 | CpDark | Roadside Advertisements (NOI17_roadsideadverts) | C++17 | 73 ms | 12892 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 vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vp;
typedef vector<vp> vvp;
vvp graph;
struct DSU {
vi par, subSize;
int size;
DSU() {}
void init(int n) {
size = n;
par.clear();
subSize.clear();
par.resize(n);
subSize.resize(n, 1);
for (int i = 0; i < n; i++) par[i] = i;
}
int findSet(int v) {
if (v == par[v]) return v;
par[v] = findSet(par[v]);
return par[v];
}
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... |