Wrong Answer
Code
#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ll long long
const int N = 1e5+5;
ll a[N], b[N];
ll dis(ll x, ll y, ll xx, ll yy){
return ((x-xx)*(x-xx)+(y-yy)*(y-yy));
}
int main() {
int n; cin >> n;
for(int i=0;i<n;++i) cin >> a[i] >> b[i];
long double d = 0;
for(int i=0;i<n;++i){
for(int j=0;j<n;++j){
d = max(d, (long double) dis(a[i], b[i], a[j], b[j]));
// cerr << d << endl;
}
}
cout << fixed << setprecision(10) << sqrt(d) / 2.0<< nl;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1123 Relic Rescue Radius!
- Contest
- Sylhet ICPC 2024 Collaborative Challenge: Episode 2
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-10-30 12:24:11
- Judged At
- 2024-11-11 02:34:38
- Judged By
- Score
- 45
- Total Time
- 1ms
- Peak Memory
- 532.0 KiB