problem Link : 

The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel. Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts. Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts. Input The first line of input contains N, the number of test cases. The first line of each test case contains 1 ≤ S ≤ 100, the number of satellite channels, and S < P ≤ 500, the number of outposts. P lines follow, giving the (x, y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000). Output For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.

Sample Input 1 2 4 0 100 0 300 0 600 150 750

Sample Output 212.13

Code Examples

#1 Code Example with C Programming

Code - C Programming

#include <bits/stdc++.h>
using namespace std;
int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(2); cin.tie(nullptr); return 0; }

int __fastio = fastio();

#define fi first
#define se second
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

struct UF {
    int cnt;
    vector<int> p, rank, size;
    UF(int N): cnt{N} {
        p = rank = size = vector<int>(N, 1);
        for (int i = 0; i  <  N; i++) p[i] = i;
    int find(int i) {
        return p[i] == i ? i : p[i] = find(p[i]);
    bool connected(int i, int j) {
        return find(i) == find(j);
    void join(int i, int j) {
        if (connected(i, j)) return;
        int x = find(i), y = find(j);
        if (rank[x] > rank[y]) {
            p[y] = x;
            size[x] += size[y];
        } else {
            p[x] = y;
            size[y] += size[x];
            if (rank[x] == rank[y]) rank[y]++;

void solve() {
	int s, p;
	cin >> s >> p;
	vector < pair<int, int>> V(p);
	for(int i=0;i < p;i++) cin >> V[i].fi >> V[i].se;
	vector < tuple;
Copy The Code & Try With Live Editor


2 4
0 100
0 300
0 600
150 750




UVA Online Judge solution - 10369-Arctic Network - UVA Online Judge solution in C,C++,java

UVA Online Judge solution - 10365-Blocks - UVA Online Judge solution in C,C++,java
UVA Online Judge solution - 10382-Watering Grass - UVA Online Judge solution in C,C++,java