# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
391229 | ahmet | Odašiljači (COCI20_odasiljaci) | C++14 | 553 ms | 452 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;
#define zaman cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "
#define rep(i,n) for(long long (i)=0;(i)<(n);++(i))
#define ref(i,a,b) for (long long (i)=(a); (i)<=(b); ++(i))
#define endl '\n'
#define ll long long
#define pb push_back
#define pii pair<ll,ll>
#define mp make_pair
const long long mx=1005;
long long sz[1005],p[1005];
long long par(long long x){
if(p[x]==x)return x;
return p[x]=par(p[x]);
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
long long n;cin >> n;
vector <pair <long long,long long > > a;
rep(i,n){
long long x,y;cin >> x >> y;
a.pb(mp(x,y));
}
long double l=0;long double r=2e9;
while(r>l+0.000001){
long double mid=(l+r)/2;
bool ok=false;
rep(i,mx)sz[i]=1;
rep(i,mx)p[i]=i;
for(long long i=0;i<n;++i){
for(long long j=0;j<n;++j){
long double dis=(sqrtl((a[i].first-a[j].first)*(a[i].first-a[j].first)+(a[i].second-a[j].second)*(a[i].second-a[j].second)))/2.0;
if(dis>mid+0.000001)continue;//mid e arti 0.0000001 ekle
par(i);par(j);
if(p[i]==p[j])continue;
// prlong longf("mid:%f dis:%f %d:%d %d:%d\n",mid,dis,i,p[i],j,p[j]);
if(sz[p[i]]>sz[p[j]]){
sz[p[i]]+=sz[p[j]];
sz[p[j]]=0;
p[p[j]]=p[i];
}
else{
sz[p[j]]+=sz[p[i]];
sz[p[i]]=0;
p[p[i]]=p[j];
}
}
}
for(long long i=0;i<n;++i){
if(sz[i]==n)ok=true;
//prlong longf("i:%d sz[i]:%d ok:%d\n",i,sz[i],ok);
}
if(ok)r=mid;
else l=mid+0.000001;
//prlong longf("%f %f %d\n",l,r,ok);
}
cout << fixed << setprecision(9) << l << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |