# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
408796 | SirCovidThe19th | Park (BOI16_park) | C++14 | 698 ms | 69124 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;
struct pt{
long long x, y, r;
int border; //-1, 0, 1, 2, 3 -> not border, up, right, down, left
};
struct visitor{
int r, e, id;
};
struct edg{
int a, b; long double w;
};
bool operator<(const edg& a, const edg& b) {
return (a.w < b.w);
}
bool operator<(const visitor& a, const visitor& b) {
return (a.r < b.r);
}
int n, m, w, h;
bool cn[4][4];
vector<pt> circles; vector<edg> edges; vector<visitor> people;
vector<int> par, sz; vector<vector<bool>> group;
int find(int node){
if (par[node] == node) return node;
return par[node] = find(par[node]);
}
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... |