#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
bool arr[10000] = {};
ll calc(ll x ,ll y){
return abs(x - y) * abs(x-y);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;cin >> n;
vector<pair<ll,ll>>v;
for(int i=0;i<n;i++){
int x,y;cin >> x >> y;
v.push_back({x,y});
}
ll maxx = -1e18;
int arr[n+5] = {};
memset(arr,-1,sizeof arr);
for(int i=0;i<n;i++){
int idx = -1;
ll minx = 1e18;
for(int j = 0; j < n;j++){
if(i == j)continue;
if((!((v[i].first == v[j].first) && (v[i].second == v[j].second))) && arr[j] != i && arr[i] != j){
ll x= calc(v[i].first,v[j].first);
ll y = calc(v[i].second,v[j].second);
if(minx > x + y){
minx = x+y;
idx = j;
}
}
}
arr[i] = idx;
if(minx != (ll)1e18){
maxx = max(maxx,minx);
}
}
long double ans = maxx / 2;
cout << fixed << setprecision(7) << ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
464 KB |
Output isn't correct |
| 6 |
Incorrect |
1 ms |
484 KB |
Output isn't correct |
| 7 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
476 KB |
Output isn't correct |
