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

    queue<pair<int, int> > q;

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

C++: #include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
struct mouse{
	int x;
	int y;
	int cnt;
};
int used[1000][1000]={0};
char map[1000][1000];
int maps[1000][1000]={0};
int main(){
	int h,w,n,p=1,i,j,fx,fy,k;
	int mx[4]={-1,0,1,0};
	int my[4]={0,-1,0,1};
	char num[11]="0123456789";
	queue<mouse> m;
	mouse v,u;
	scanf("%d %d %d",&h,&w,&n);
	for(i=0;i<h;i++){
		for(j=0;j<w;j++){
			cin>>map[i][j];
			if(map[i][j]=='S'){
				v.x=j;
				v.y=i;
			}
			for(k=0;k<10;k++){
				if(num[k]==map[i][j]){
					maps[i][j]=k;
				}
			}
		}
	}
	v.cnt=0;
	m.push(v);
	while(1){
		v=m.front();
		m.pop();
		if(used[v.y][v.x]==1){
			continue;
		}
		
		else{
			used[v.y][v.x]=1;
		}
		if(maps[v.y][v.x]==p){
			if(p==n){
				break;
			}
			memset(used,0,sizeof(used));
			while(!m.empty()){
				m.pop();
			}
			p++;
			m.push(v);
			continue;
		}
		for(i=0;i<4;i++){
			if((v.x+mx[i])>=0&&(v.x+mx[i])<w&&(v.y+my[i])>=0&&(v.y+my[i])<h){
				u=v;
				u.x=v.x+mx[i];
				u.y=v.y+my[i];
				if(map[u.y][u.x]!='X'){
					u.cnt++;
					m.push(u);
				}
			}
		}
	}
	printf("%d\n",v.cnt);
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

typedef vector<int> vec;
typedef vector<vec> mat;
typedef pair<int,int> P;

int main() {
    int H, W, N;
    cin >> H >> W >> N;
    vector<string> fd(H);
    for (auto& i : fd) cin >> i;

    vec objx(N+1), objy(N+1);
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            if (fd[i][j] == 'S') objx[0] = i, objy[0] = j;
            else if ('0' <= fd[i][j] && fd[i][j] <= '9') {
                int num = fd[i][j] - '0';
                objx[num] = i;
                objy[num] = j;
            }
        }
    }

    int ans = 0;

    for (int i = 0; i < N; i++) {
        queue<P> que;
        que.push(P(objx[i], objy[i]));

        int INF = 1<<28;
        int dx[] = {0,1,-1,0};
        int dy[] = {1,0,0,-1};
        mat dp(H, vec(W, INF));
        dp[objx[i]][objy[i]] = 0;
        while (que.size()) {
            P p = que.front(); que.pop();
            int x = p.first;
            int y = p.second;

            for (int j = 0; j < 4; j++) {
                int nx = x + dx[j];
                int ny = y + dy[j];

                if (0 <= nx && nx < H && 0 <= ny && ny < W && fd[nx][ny] != 'X') {
                    if (dp[nx][ny] > dp[x][y] + 1) {
                        dp[nx][ny] = dp[x][y] + 1;
                        que.push(P(nx,ny));
                    }
                }
            }
        }

        ans += dp[objx[i+1]][objy[i+1]];
    }

    cout << ans << endl;

    return 0;
}