Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Single Source Shortest Path II

For a given weighted graph $G = (V, E)$, find the shortest path from a source to each vertex. For each vertex $u$, print the total weight of edges on the shortest path from vertex $0$ to $u$.

Input

In the first line, an integer $n$ denoting the number of vertices in $G$ is given. In the following $n$ lines, adjacency lists for each vertex $u$ are respectively given in the following format:

$u$ $k$ $v_1$ $c_1$ $v_2$ $c_2$ ... $v_k$ $c_k$

Vertices in $G$ are named with IDs $0, 1, ..., n-1$. $u$ is ID of the target vertex and $k$ denotes its degree. $v_i (i = 1, 2, ... k)$ denote IDs of vertices adjacent to $u$ and $c_i$ denotes the weight of a directed edge connecting $u$ and $v_i$ (from $u$ to $v_i$).

Output

For each vertex, print its ID and the distance separated by a space character in a line respectively. Print in order of vertex IDs.

Constraints

$1 \leq n \leq 10,000$

$0 \leq c_i \leq 100,000$

$|E| < 500,000$

All vertices are reachable from vertex $0$

Sample Input 1

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

Sample Output 1

0 0
1 2
2 2
3 1
4 3

Reference

Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The MIT Press.

Solution in Ruby (judge verdict: Time Limit Exceeded)

class PriorityQueue

	def initialize size = nil
		@heap = 0
		@node = Array.new(size)
	end




	def maxHeapfy key
		left = 2 * key
		right = 2 * key + 1

		if left <= @heap && @node[left].cost < @node[key].cost
			largest = left
		else
			largest = key
		end

		largest = right	if right <= @heap && @node[right].cost < @node[largest].cost

		unless largest == key
			@node[key], @node[largest] = @node[largest], @node[key]
			maxHeapfy largest
		end
	end

	def extract!
		return Vector.new nil, nil, Float::INFINITY if @heap < 1
		maxv = @node[1]
		@node[1] = @node[@heap]
		@heap -= 1
		maxHeapfy 1
		return maxv
	end

	def increaseKey i, key
		return nil if key.cost > @node[i].cost
		@node[i] = key
		while i > 1 && @node[i / 2].cost > @node[i].cost
			@node[i], @node[i / 2] = @node[i / 2], @node[i]
			i = i / 2
		end
	end

	def insert! key
		@heap += 1
		@node[@heap] = Vector.new nil, nil, Float::INFINITY
		increaseKey @heap, key
	end

	public

	def << key
		insert! key
	end

	def pop
		extract!
	end

	def empty?
		@node.empty?
	end
end

n = gets.to_i
m = Array.new(n){Hash.new}
n.times do |i|
	s = gets.split.map(&:to_i)
	s[1].times do |j|
		m[s[0]][s[ 2 * j + 2 ]] = s[2 * j + 3]
	end
end

Vector = Struct.new(:sta, :end, :cost)
pq = PriorityQueue.new(500_001)
BLACK = 0
WHITE = 1
color = Array.new(n){WHITE}
cost = Array.new(n){Float::INFINITY}
cost[0] = 0
color[0] = BLACK
u = 0
loop{
	m[u].each_key do |key|
		pq.insert! Vector.new(u, key, cost[u] + m[u][key] ) if color[key] == WHITE
	end
	break if pq.empty? 
	vector = pq.extract!
	break if vector.cost > 150_000
	color[vector.end] = BLACK
	 cost[vector.end] = vector.cost if cost[vector.end] > vector.cost
	 u = vector.end
}
n.times do |i|
	puts "#{i} #{cost[i]}"
end