# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496400 | kappa | Odašiljači (COCI20_odasiljaci) | C++14 | 102 ms | 368 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 n, say, vis[1005];
double lo = 0, hi = 1e9, lim = 1e-7;
pair<int, int> antenna[1005];
long long uzaklik(pair<int, int> a, pair<int, int> b){
return (long long) abs(a.first - b.first) * abs(a.first - b.first) + (long long) abs(a.second - b.second) * abs(a.second - b.second);
}
void gez(int ind, double r){
vis[ind] = 1;
say++;
for (int i = 0; i < n; i++)
{
if(i != ind && vis[i] == 0 && r * r * 4 > (long long) uzaklik(antenna[ind], antenna[i])){
gez(i, r);
}
}
}
bool check(double r){
memset(vis, 0, sizeof(vis));
say = 0;
gez(0, r);
return say == n;
}
int main(){
cin >> n;
for (int i = 0; i < n; i++)
{
int x, y;
cin >> x >> y;
antenna[i].first = x;
antenna[i].second = y;
}
while(hi - lo > lim){
double mid = (hi + lo) / 2;
if(check(mid)){
hi = mid;
}else{
lo = mid;
}
}
cout.precision(7);
cout << fixed << lo;
//printf("%.7lf", lo);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |