6G network

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<double, int> pii;

// Structure to represent a mast (point)
struct Mast {
    double x, y;
};

// Function to calculate Euclidean distance between two masts
double distance_between(const Mast& a, const Mast& b) {
    double dx = a.x - b.x;
    double dy = a.y - b.y;
    return sqrt(dx * dx + dy * dy);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;
    vector<Mast> masts(n);
    for(int i = 0; i < n; ++i){
        cin >> masts[i].x >> masts[i].y;
    }
    
    // Prim's algorithm implementation
    vector<bool> visited(n, false);
    vector<double> min_dist(n, 1e18);
    
    // Start from the first mast
    min_dist[0] = 0.0;
    double max_distance = 0.0;
    
    for(int i = 0; i < n; ++i){
        // Find the unvisited mast with the smallest min_dist
        double current_min = 1e18;
        int u = -1;
        for(int j = 0; j < n; ++j){
            if(!visited[j] && min_dist[j] < current_min){
                current_min = min_dist[j];
                u = j;
            }
        }
        
        if(u == -1){
            // All masts are visited
            break;
        }
        
        visited[u] = true;
        max_distance = max(max_distance, current_min);
        
        // Update min_dist for adjacent masts
        for(int v = 0; v < n; ++v){
            if(!visited[v]){
                double dist = distance_between(masts[u], masts[v]);
                if(dist < min_dist[v]){
                    min_dist[v] = dist;
                }
            }
        }
    }
    
    // Print the result with high precision
    cout << fixed << setprecision(12) << max_distance;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED