oj.uz

Submission #935451

# Submission time Handle Problem Language Result Execution time Memory
935451 2024-02-29T06:08:36 Z 3afareto Odašiljači (COCI20_odasiljaci) C++17
0 / 70
 4 ms 456 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n;
    cin >> n;

    vector<pair<double, double>> arr(n);

    for(int i = 0; i < n; i++){
        cin >> arr[i].first >> arr[i].second;
    }

    double ans = LLONG_MAX;

    for(int i = 0; i < n; i++){
        double change = 0;
        for(int j = 0; j < n; j++){
            if(i == j){
                continue;
            }
            double current = sqrt(pow(arr[i].first - arr[j].first, 2) + pow(arr[i].second - arr[j].second, 2));
            change = max(current, change);
        }
        ans = min(change, ans);
    }

    cout << ans / 2.0;

    return 0;
}

Subtask #1
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Incorrect 1 ms 348 KB Output isn't correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Incorrect 1 ms 456 KB Output isn't correct
8 Incorrect 2 ms 344 KB Output isn't correct
9 Incorrect 4 ms 348 KB Output isn't correct
10 Incorrect 4 ms 348 KB Output isn't correct