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<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i) 
#define PI acos(-1)

using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin>>n;
    vector<vector<P>> adj(n);
    rep(i, n) {
        int u, k, v, c;
        cin>>u>>k;
        rep(j, k) {
            cin>>v>>c;
            adj[u].push_back(P(c, v));
        }
    }

    priority_queue<P, vector<P>, greater<P>> q;
    vector<int> wmap(n, -1);
    q.push(P(0, 0));
    while (!q.empty()) {
        P p = q.top(); q.pop();
        int w = p.first;
        int v = p.second;
        if (wmap[v] != -1) continue;

        wmap[v] = w;
        for (auto e : adj[v]) {
            q.push(P(e.first + w, e.second));
        }
    }

    rep(i, n) cout<<i<<" "<<wmap[i]<<endl;
}

C++: #include<iostream>
#include<queue>
#include<vector>
using namespace std;
#define MAX 10000
#define Infinit 1e+10
#define White 0
#define Black 1
#define Red 2
int n;
vector<pair<int, int> >Relate[MAX];
struct Node{
	int id;
	int weight;

	Node(int inputted_id, int inputted_weight){
		id = inputted_id;
		weight = inputted_weight;
	}
	bool operator<(const Node& another) const{
		return weight < another.weight;
	};
	//2つのconstを付けないとコンパイルエラーになるので注意!!
};
void search() {
	int color[MAX],d[MAX],pointer;
	priority_queue<Node> path;
	for (int i = 0; i < n; i++) {
		if (i == 0) d[i] = 0;
		else d[i] = Infinit;
		color[i] = White;
	}
	path.push(Node(0, 0));
	while (!path.empty()) {
		Node x = path.top();
		pointer=x.id;
		color[pointer] = Black;
		for (int i = 0; i < Relate[pointer].size(); i++) {
			int v = Relate[pointer][i].first;
			if (d[pointer] + Relate[pointer][i].second < d[v] && color[v] != Black) {
				d[v] = d[pointer] + Relate[pointer][i].second;
				color[v] = Red;
				path.push(Node(v,d[v]*(-1)));

			}
		}
		path.pop();
	}
	for (int i = 0; i < n; i++) {
		cout << i << " " << d[i] << endl;
	}
}
int main() {
	int u, k, v, c;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			cin >> v >> c;
			Relate[u].push_back(make_pair(v, c));

		}
	}
	search();

}

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>
#include <algorithm>
#include <queue>
using namespace std;
static const int MAX = 10000;
static const int MIN = 10000000;
static const int WH = 0;
static const int GR = 1;
static const int BL = 2;

int n;
vector<pair<int,int> > ad[MAX];

void dijkstra(void){
  priority_queue<pair<int,int> > PQ;
  int color[MAX],d[MAX],i,j,v;
  for(i=0;i<n;i++){
    d[i]=MIN;
    color[i]=WH;
  }
  d[0]=0;
  PQ.push(make_pair(0,0));
  color[0]=GR;

  while(!PQ.empty()){
    pair<int,int> f=PQ.top(); PQ.pop();
    int u=f.second;
    color[u]=BL;
    if(d[u]<f.first*(-1))continue;
    for(j=0;j<ad[u].size();j++){
      v=ad[u][j].first;
      if(color[v]==BL) continue;
      if(d[v]>d[u]+ad[u][j].second){
	d[v]=d[u]+ad[u][j].second;
	PQ.push(make_pair(d[v]*(-1),v));
	color[v]=GR;
      }
    }
  }
  for(i=0;i<n;i++) cout<< i << " " << (d[i]==MIN ? -1:d[i]) << endl;
}

int main(void){
  int i,j,m,l,k,c;

  cin>>n;
  for(i=0;i<n;i++){
    cin>> m >> l;
    for(j=0;j<l;j++){
      cin >> k >> c;
      ad[m].push_back(make_pair(k,c));
    }
  }
  dijkstra();
  return 0;
}