Go: package main

import (
	"bufio"
	"fmt"
	"io"
	"os"
	"strconv"
)

const (
	MAX_N      = 10000
	MAX_WEIGHT = 100000
)

type Edge struct {
	start  int
	end    int
	weight int
}

type ShortestInfo struct {
	edges    []Edge
	shortest int
}

func main() {
	doMain(os.Stdin)
}

func doMain(reader io.Reader) {
	sc := bufio.NewScanner(reader)
	sc.Split(bufio.ScanWords)

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	shortestList := make([]ShortestInfo, n)
	for i := 1; i < n; i++ {
		shortestList[i] = ShortestInfo{edges: []Edge{}, shortest: MAX_N*MAX_WEIGHT + 1}
	}

	adjacentMatrix, err := createAdjacentMatrix(n, sc)
	if err != nil {
		panic(err)
	}

	sssp([]int{0}, shortestList, adjacentMatrix)
	for _, v := range shortestList {
		fmt.Println(v.getEnd(), v.shortest)
	}
}

func (si ShortestInfo) getEnd() int {
	if len(si.edges) == 0 {
		return 0
	} else {
		return si.edges[len(si.edges)-1].end
	}
}

func createAdjacentMatrix(n int, sc *bufio.Scanner) ([][]int, error) {
	adjacentMatrix := make([][]int, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		adjacentMatrix[id] = make([]int, n)
		for j := 0; j < n; j++ {
			adjacentMatrix[id][j] = -1
		}
		vertexNum, err := nextInt(sc)
		if err != nil {
			return nil, err
		}
		for j := 0; j < vertexNum; j++ {
			v, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			c, err := nextInt(sc)
			if err != nil {
				return nil, err
			}
			adjacentMatrix[id][v] = c
		}
	}
	return adjacentMatrix, nil
}

func sssp(nodeStack []int, shortestList []ShortestInfo, adjacentMatrix [][]int) {
	for len(nodeStack) > 0 {
		currentNode := nodeStack[0]
		nodeStack = nodeStack[1:]
		currentShortest := getShortest(currentNode, shortestList)
		adjacents := findAdjacents(currentNode, adjacentMatrix)
		for i := 0; i < len(adjacents); i++ {
			adj := adjacents[i]
			if currentShortest.shortest+adj.weight < getShortest(adj.end, shortestList).shortest {
				setShortest(adj.end, adj, currentShortest, shortestList)
				nodeStack = append(nodeStack, adj.end)
			}
		}
	}
}

func getShortest(node int, shortestList []ShortestInfo) ShortestInfo {
	return shortestList[node]
}

func setShortest(node int, edge Edge, currentShortest ShortestInfo, shortestList []ShortestInfo) {
	newEdges := make([]Edge, len(currentShortest.edges)+1)
	for i := 0; i < len(newEdges)-1; i++ {
		newEdges[i] = currentShortest.edges[i]
	}
	newEdges[len(newEdges)-1] = edge
	shortestInfo := ShortestInfo{edges: newEdges, shortest: currentShortest.shortest + edge.weight}
	shortestList[node] = shortestInfo
}

func findAdjacents(currentNode int, adjacentMatrix [][]int) []Edge {
	adjacents := adjacentMatrix[currentNode]
	edges := []Edge{}
	for i, v := range adjacents {
		if v >= 0 {
			edges = append(edges, Edge{start: currentNode, end: i, weight: v})
		}
	}
	return edges
}

