oj.uz

Submission #674539

# Submission time Handle Problem Language Result Execution time Memory
674539 2022-12-25T04:04:46 Z MacPhucKhang Odašiljači (COCI20_odasiljaci) C++17
42 / 70
 13 ms 340 KB 
#include <bits/stdc++.h>
#define pldi pair <long double, int>
#define fi first
#define se second
using namespace std;
struct Coord{
  int x, y;
};
int n;
vector <Coord> a;
vector <long double> d;
long double Distance(Coord i, Coord j){
   return sqrt(pow(i.x - j.x, 2) + pow(i.y - j.y, 2));
}
void Solve(){
   long double ans = -INFINITY;
   for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++){
         if (i == j) continue;
         long double temp = Distance(a[i], a[j]);
         d[i] = min(d[i], temp);
      }
   for (auto i : d) ans = max(ans, i);
   cout << fixed << setprecision(7) << (n <= 1 ? 0 :ans / 2);
}
int main(){
   cin >> n; 
   a.resize(n);
   d.resize(n, INFINITY);
   for (auto &i : a)
      cin >> i.x >> i.y;
   Solve();
}

Subtask #1
42.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Incorrect 3 ms 212 KB Output isn't correct
7 Correct 4 ms 212 KB Output is correct
8 Incorrect 6 ms 340 KB Output isn't correct
9 Incorrect 13 ms 340 KB Output isn't correct
10 Correct 11 ms 336 KB Output is correct