#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) x.begin(), x.end()
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
int main()
{
fast;
// freopen("pails.in", "r", stdin);
// freopen("pails.out", "w", stdout);
ll n;
cin >> n;
vector<pair<ll, ll>> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i].first >> v[i].second;
}
ll mx = 0;
for (int i = 0; i < n; i++)
{
ll mn = LLONG_MAX;
for (int j = 0; j < n; j++)
{
if (i == j)
continue;
ll x = abs(v[i].first - v[j].first), y = abs(v[i].second - v[j].second);
ll dis = x * x + y * y;
mn = min(mn, dis);
// if (i == 0 && j == 3)
// cout << x << ' ' << y << ' ';
}
mx = max(mx, mn);
}
// cout << mx << '\n';
cout << fixed << setprecision(7) << sqrt((ld)mx) / ld(2);
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
| 10 |
Correct |
2 ms |
348 KB |
Output is correct |
