6G network

input/code.cpp: In function 'void solve()':
input/code.cpp:63:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::complex<long double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int i = 0; i < points.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~
input/code.cpp:65:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::complex<long double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (int j = i+1; j < points.size(); j++)
      |                           ~~^~~~~~~~~~~~~~~
input/code.cpp:81:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::tuple<long double, long double, long double> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for (int i = 0; i < data.size(); i++)
      |                     ~~^~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <climits>
#include <cmath>
#include <functional>
#include <type_traits>
#include <fstream>
#include <bitset>
#include <complex>
#include <iomanip>
 
#define int long long
using namespace std;
 
//#define cross(x, y) ((x).real()*(y).imag()-(x).imag()*(y).real()) 
#define cross(x, y) (((x)*conj(y)).imag())
#define sign(v) ((0 < (v)) - ((v) < 0))

int link[1000000];
int siz[1000000];

int find(int x) {
    while (x != link[x]) x = link[x];
    return x;
}

bool same(int a, int b) {
    return find(a) == find(b);
}

void unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (siz[a] < siz[b]) swap(a,b);
    siz[a] += siz[b];
    link[b] = a;
}
void solve()
{
    int n;
    cin >> n;
 
    for (int i = 1; i <= n; i++) link[i] = i;
    for (int i = 1; i <= n; i++) siz[i] = 1;

    vector<complex<long double>> points(n);
    for (int i = 0; i < n; i++)
    {
        long double a, b;
        cin >> a >> b;
        points[i] = {a, b};
    }

    vector<tuple<long double, long double, long double>> data;
    data.reserve(n*n);
    for (int i = 0; i < points.size(); i++)
    {
        for (int j = i+1; j < points.size(); j++)
        {
            //long double maxVal = (points[i].real() - points[j].real()) * (points[i].real() - points[j].real()) + (points[i].imag() - points[j].imag()) * (points[i].imag() - points[j].imag());
            //long double dist = sqrt(maxVal);
            long double xD = abs(points[i].real() - points[j].real());
            long double yD = abs(points[i].imag() - points[j].imag());
            long double dist = sqrt(xD) * sqrt(yD) * sqrt(xD/yD + yD/xD);
            cout << "DIST " << dist << endl;
            data.push_back({dist, i, j});
            //data.push_back({maxVal, i, j});
        }
    }
    sort(data.begin(), data.end());
 
    int c = n;
    long double last = 0;
    for (int i = 0; i < data.size(); i++)
    {
        if (find(get<1>(data[i])) == find(get<2>(data[i])))
            continue;
        unite(get<1>(data[i]), get<2>(data[i]));
        c--;
        last = get<0>(data[i]);
        if (c == 1)
            break;
    }
    cout << last;//sqrt(last);
    
}
 
 
signed main()
{
    ios::sync_with_stdio(0);
    cout.precision(25);
    //setprecision(10);
    //cin.tie(0);
 
    int t = 1;
 
    //cin >> t;
    //ifstream f("testcase.txt");
    //cin.rdbuf(f.rdbuf());
 
    for (int i = 0; i < t; i++)
        solve();
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

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: WRONG ANSWER

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