Airports.java

/*
AIRPORTS
Send Feedback
AIRPORTS
The government of a certain developing nation wants to improve transportation in one of its most inaccessible areas, in an 
attempt to attract investment. The region consists of several important locations that must have access to an airport.
Of course, one option is to build an airport in each of these places, but it may turn out to be cheaper to build fewer airports
and have roads link them to all of the other locations. Since these are long distance roads connecting major locations in the 
country (e.g. cities, large villages, industrial areas), all roads are two-way. Also, there may be more than one direct road 
possible between two areas. This is because there may be several ways to link two areas (e.g. one road tunnels through a mountain 
while the other goes around it etc.) with possibly differing costs.
A location is considered to have access to an airport either if it contains an airport or if it is possible to travel by road to 
another location from there that has an airport. You are given the cost of building an airport and a list of possible roads between
pairs of locations and their corresponding costs. The government now needs your help to decide on the cheapest way of ensuring that
every location has access to an airport. The aim is to make airport access as easy as possible, so if there are several ways of
getting the minimal cost, choose the one that has the most airports.
Input
The first line of input contains the integer T (T < 25), the number of test cases. The rest of the input consists of T cases. 
Each case starts with two integers N, M and A (0 < N ≤ 10, 000, 0 ≤ M ≤ 100, 000, 0 < A ≤ 10, 000) separated by white space.
N is the number of locations, M is the number of possible roads that can be built, and A is the cost of building an airport.
The following M lines each contain three integers X, Y and C (1 ≤ X, Y ≤ N, 0 < C ≤ 10, 000), separated by white space. X and Y
are two locations, and C is the cost of building a road between X and Y .
Output
Your program should output exactly T lines, one for each case. Each line should be of the form ‘Case #X: Y Z’, where 
X is the case number Y is the minimum cost of making roads and airports so that all locations have access to at least one airport,
and Z is the number of airports to be built. As mentioned earlier, if there are several answers with minimal cost,
choose the one that maximizes the number of airports.
Sample Input
2
4 4 100
1 2 10
4 3 12
4 1 41
2 3 23
5 3 1000
1 2 20
4 5 40
3 2 30
Sample Output
Case #1: 145 1
Case #2: 2090 2*/
import java.util.*;
class Node{
    int id,wt;
    Node(int id,int wt){
        this.id = id;
        this.wt = wt;
    }
}
public class Airports {
    static ArrayList<Integer> ans[];
    static int  visited[];
    static long cost = 0; 
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
        int T = sc.nextInt();
        for(int t=0;t<T;t++){
            int n = sc.nextInt(), d = sc.nextInt(), c = sc.nextInt();
            cost =0;
            int A = 0; 
            ArrayList<Node> arr[] = new ArrayList[n];
            visited = new int[n];
            for(int i=0;i<n;i++) arr[i] = new ArrayList<>();
            while(d--!=0){
                int a = sc.nextInt() - 1, b =sc.nextInt() - 1, wt = sc.nextInt();
                arr[a].add(new Node(b,wt));
                arr[b].add(new Node(a,wt));
            }
            ans = new ArrayList[n];
            int dist[] = new int[n], parent[] = new int[n];
            for(int i=0;i<n;i++) parent[i] = i;
            Arrays.fill(dist,Integer.MAX_VALUE);
            cost += Dijsktra(arr,dist,c,parent);
            
            for(int i=0;i<n;i++){
                parent[i] = findParent(i,parent);
            }
            for(int i=0;i<n;i++) { 
            if(parent[i] == i){ A++; cost += c; }}
            
            System.out.println("Case #"+(t+1)+":"+" "+cost+" "+A);
        }
	}
    static int findParent(int v,int parent[]){
        if(v == parent[v]) return v;
        parent[v] = findParent(parent[v],parent);
        return parent[v];
    }
    static long Dijsktra(ArrayList<Node> arr[] , int dist[],int c,int parent[]){
        int n = arr.length;
        long tc = 0;
        for(int i=0;i<n;i++){
            if(visited[i] == 0){
                dist[i] = 0;
                TreeSet<Node> set = new TreeSet<>(new Comparator<Node>(){
                    @Override
                    public int compare(Node o1,Node o2){
                        return o1.wt == o2.wt ? o1.id - o2.id : o1.wt - o2.wt;
                    }
                });
                set.add(new Node(i,0));
                
                while(!set.isEmpty()){
                    Node temp = set.pollFirst();
                    int cur = temp.id, d =temp.wt;
                    visited[cur] = 1;
                    tc += dist[cur];
                   // System.out.println("adding "+dist[cur]);
                    for(int j = 0;j<arr[cur].size();j++){
                        Node v = arr[cur].get(j);
                        if(visited[v.id] == 0 && v.wt < c && dist[v.id] > v.wt){
                            Node temp1 = new Node(v.id,dist[v.id]);
                            if(set.contains(temp1)) set.remove(temp1);
                            dist[v.id] =  v.wt;
                            set.add(new Node(v.id,dist[v.id]));
                            parent[v.id] = cur;}} 
                }     
                
            }
        }
        return tc;
    }

}