# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
356545 | fbosnjak | Odašiljači (COCI20_odasiljaci) | C++14 | 89 ms | 8688 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 maxn = 1000;
int N;
int par[maxn];
double Dist(double a1, double a2, double b1, double b2) {
return sqrt(pow(a1-b1,2) + pow(a2-b2,2));
}
int Find(int x) {
return (x == par[x]) ? x : par[x] = Find(par[x]);
}
bool Union(int x, int y) {
x = par[x];
y = par[y];
if (x != y) {par[x] = y; return true;}
return false;
}
int main() {
cin >> N;
double x[N], y[N];
vector <pair <double, pair <int, int> > > v;
for (int i = 0; i < N; i++) par[i] = i;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
for (int j = 0; j < i; j++) {
v.push_back({Dist(x[i], y[i], x[j], y[j]), {i, j}});
}
}
sort(v.begin(), v.end());
double ans = 0.0;
for (int i = 0; i < v.size(); i++) {
if (Union(v[i].second.first, v[i].second.second)) ans = v[i].first / 2;
}
printf("%.9f \n", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |