Problem:
Single Source Shortest Path

For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).

Input

An edge-weighted graph G (V, E) and the source r.

|V| |E| r
s0 t0 d0
s1 t1 d1
:
s|E|-1 t|E|-1 d|E|-1

|V| is the number of vertices and |E| is the number of edges in G. The graph vertices are named with the numbers 0, 1,..., |V|-1 respectively. r is the source of the graph.

si and ti represent source and target vertices of i-th edge (directed) and di represents the cost of the i-th edge.

Output

Print the costs of SSSP in the following format.

c0
c1
:
c|V|-1

The output consists of |V| lines. Print the cost of the shortest path from the source r to each vertex 0, 1, ... |V|-1 in order. If there is no path from the source to a vertex, print INF.

Constraints

1 ≤ |V| ≤ 100000

0 ≤ di ≤ 10000

0 ≤ |E| ≤ 500000

There are no parallel edges

There are no self-loops

Sample Input 1

4 5 0
0 1 1
0 2 4
1 2 2
2 3 1
1 3 5

Sample Output 1

0
1
3
4

Sample Input 2

4 6 1
0 1 1
0 2 4
2 0 1
1 2 2
3 1 1
3 2 5

Sample Output 2

3
0
2
INF

Solution in JAVA (judge verdict: Wrong Answer)

import java.util.*;
import java.io.*;

class Main {

	static final int INF = Integer.MAX_VALUE/2;
	public static final Comparator<Node> COMPARATOR = new Comp();
	
	private static class Comp implements Comparator<Node>{
		public int compare(Node x,Node y){
			return (x.d > y.d) ? 1 : ((x.d == y.d) ? 0 : -1);
		}
	}

	static class Node {
		int id;
		int d;
		Node(int id,int d){
			this.id = id;
			this.d = d;
		}
	}

	static class Edge {
		int to;
		int cost;
		Edge(int to,int cost){
			this.to = to;
			this.cost = cost;
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		String line = br.readLine();
		String[] str = line.split(" ");
		int v = Integer.parseInt(str[0]);
		int e = Integer.parseInt(str[1]);
		int r = Integer.parseInt(str[2]);

		LinkedList<LinkedList<Edge>> graph = new LinkedList<LinkedList<Edge>>();
		for (int i=0; i<v; i++) {
			graph.add(new LinkedList<Edge>());
		}

		for (int i=0; i<e; i++) {
			line = br.readLine();
			str = line.split(" ");
			int si = Integer.parseInt(str[0]);
			int ti = Integer.parseInt(str[1]);
			int di = Integer.parseInt(str[2]);
			LinkedList<Edge> list = graph.get(si);
			list.add(new Edge(ti,di));
		}

		PriorityQueue<Node> pQue = new PriorityQueue<Node>(100000,COMPARATOR);
		int[] d = new int[v];
		Arrays.fill(d,INF);
		d[r] = 0;
		pQue.add(new Node(r,0));

		while (!pQue.isEmpty()) {
			Node node = pQue.poll();
			int now = node.id;
			if (d[now] < node.d)
				continue;
			LinkedList<Edge> list = graph.get(now);
			//while (!list.isEmpty()) {
			for (int i=0; i<list.size(); i++){
				Edge edge = list.poll();
				if (d[edge.to] > d[now] + edge.cost) {
					d[edge.to] = d[now] + edge.cost;
					pQue.add(new Node(edge.to,d[edge.to]));
				}
			}
		}

		for (int i : d) {
			System.out.println(i==INF?"INF":i);
		}

		br.close();
	}
}