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>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> P;
map <int,int> mp;
vector<int> V;
#define INF (1<<30)
#define INFLL (1ll<<60)
#define EPS (1e-10)
static const int MAX=1e5;
static const int MOD=1e9+7;
static const int NMAX=50;
static const int MMAX=50;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};
static const int WHITE = 0;
static const int GRAY = 1;
static const int BLACK = 2;

int N;
int d[MAX];
vector<P> adj[MAX]; //<隣接地点,その地点の最短距離>
void dijkstra(int s){
    priority_queue<P> PQ; //<最短距離*-1,場所>
    int color[MAX];
    for(int i=0;i<N;i++){
        d[i]=INF;
        color[i]=WHITE;
    }
    
    d[s]=0;
    PQ.push(make_pair(0,0));
    color[0]=GRAY;
    
    while(!PQ.empty()){
        P 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; //uのj番目の隣接地点のインデックス
            if(color[v]==BLACK) continue; //もう行った
            if(d[v]<=d[u]+adj[u][j].second)continue;//vにはもっと早い行き方がある
            d[v]=d[u]+adj[u][j].second;
            PQ.push(make_pair(d[v]*(-1),v));
            color[v]=GRAY;
        }
        
    }
}


int main(){
    cin.tie(0);  ios::sync_with_stdio(false);
    
    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(0);
    for(int i=0;i<N;i++)
        cout<<i<<" "<<(d[i]==INF?-1:d[i])<<"\n";
    
    return 0;
}

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

using weight = int;

struct edge {
    int to;
    weight cost;
};

using edges = std::vector<edge>;
using graph = std::vector<edges>;

// when g has neg cycle, second -> false
std::pair<std::vector<weight>, bool> spfa(graph const& g, int s) {
    constexpr weight inf = std::numeric_limits<weight>::max() / 2;
    const int n = g.size();
    std::vector<weight> d(n, inf);
    std::vector<int> in_q(n), count(n);
    std::queue<int> que;
    d[s] = 0;
    que.emplace(s);
    in_q[s] = true;
    ++count[s];
    bool neg_cycle = false;
    [&]() {
        while(!que.empty()) {
            int v = que.front();
            que.pop();
            in_q[v] = false;
            for(auto& e : g[v]) {
                if(d[v] != inf && d[e.to] > d[v] + e.cost) {
                    d[e.to] = d[v] + e.cost;
                    if(!in_q[e.to]) {
                        que.emplace(e.to);
                        in_q[e.to] = true;
                        ++count[e.to];
                        if(count[e.to] >= n) {
                            neg_cycle = true;
                            return;
                        }
                    }
                }
            }
        }
    }();

    return std::make_pair(d, !neg_cycle);
}

using namespace std;

int main() {
    int n;
    cin >> n;
    graph g(n);
    for(int i = 0; i < n; ++i) {
        int u, k;
        cin >> u >> k;
        for(int j = 0; j < k; ++j) {
            int v, c;
            cin >> v >> c;
            g[u].push_back(edge{v, c});
        }
    }

    auto ans = spfa(g, 0).first;
    for(int i = 0; i < n; ++i) {
        cout << i << ' ' << ans[i] << endl;
    }
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
const int maxx=10010;
const int infinity=1<<30;

int main() {
	int n,a,b,c,e;
	vector<pair<int, int> > A[maxx];
	bool flag[maxx];
	int d[maxx];
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a>>b;
		for(int j=0;j<b;j++){
			cin>>c>>e;
			A[a].push_back(make_pair(c,e));
		}
	}
	for(int i=0;i<n;i++){
		flag[i]=false;
		d[i]=infinity;
	}
	priority_queue<pair<int,int> > PQ;
	d[0]=0;
	PQ.push(make_pair(0, 0));
	while(PQ.empty()==0){
		pair<int, int> u=PQ.top();
		PQ.pop();
		//cout<<u.first<<" "<<d[u.first]<<endl;
		flag[u.second]=true;
		int len=A[u.second].size();
		for(int i=0;i<len;i++){
			int v=A[u.second][i].first;
			if(flag[v]==false && d[u.second]+A[u.second][i].second<d[v]){
				d[v]=d[u.second]+A[u.second][i].second;
				PQ.push(make_pair(d[v]*(-1),v));
			}
		}
	}

	for(int i=0;i<n;i++) cout<<i<<" "<<(d[i]==infinity ? -1 : d[i])<<endl;

	return 0;
}