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<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
struct k{
    int nx;
    int ny;
    int power;
    int nowans;
};
int fiemin[15][1001][1001];
int main(){
    int h,w,n;
    char fie[1001][1001];
    for(int i=0;i<15;i++){
        for(int j=0;j<1001;j++){
            for(int k=0;k<1001;k++){
                fiemin[i][j][k]=2100000000;
            }
        }
    }
    int nx,ny,po,judge;
    struct k now;
    queue<k> que;
    scanf("%d %d %d",&h,&w,&n);
    for(int i=0;i<h;i++)
        scanf("%s",&fie[i]);
    for(int i=0;i<h;i++){
        for(int j=0;j<w;j++){
            if(fie[i][j]=='S'){
                now.ny=i,now.nx=j,now.power=0,now.nowans=0;
                fie[i][j]='.';
                goto a;
            }
        }
    }
a:
    que.push(now);
    for(int i=0;;i++){
        now=que.front(),que.pop();

        //printf("[%d][%d][%d][%d]\n",now.nx,now.ny,now.nowans,now.power);

        if(now.power==n){
            printf("%d\n",now.nowans);
            break;
        }
        judge=1;
        if(0<=now.ny-1){
            if(fie[now.ny-1][now.nx]==now.power+1+'0'){
                if(now.nowans+1<fiemin[now.power+1][now.ny-1][now.nx]){
                    if(judge){
                        while (!que.empty())
                            que.pop();
                        now.ny--,now.power++,now.nowans++;
                        que.push(now);
                        fiemin[now.power+1][now.ny][now.nx]=now.nowans;
                        now.ny++,now.power--,now.nowans--;
                    }
                }
            }
            else if(fie[now.ny-1][now.nx]!='X'){
                if(now.nowans+1<fiemin[now.power][now.ny-1][now.nx]){
                    if(judge){
                        now.ny--,now.nowans++;
                        que.push(now);
                        fiemin[now.power][now.ny][now.nx]=now.nowans;
                        now.ny++,now.nowans--;
                    }
                }
            }
        }
        judge=1;
        if(now.nx+1<w){
            if(fie[now.ny][now.nx+1]==now.power+1+'0'){
                if(now.nowans+1<fiemin[now.power+1][now.ny][now.nx+1]){
                    if(judge){
                        while (!que.empty())
                            que.pop();
                        now.nx++,now.power++,now.nowans++;
                        que.push(now);
                        fiemin[now.power+1][now.ny][now.nx]=now.nowans;
                        now.nx--,now.power--,now.nowans--;
                    }
                }
            }
            else if(fie[now.ny][now.nx+1]!='X'){
                if(now.nowans+1<fiemin[now.power][now.ny][now.nx+1]){
                    if(judge){
                        now.nx++,now.nowans++;
                        que.push(now);
                        fiemin[now.power][now.ny][now.nx]=now.nowans;
                        now.nx--,now.nowans--;
                    }
                }
            }
        }
        judge=1;
        if(now.ny+1<h){
            if(fie[now.ny+1][now.nx]==now.power+1+'0'){
                if(now.nowans+1<fiemin[now.power+1][now.ny+1][now.nx]){
                    if(judge){
                        while (!que.empty())
                            que.pop();
                        now.ny++,now.power++,now.nowans++;
                        que.push(now);
                        fiemin[now.power+1][now.ny][now.nx]=now.nowans;
                        now.ny--,now.power--,now.nowans--;
                    }
                }
            }
            else if(fie[now.ny+1][now.nx]!='X'){
                if(now.nowans+1<fiemin[now.power][now.ny+1][now.nx]){
                    if(judge){
                        now.ny++,now.nowans++;
                        que.push(now);
                        fiemin[now.power][now.ny][now.nx]=now.nowans;
                        now.ny--,now.nowans--;
                    }
                }
            }
        }
        judge=1;
        if(0<=now.nx-1){
            if(fie[now.ny][now.nx-1]==now.power+1+'0'){
                if(now.nowans+1<fiemin[now.power+1][now.ny][now.nx-1]){
                    if(judge){
                        while (!que.empty())
                            que.pop();
                        now.nx--,now.power++,now.nowans++;
                        que.push(now);
                        fiemin[now.power+1][now.ny][now.nx]=now.nowans;
                        now.nx++,now.power--,now.nowans--;
                    }
                }
            }
            else if(fie[now.ny][now.nx-1]!='X'){
                if(now.nowans+1<fiemin[now.power][now.ny][now.nx-1]){
                    if(judge){
                        now.nx--,now.nowans++;
                        que.push(now);
                        fiemin[now.power][now.ny][now.nx]=now.nowans;
                        now.nx++,now.nowans--;
                    }
                }
            }
        }
    }
    return 0;
}

C++: #include <cstdio>
#include <iostream>
#include <queue>
#define ROP(i,n) for(int i=0;i<n;i++)
#define ROPP(i,n) for(int i=1;i<=n;i++)
#define INF 999999999
using namespace std;
typedef pair<int,int> P;
int N,M,G,gx[10],gy[10];
char MAP[1005][1005];
int DX[4]={1,0,-1,0},DY[4]={0,1,0,-1},FAR[1005][1005];
int BFS(int u){
  queue<P> que;
  ROPP(i,N){ROPP(j,M) FAR[j][i]=INF;}
  que.push(P(gx[u],gy[u]));
  FAR[gx[u]][gy[u]]=0;
  while(que.size()){
    P p=que.front();que.pop();
    if(p.first==gx[u+1]&&p.second==gy[u+1]) break;
    ROP(i,4){
      int nx=p.first+DX[i],ny=p.second+DY[i];
      if(1<=nx&&nx<=M&&1<=ny&&ny<=N
        &&MAP[nx][ny]!='X'&&FAR[nx][ny]==INF){
        que.push(P(nx,ny));
        FAR[nx][ny]=FAR[p.first][p.second]+1;
      }
    }
  }
  return FAR[gx[u+1]][gy[u+1]];
}
void solve(){
  int res=0;
  ROP(i,G){
    res+=BFS(i);
  }
  printf("%d\n",res);
}
int main(){
  scanf("%d %d %d",&N,&M,&G);
  ROPP(i,N){
    ROP(j,M+1){
      scanf("%c",&MAP[j][i]);
      if(MAP[j][i]=='S') gx[0]=j,gy[0]=i;
      ROPP(k,G) {char l='0'+k;
      if(MAP[j][i]==l) gx[k]=j,gy[k]=i;}
    }
  }
  solve();
  return 0;
}