func nextInt(sc *bufio.Scanner) (int, error) {
	sc.Scan()
	return strconv.Atoi(sc.Text())
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX=100;
static const int INFTY=2000000000;
static const int WHITE=0;
static const int GRAY=1;
static const int BLACK=2;
int n;
vector<pair<int,int> > adj[MAX];
void dijkstra(){
    priority_queue<pair<int,int> >PQ;
    int d[MAX],color[MAX];
    for(int i=0;i<n;i++){
        d[i]=INFTY;
        color[i]=WHITE;
    }
    d[0]=0;
    PQ.push(make_pair(0,0));
    color[0]=GRAY;
    while(!PQ.empty()){
        pair<int,int> f=PQ.top();PQ.pop();
        int u=f.second;
        color[u]=BLACK;
        if(d[u]<f.first*(-1))continue;
        for(int j=0;j<adj[u].size();j++){
            int v=adj[u][j].first;
            if(color[v]==BLACK)continue;
            if(d[v]>d[u]+adj[u][j].second){
                d[v]=d[u]+adj[u][j].second;
                PQ.push(make_pair(d[v]*(-1),v));
                color[v]=GRAY;
            }
        }
    }
    for(int i=0;i<n;i++)
        cout<<i<<" "<<(d[i]==INFTY?-1:d[i])<<"\n";
}
int main(){
    int k,u,v,c;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>u>>k;
        for(int j=0;j<k;j++){
            cin>>v>>c;
            adj[u].push_back(make_pair(v,c));
        }
    }
    dijkstra();
    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<queue>

using namespace std;

// 0-origin
#define MAX 10000
#define INF 500001
#define WHITE 0
#define GRAY 1
#define BLACK 2

int n;
int M[MAX][MAX]; // 隣接行列
vector< pair<int, int> > adj[MAX]; // 重み付き有向グラフの隣接リスト

// O(|V|^2)
void dijkstra(int start){
    int i, u, v;
    int d[MAX]; // 最短経路のコスト
    int p[MAX]; // 最短経路木における親
    int color[MAX]; // S : GRAY  uに隣接かu自身 : BLACK  S-V : WHITE
    
    //init
    for (i = 0; i < n; i++) {
        d[i] = INF;
        color[i] = WHITE;
    }
    d[start] = 0;
    p[start] = -1;
    
    int mincost;
    while (1) {
        mincost = INF;
        for (i = 0; i < n; i++) {
            if (color[i] != BLACK && d[i] < mincost) {
                mincost = d[i];
                u = i;
            }
        }
        
        if (mincost == INF) {
            break;
        }
        
        color[u] = BLACK;
        /*printf("u:%d\n",u);
        for (i = 0; i < n; i++) {
            printf("%d:%s\n", i, color[i] == 1 ? "WHITE" : color[i] == 0 ? "GRAY" : "BLACK");
        }
         printf("\n");*/
        
        // BLACKのノードから隣接してるノードの最短距離を更新しGRAYにする
        for (v = 0; v < n; v++) {
            if (color[v] != BLACK && M[u][v] != INF) {
                if (d[u] + M[u][v] < d[v]) {
                    d[v] = d[u] + M[u][v];
                    p[v] = u;
                    color[v] = GRAY;
                }
            }
        }
        /*for (i = 0; i < n; i++) {
            printf("%d:%s\n", i, color[i] == WHITE ? "WHITE" : color[i] == GRAY ? "GRAY" : "BLACK");
        }*/
    }
    
    for (i = 0; i < n; i++) {
        printf("%d %d\n", i, d[i]);
    }
}



// O((|V|+|E|)log|V|)
void dijkstra2(int start){
    priority_queue< pair<int, int> > PQ; // pair.firstの値が大きい順に先頭から並ぶ？ first->d, second->ノード番号
    int i,j;
    int color[MAX];
    int d[MAX]; // 最短経路のコスト
    
    // init
    for (i = 0; i < n; i++) {
        d[i] = INF;
        color[i] = WHITE;
    }
    d[start] = 0;
    PQ.push(make_pair(d[start], start));
    color[start] = GRAY;
    
    pair<int, int> f;
    int u;
    while (!PQ.empty()) {
        f = PQ.top();
        PQ.pop();
        u = f.second;
        color[u] = BLACK;
        
        if ( d[u] < f.first*(-1) ) {
            continue;
        }
        
        for (j = 0; j < adj[u].size(); j++) {
            int v = adj[u][j].first; // uとつながっているノードの番号
            if (color[v] == BLACK) {
                continue;
            }
            if (d[u] + adj[u][j].second < d[v]) {
                d[v] = d[u] + adj[u][j].second;
                PQ.push(make_pair(d[v] * (-1), v));
                color[v] = GRAY;
            }
        }
    }
    
    for (int i = 0; i < n; i++) {
        printf("%d %d\n", i, d[i]);
    }
    
}



int main(){
    int i,j,m,l,k;
    
    scanf("%d", &n);
#ifdef d1
    // MをすべてINFに初期化
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            M[i][j] = INF;
        }
    }
    
    // read
    for (i = 0; i < n; i++) {
        scanf("%d %d", &m, &m);
        for (j = 0; j < m; j++) {
            scanf("%d", &l);
            scanf("%d", &M[i][l]);
        }
    }
    /*
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            printf("%d ", M[i][j]);
        }
        printf("\n");
    }*/
    
    dijkstra1(0);
#else
    for (i = 0; i < n; i++) {
        scanf("%d %d", &m, &m);
        for (j = 0; j < m; j++) {
            scanf("%d %d", &l, &k);
            adj[i].push_back(make_pair(l, k));
        }
    }
    
    dijkstra2(0);
#endif
    
    return 0;
}