Go: ///
// File:  0558.go
// Author: ymiyamoto
//
// Created on Sun Mar  4 20:58:45 2018
//
package main

import (
	"fmt"
	"strconv"
	"strings"
)

type pos struct {
	x, y int
}

var H, W, N int
var graph [][]string

func wfs(p pos, index int) (int, pos) {
	var q []pos
	dists := make([][]int, H)
	for i := range dists {
		dists[i] = make([]int, W)
	}

	q = append(q, p)
	for len(q) > 0 {
		p := q[0]
		dist := dists[p.x][p.y]
		q = q[1:]

		for _, d := range []pos{{-1, 0}, {1, 0}, {0, -1}, {0, 1}} {
			x := p.x + d.x
			y := p.y + d.y
			if 0 <= x && x < H && 0 <= y && y < W && graph[x][y] != "X" && dists[x][y] == 0 {
				dists[x][y] = dist + 1
				q = append(q, pos{x, y})
			}
		}
	}

	for i := range graph {
		for j := range graph[i] {
			if graph[i][j] == strconv.Itoa(index) {
				return dists[i][j], pos{i, j}
			}
		}
	}

	panic("not found")
}

func main() {
	fmt.Scan(&H, &W, &N)

	var start pos

	graph = make([][]string, H)
	for i := range graph {
		var s string
		fmt.Scan(&s)
		graph[i] = strings.Split(s, "")
		for j := range graph[i] {
			if graph[i][j] == "S" {
				start.x = i
				start.y = j
			}
		}
	}

	count := 0
	for i := 1; i <= N; i++ {
		c, s := wfs(start, i)
		start = s
		count += c
	}

	fmt.Println(count)
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <functional>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define INF 100000000
template<class T, class C> void chmax(T& a, C b) { a>b ? : a = b; }
template<class T, class C> void chmin(T& a, C b) { a<b ? : a = b; }

int h, w, n;
char c[1005][1005];
int chx[15] = { 0 }, chy[15] = { 0 }, dx[] = { 0,1,0,-1 }, dy[] = { 1,0,-1,0 }, d[1005][1005] = { 0 };
typedef pair<int, int>P;

int bfs(int sx,int sy,int gx,int gy) {
	for (int i = 0; i < 1005; i++) {
		for (int j = 0; j < 1005; j++) {
			d[i][j] = -1;
		}
	}
	queue<P>que;
	que.push(P(sx, sy));
	d[sx][sy] = 0;
	while (que.size()) {
		P p = que.front();
		que.pop();
		int nowx = p.first;
		int nowy = p.second;
		//cout << nowx << " " << nowy << endl;
		if (nowx == gx&&nowy == gy) break;
		for (int i = 0; i < 4; i++) {
			int nx = nowx + dx[i];
			int ny = nowy + dy[i];
			if (d[nx][ny]==-1&&0 <= nx&&nx < h && 0 <= ny&&ny < w&&c[nx][ny]!='X') {
				d[nx][ny] = d[nowx][nowy] + 1;
				que.push(P(nx, ny));
			}
		}
	}
	return d[gx][gy];
}

int main() {
	cin >> h >> w >> n;
	for (int i = 0; i < h; i++) {
		for (int j = 0; j < w; j++) {
			cin >> c[i][j];
			if (c[i][j] == 'S') {
				chx[0] = i;
				chy[0] = j;
			}
			else if ('1' <= c[i][j] && c[i][j] <= '9') {
				int number = c[i][j] - '0';
				chx[number] = i;
				chy[number] = j;
			}
		}
	}
	int cnt = 0;
	for (int i = 0; i <= n - 1; i++) {
		cnt += bfs(chx[i], chy[i], chx[i + 1], chy[i + 1]);
	}
	cout << cnt << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
    int Y, X, n;
    int x[10];
    int y[10];
    int ans = 0;
    cin >> Y >> X >> n;
    string a[Y];
    for(int i = 0; i < Y; i++) {
        cin >> a[i];
    }
    int step[Y + 2][X + 2];

    for(int i = 0; i < X + 2; i++) {
        step[0][i] = -2;
    }
    for(int i = 1; i <= Y; i++) {
        step[i][0] = -2;
        for(int j = 1; j <= X; j++) {
            step[i][j] = -1;
            if(a[i - 1][j - 1] == 'S') {
                x[0] = j;
                y[0] = i;
                step[i][j] = 0;
            }
            if(a[i - 1][j - 1] == '.') {
                step[i][j] = -1;
            }
            if(a[i - 1][j - 1] == 'X') {
                step[i][j] = -2;
            }
            if(a[i - 1][j - 1] == '1') {
                x[1] = j;
                y[1] = i;
            }
            if(a[i - 1][j - 1] == '2') {
                x[2] = j;
                y[2] = i;
            }
            if(a[i - 1][j - 1] == '3') {
                x[3] = j;
                y[3] = i;
            }
            if(a[i - 1][j - 1] == '4') {
                x[4] = j;
                y[4] = i;
            }
            if(a[i - 1][j - 1] == '5') {
                x[5] = j;
                y[5] = i;
            }
            if(a[i - 1][j - 1] == '6') {
                x[6] = j;
                y[6] = i;
            }
            if(a[i - 1][j - 1] == '7') {
                x[7] = j;
                y[7] = i;
            }
            if(a[i - 1][j - 1] == '8') {
                x[8] = j;
                y[8] = i;
            }
            if(a[i - 1][j - 1] == '9') {
                x[9] = j;
                y[9] = i;
            }
        }
        step[i][X + 1] = -2;
    }
    for(int i = 0; i < X + 2; i++) {
        step[Y + 1][i] = -2;
    }

    queue<pair<int, int> > q;

    q.push(make_pair(y[0], x[0]));

    for(int i = 0; i < n; i++) {
        while(q.empty() == false) {
            if(q.front().first == y[i + 1] && q.front().second == x[i + 1]) {
                ans += step[y[i + 1]][x[i + 1]];
                for(int j = 1; j <= Y; j++) {
                    for(int k = 1; k <= X; k++) {
                        if(step[j][k] != -2)
                            step[j][k] = -1;
                    }
                }
                step[y[i + 1]][x[i + 1]] = 0;
                while(!q.empty()) {
                    q.pop();
                }
                q.push(make_pair(y[i + 1], x[i + 1]));
                break;
            }
            if(step[q.front().first + 1][q.front().second] == -1) {
                step[q.front().first + 1][q.front().second] =
                    step[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first + 1, q.front().second));
            }
            if(step[q.front().first - 1][q.front().second] == -1) {
                step[q.front().first - 1][q.front().second] =
                    step[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first - 1, q.front().second));
            }
            if(step[q.front().first][q.front().second + 1] == -1) {
                step[q.front().first][q.front().second + 1] =
                    step[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first, q.front().second + 1));
            }
            if(step[q.front().first][q.front().second - 1] == -1) {
                step[q.front().first][q.front().second - 1] =
                    step[q.front().first][q.front().second] + 1;
                q.push(make_pair(q.front().first, q.front().second - 1));
            }
            for(int j = 1; j <= Y; j++) {
                for(int k = 1; k <= X; k++) {
                    if(step[j][k] > -1)
                        cout << " ";
                    cout << step[j][k] << " ";
                }
                cout << endl;
            }
            cout << endl;
            q.pop();
        }
    }
    cout << ans << endl;
    return 0;
}