# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768871 | MilosMilutinovic | Odašiljači (COCI20_odasiljaci) | C++14 | 52 ms | 8640 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 N = 1010;
int n, x[N], y[N], rt[N];
struct Event {
double r;
int i, j;
bool const operator < (const Event& ev) {
return r < ev.r;
}
};
int root(int x) { return rt[x] == x ? x : rt[x] = root(rt[x]); }
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) return false;
rt[x] = y;
return true;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &x[i], &y[i]);
}
vector<Event> ev;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
double d = (x[i] - x[j]) * 1ll * (x[i] - x[j]) + (y[i] - y[j]) * 1ll * (y[i] - y[j]);
d = sqrt(d) / 2;
ev.push_back({d, i, j});
}
}
sort(ev.begin(), ev.end());
if (ev.empty()) {
printf("0.000000");
return 0;
}
int comps = n;
for (int i = 1; i <= n; i++) {
rt[i] = i;
}
for (auto& p : ev) {
if (unite(p.i, p.j)) {
comps--;
}
if (comps == 1) {
printf("%.6lf", p.r);
return 0;
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |