# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334618 | GioChkhaidze | Odašiljači (COCI20_odasiljaci) | C++14 | 81 ms | 8664 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>
#define ll long long
#define pb push_back
#define F first
#define S second
using namespace std;
const int N=1e3+1;
int n,x[N],y[N],p[N],sz[N];
vector < pair < double , pair < int , int > > > v;
int P(int x) {
if (p[x]==x) return x;
return p[x]=P(p[x]);
}
main () {
cin>>n;
for (int i=1; i<=n; i++) {
cin>>x[i]>>y[i];
p[i]=i,sz[i]=1;
}
for (int i=1; i<=n; i++)
for (int j=1; j<i; j++)
v.pb({sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))/2.0,{i,j}});
sort(v.begin(),v.end());
for (int i=0; i<v.size(); i++) {
int a=v[i].S.F,b=v[i].S.S;
if (P(a)==P(b)) continue;
a=P(a),b=P(b);
p[b]=a;
sz[a]+=sz[b];
sz[b]=0;
if (sz[a]==n) {
printf("%.7f",v[i].F);
exit(0);
}
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |