/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 560.0 KiB
#2 Accepted 1ms 588.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Wrong Answer 2ms 328.0 KiB
#5 Accepted 1ms 540.0 KiB
#6 Accepted 1ms 516.0 KiB
#7 Accepted 1ms 552.0 KiB
#8 Accepted 2ms 540.0 KiB
#9 Accepted 1ms 520.0 KiB
#10 Accepted 1ms 768.0 KiB
#11 Wrong Answer 2ms 328.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
const int N = 1e5+5;

double a[N], b[N];

double dis(double x, double y, double xx, double yy){
    return sqrtl((x-xx)*(x-xx)+(y-yy)*(y-yy));
}

int main() {
    int n; cin >> n;
    double mxx = -2e9, mxy = -2e9;
    double mnx = 2e9, mny = 2e9;
    for(int i=0;i<n;++i) cin >> a[i] >> b[i];
    double d = -1.0;
    for(int i=0;i<n;++i){
        for(int j=0;j<n;++j){
            d = max(d, dis(a[i], b[i], a[j], b[j]));
            // cerr << d << endl;
        }
    }
    cout << fixed << setprecision(10) << d / 2 << 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:11:48
Judged At
2024-10-30 12:12:02
Judged By
Score
45
Total Time
2ms
Peak Memory
768.0 KiB