# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376251 | tqbfjotld | Odašiljači (COCI20_odasiljaci) | C++14 | 280 ms | 492 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;
int p[1005];
int rt(int a){return p[a]==a?a:p[a]=rt(p[a]);}
void un(int a, int b){a = rt(a); b = rt(b); p[a] = b;}
int X[1005];
int Y[1005];
int n;
bool check(long long a){
for (int x = 0; x<n; x++){
p[x] = x;
}
for (int x = 0; x<n; x++){
for (int y = x+1; y<n; y++){
if (((X[x]-X[y])*(X[x]-X[y]))+((Y[x]-Y[y])*(Y[x]-Y[y]))<=a){
un(x,y);
}
}
}
int t = rt(0);
for (int x = 1; x<n; x++){
if (rt(x)!=t) return false;
}
return true;
}
int main(){
scanf("%d",&n);
for (int x = 0; x<n; x++){
scanf("%d%d",&X[x],&Y[x]);
}
long long a = -1;
long long b = 2000000000000000000;
while (a+1<b){
long long mid = (a+b)/2;
if (check(mid)){
b = mid;
}
else a = mid;
}
printf("%f",sqrt((double)b)/2);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |