Go: // ダイクストラのアルゴリズム
package main

import (
	"bufio"
	"fmt"
	"log"
	"math"
	"os"
	"strconv"
	"strings"
)

type color int

const (
	white color = iota // 未訪問
	mst                // MSTとして確定
)

// 頂点
type node struct {
	num     int         // 頂点の番号
	weights map[int]int // 重みMAP
	parent  *node       // MSTへの重み最小の親
	sum     int         // 始点からの距離
	color   color
}

func (p *node) getMinToMst() int {
	if p.parent == nil {
		return math.MaxInt32
	}
	return p.weights[p.parent.num]
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	n := eGetInt(scanner)

	nodes := make([]*node, n)
	for i := 0; i < n; i++ {
		weights := eAtoi((strings.Fields(eGetline(scanner))))
		v := &node{weights[0], make(map[int]int, weights[1]), nil, 0, white}
		for j := 0; j < weights[1]; j++ {
			k := weights[j*2+2] // 相手の頂点名
			w := weights[j*2+3] // 重み
			v.weights[k] = w
		}
		nodes[i] = v
	}

	// 初回はnode[0]がMSTに入るように
	nodes[0].parent = nodes[0]

	for { // 全部チェックするまで

		// どの頂点を新たにMSTに取り込むか

		var minNode *node
		min := math.MaxInt32
		for _, v := range nodes {
			if v.color == mst {
				continue
			}
			if v.getMinToMst() < min {
				min = v.getMinToMst()
				minNode = v
			}
		}
		if minNode == nil {
			// すべて完了している.
			break
		}

		// MSTに追加する頂点決定
		minNode.color = mst
		// 自分の親の合計値と合算する
		minNode.sum = minNode.parent.sum + min

		// MSTに属していない頂点それぞれについて,MSTとの最小の重みの距離を加算
		for _, v := range nodes {
			if v.color == mst {
				continue
			}
			w, ok := v.weights[minNode.num]
			if !ok {
				// minNodeと接してない
				continue
			}

			if w < v.getMinToMst() {
				// minNodeへの距離がもっとも重みが少ないので親を変更
				v.parent = minNode
			}
		}
	}

	for i, v := range nodes {
		fmt.Printf("%d %d\n", i, v.sum)
	}
}

func eGetInt(scanner *bufio.Scanner) int {
	t := eAtoi(strings.Fields(eGetline(scanner)))
	return t[0]
}

func eGetline(p *bufio.Scanner) string {
	if !p.Scan() {
		if err := p.Err(); err != nil {
			log.Fatal(err.Error())
		}
		return ""
	}
	return p.Text()
}

func eAtoi(s []string) []int {
	ints := make([]int, len(s))
	var err error
	for i, e := range s {
		ints[i], err = strconv.Atoi(e)
		if err != nil {
			log.Fatal(err.Error())
		}
	}
	return ints
}

C++: #include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE =0;
static const int GRAY =1;
static const int BLACK = 2;

int n, N[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];
  int i=0;

  for(i=0;i<n;i++)
    {
      d[i]=INFTY;
      color[i]=WHITE;
    }

  d[0] = 0;
  color[0]=GRAY;
  while(1)
    {
      minv = INFTY;
      int u =-1;
      int v=0;
      
      for(int i = 0; i<n ; i++)
	{
	  if(minv>d[i]&&color[i]!=BLACK)
	    {
	      u=i;
	      minv = d[i];
	    }
	}
      if(u==-1)
	{
	  break;
	}
      color[u]=BLACK;
      for(v=0;v<n;v++)
	{
	  if(color[v]!=BLACK && N[u][v]!=INFTY)
	    {
	    if(d[v]>d[u] +N[u][v])
	      {
		d[v]=d[u]+N[u][v];
		color[v]= GRAY;
	      }
	    }
	}
    }
  for(i=0;i<n;i++)
    {
      cout << i << " "<<(d[i] == INFTY ? -1 : d[i])<<endl;
    }
}

int main()
{
  cin>> n;
  int i=0;
  int j=0;
  for(i=0;i<n;i++)
    {
      for(j=0;j<n;j++)
	{
	  N[i][j]=INFTY;
	}
    }

  int k,c,u,v;
  for(i=0;i<n;i++)
    {
      for(j=0;j<n;j++)
	{
	  N[i][j] =INFTY;
	}
    }

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

  dijkstra();

  return 0;
}

C++: #include<iostream>
using namespace std;
static const int MAX = 100;
static const int INFTY = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n,M[MAX][MAX];

void dijkstra(){
  int minv;
  int d[MAX],color[MAX];

  for(int i = 0;i < n;i++){
   d[i] = INFTY;
   color[i] = WHITE;
 }
  
   d[0] = 0;
   color[0] = GRAY;
   while( 1 ){
    minv = INFTY;
    int u = -1;
    for ( int i = 0; i < n; i++){
      if(minv > d[i] && color[i] != BLACK){
       u = i;
       minv = d[i];
      }
   }
    if(u == -1) break;
    color[u] = BLACK;
    for ( int v = 0; v < n; v++){
     if(color[v] != BLACK && M[u][v] != INFTY){
       if(d[v] > d[u] + M[u][v]){
       d[v] = d[u] + M[u][v];
       color[v] = GRAY;
        }
       }
     }
  }
       
      
   
   for(int i = 0; i < n; i++){
    cout << i << " " << (d[i] == INFTY ? -1: d[i]) <<endl;
   }
  }
int main(){
  cin >> n;
  for(int i = 0;i < n; i++){
    for(int j = 0; j < n; j++){
     M[i][j] = INFTY;
     }
   }

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

  M[u][v] = c;
  }
 }
  dijkstra();
   return 0;
}

C++: #include<iostream>
#include<vector>

struct Edge {
	int to, weight;
};

int main()
{
	int n, u, k, v, c, distance[100]{}, upd_num = 1;
	bool must_update[100]{ 1 };
	std::vector<Edge> dest[100];

	std::cin >> n;
	for (int i = 0; i < n; ++i)
	{
		std::cin >> u >> k;
		for (int j = 0; j < k; ++j)
		{
			std::cin >> v >> c;
			dest[u].push_back({ v, c });
		}
		if (i)
			distance[i] = 2000000000;
	}

	while (upd_num)
	{
		for (int i = 0; i < n; i++)
		{
			if (!must_update[i]) continue;

			must_update[i] = false;
			upd_num--;
			for (auto e : dest[i])
			{
				int tmp = distance[i] + e.weight;
				if (tmp < distance[e.to])
				{
					distance[e.to] = tmp;
					must_update[e.to] = true;
					upd_num++;
				}
			}
		}
	}

	for (int i = 0; i < n; i++)
	{
		std::cout << i << " " << distance[i] << std::endl;
	}

	return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <list>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <iomanip>
#define INF 214748364
 
using namespace std;

#define MAX_V 101

int d[MAX_V][MAX_V];  // d[u][v]は辺e=(u,v)のコスト(存在しない場合はINF、ただしd[i][i]=0とする)
int V;                // 頂点数
void warshall_floyd(int n) {
	V = n;

	for (int k = 0; k < V; k++)
		for (int i = 0; i < V; i++)
			for (int j = 0; j < V; j++) 
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}

int main(void)
{
	int n, u, v, k, c;

	cin >> n;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			if (i == j) d[i][j] = 0; 
			else d[i][j] = INF;

		}
	}

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

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


	return (0);
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef float fl;
typedef long long ll;

static const int MAX = 100;
static const int INF = (1<<21);
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int n, M[MAX][MAX];

void dijkstra() {
    int minv;
    int d[MAX], color[MAX];

    rep(i,n) {
        d[i] = INF;
        color[i] = WHITE;
    }

    d[0] = 0;
    color[0] = GRAY;
    // 最短経路の候補の中で最小の頂点を選ぶ
    while(1){
        minv = INF;
        int u = -1;
        rep(i,n) {
            if (minv > d[i] && color[i] != BLACK) {
                u = i;
                minv = d[i];
            }
        }
        if (u == -1) break;
        color[u] = BLACK;

    // 次の最短経路の頂点を見つける
        rep(v,n) {
            if (color[v] != BLACK && M[u][v] != INF){
                if (d[v] > d[u] + M[u][v]) {
                    d[v] = d[u] + M[u][v];
                    color[v] = GRAY;
                }
            }
        }
    }
    rep(i,n){
        cout << i << " " << ((d[i] == INF)? -1 : d[i]) << endl;
    }
}

int main(){
    cin >> n;
    rep(i,n){
        rep(j,n) M[i][j] = INF;
    }

    int k, c, u, v;
    rep(i,n){
        cin >> u >> k;
        rep(j,k){
            cin >> v >> c;
            M[u][v] = c;
        }
    }
    dijkstra();
    return 0;
}