6G network

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <climits>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void task1(){
    ll n;
    cin >> n;

    ll a,b;
    vector<pair<ll,ll>> arr(n + 1);
    for(ll i = 0; i < n; i++){
        cin >> a >> b;
        arr[i] = {a,b};
    }
    arr[n] = arr[0];
    ll sum = 0;
    for(ll i = 0; i < n; i++){
        sum += (arr[i].first * arr[i+1].second) - (arr[i+1].first * arr[i].second);
       // cout << arr[i].first << " " << arr[i+1].second << endl;
       // cout << arr[i+1].first << " " << arr[i].second << endl;

    }
    cout << abs(sum) << endl;
}

double euclDist(pair<double,double> p1, pair<double,double> p2){
    return sqrt( pow((p1.first - p2.first),2) + pow((p1.second - p2.second),2) );
}

void task3(){
    ll n;
    cin >> n;

    long double a,b;
    vector<pair<double,double>> arr(n);

    for(ll i = 0; i < n; i++){
        cin >> a >> b;
        arr[i] = {a,b};
    }

    sort(arr.begin(), arr.end());

    
    /*for(ll i = 0; i < n; i++){
        long double d = 1e18;
        ll count = 1;
        while(i - count >= 0 && abs(arr[i-count].first - arr[i].first) < d && abs(arr[i-count].second - arr[i].second) < d){
            d = min(d, euclDist(arr[i], arr[i-count]));
            count++;
        }
    }*/

    vector<double> dists;
    for(ll i = 0; i < n; i++){
        double d = MAXFLOAT;
        for(ll j = 0; j < n; j++){
            if(i == j) continue;
            d = min(d, euclDist(arr[i], arr[j]));
        }
        dists.push_back(d);
        cout << dists[i] << endl;
    }

    double maxDist = 0.0;
    for(ll i = 0; i < n; i++) if(dists[i] > maxDist) maxDist = dists[i];
    cout  <<  maxDist << endl;
    


}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(20);
    task3();
    

}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: ACCEPTED

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: ACCEPTED

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: ACCEPTED

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: ACCEPTED

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: WRONG ANSWER

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: WRONG ANSWER

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: WRONG ANSWER

Test 63

Verdict: WRONG ANSWER

Test 64

Verdict: WRONG ANSWER

Test 65

Verdict: WRONG ANSWER