Go: package main

import (
	"bufio"
	"fmt"
	"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() {
	sc := bufio.NewScanner(os.Stdin)
	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.Printf("%d %d\n", 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<cstring>
using namespace std;

#define maxn 110
#define INFTY (1<<30)
#define WHITE 0
#define GRAY 1 //在本题中，这个可以去掉，无关紧要
#define BLACK 2
int n,m[maxn][maxn];

void dijkstra(int s) //从s开始求最短路径
{
    int minv,u;
    int d[maxn],p[maxn],color[maxn]; //在本题中，p数组起不到什么作用，可以去掉
    for(int i=0;i<n;i++) //初始化
    {
        d[i]=INFTY;
        p[i]=-1;
        color[i]=WHITE;
    }
    d[s]=0;

    while(1)
    {
        minv=INFTY;
        u=-1;

        for(int i=0;i<n;i++) //寻找最小顶点
        {
            if(color[i]!=BLACK&&d[i]<minv) //类似prim算法
            {
                minv=d[i];
                u=i;
            }
        }
        if(u==-1) break;
        color[u]=BLACK;

        for(int v=0;v<n;v++)
        {
            if(color[v]!=BLACK&&m[u][v]!=INFTY) //注意这里与prim算法的细微差别
            {
                if(d[u]+m[u][v]<d[v])
                {
                    d[v]=d[u]+m[u][v];
                    p[v]=u;
                    color[v]=GRAY;
                }
            }
        }
    }

    for(int i=0;i<n;i++)
        cout<<i<<" "<<d[i]<<endl;
}

int main()
{
    int k,u,v,c;
    cin>>n;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            m[i][j]=INFTY;

    for(int i=0;i<n;i++)
    {
        cin>>u>>k;
        for(int j=0;j<k;j++)
        {
            cin>>v>>c;
            m[u][v]=c;
        }
    }
    dijkstra(0);
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

#define llong long long 
typedef struct data{
	vector<int> way;
	vector<int> waycost;
	int useway;
	int cost;
}data;

data d[10001];

void solve(int N, int before){
	vector<int> nsolve;
	for(int i = 0; i < d[N].way.size(); i++){
		int nway = d[N].way[i];
		if(d[N].cost + d[N].waycost[i] < d[nway].cost){
			d[nway].cost = min(d[d[N].way[i]].cost, d[N].cost + d[N].waycost[i]);
			d[nway].useway = N;
			nsolve.push_back(nway);
		}
	}
	for(int i = 0; i < nsolve.size(); i++){
		solve(nsolve[i],0);
	}
}

int main(){
	int hownum;
	cin >> hownum;
	for(int i = 0; i < hownum; i++){
		int num;
		int howway;
		cin >> num >> howway;
		for(int j = 0; j < howway; j++){
			int w,c;
			cin >> w >> c;
			d[num].way.push_back(w);
			d[num].waycost.push_back(c);
		}

		if(num == 0) d[num].cost = 0;
		else d[num].cost = 10000000;
	}

	for(int i = 0; i < hownum; i++){
		solve(i, -1);
	}
	
	for(int i = 0; i < hownum; i++){
		cout << i << " " << d[i].cost << endl;
	}
	return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
static const int MAX = 10000;
static const int INFTY = (1<<20);
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 color[MAX];
  int d[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]) << endl;
  }
}

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<iostream>
using namespace std;
#include<queue>
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
bool b[2003];

#define REP(i, a) for(int i=0;i<a;i++)
	int N=1000000;
int main()
{
	int min,b,a,k,m[101][101],n ,e,p[101],d[101],u,v; //u ?????????v????????¨
	bool color[101];
	cin>>n;
	REP(i, n) {
		REP(j, n) {
		m[i][j]=N;
		}
	}
	REP(i, n) {
		cin>>u>>k;
		REP(i, k) {
			cin>>a>>b;
			m[u][a]=b;
			if(m[u][a]==-1) m[u][a]=N;
		}
		color[i]=0;
		d[i]=N;
	}
	a=0;
	d[0]=0;
	while(1){
		min=N;
		u=-1;
		REP(i,n){
			if(min>d[i]&&color[i]==0){
				min=d[i];
				u=i;
			}
		}
		if(u==-1) break;
		color[u]=1;
		REP(i,n){
			if(color[i]==0&&m[u][i]!=N){
				if(d[i]>m[u][i]+d[u]){
					d[i]=m[u][i]+d[u];
				}
			}
		}

	}
	min=0;
	REP(i,n){
		cout<<i<<" "<<(d[i] == N ? -1 : d[i])<<endl;
	
	}
	return 0;
}