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 <vector>
#include <iostream>

const int STEP_NUM = 4;
const int STEP[STEP_NUM][STEP_NUM] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

const int MAX_SIZE = 1000;
char field[MAX_SIZE + 1][MAX_SIZE + 1];

using Position = std::pair<int,int>;

const int MAXN = 10;
Position locations[MAXN];
 
int H, W, N;

int get_shortest_distance(int current_HP)
{
	int sx = locations[current_HP-1].first;
	int sy = locations[current_HP-1].second;
	int ex = locations[current_HP].first;
	int ey = locations[current_HP].second;

	bool is_visit[MAX_SIZE + 1][MAX_SIZE + 1]={};
	is_visit[sx][sy]=true;

	std::vector<Position> frontier;
	frontier.push_back(Position{sx,sy});
	for(int step=0;step<W*H;step++)
	{
		std::vector<Position> next_frontier;
		for(auto p:frontier)
			for(int i=0;i<STEP_NUM;i++)
			{
				int nx = p.first+STEP[i][0];
				int ny = p.second+STEP[i][1];
				if(nx<0 || H<=nx) 		continue;
				if(ny<0 || W<=ny) 		continue;
				if(field[nx][ny]=='X') 	continue;
				if(is_visit[nx][ny]) 	continue;
				next_frontier.push_back(std::make_pair(nx,ny));
				is_visit[nx][ny] = true;
				if(nx==ex && ny==ey)	return step+1;
			}
		frontier = next_frontier;
	}
	return -1;
}

int solve()
{
	int total_step = 0;
	for(int i=1;i<N+1;i++)
		total_step += get_shortest_distance(i);
	return total_step;
}

int main()
{
	scanf("%d %d %d", &H, &W, &N);
	for(int i=0; i<H; i++)
		scanf("%s", field[i]);
	for(int i=0; i<H; i++)
		for(int j=0; j<W; j++)
		{
			int HP=-1;
			if(field[i][j]=='S')	HP=0;
			if(field[i][j]=='1')	HP=1;
			if(field[i][j]=='2')	HP=2;
			if(field[i][j]=='3')	HP=3;
			if(field[i][j]=='4')	HP=4;
			if(field[i][j]=='5')	HP=5;
			if(field[i][j]=='6')	HP=6;
			if(field[i][j]=='7')	HP=7;
			if(field[i][j]=='8')	HP=8;
			if(field[i][j]=='9')	HP=9;
			if(HP!=-1)
				locations[HP] = std::make_pair(i,j);
		}
	printf("%d\n", solve());
	return 0;
}

C++: #include<iostream>
#include<queue>
#include<string.h>
using namespace std;
long long  cheese[101][101];
long long check[101][101];
char num[11]={'0','1','2','3','4','5','6','7','8','9'};
int q[4]={0,1,0,-1};
int p[4]={1,0,-1,0};
struct ST {
	int a;
	int b;
	int c;
	int d;
};
int main(){
	memset(cheese,0,sizeof(cheese));
	memset(check,0,sizeof(check));
	int h,w,n;
	int i,j,m;
	int ys,xs;
	char data;
	queue <ST> Q;
	ST x;
	ST y;
	cin>>h>>w>>n;//??¢??????????????°
	for(i=1;i<=h;i++){
		for(j=1;j<=w;j++){
			cin>>data;
			if(data=='S'){//????????????
				ys=i;//??????????????§?¨?
				xs=j;
			}
			else if(data=='X'){//?????????
				cheese[i][j]=-1;
			}
			else if(data!='.'){//
				for(m=1;m<=9;m++){
					if(num[m]==data){
						cheese[i][j]=m;
					}
				}
			}
			
		}
	}
	x.a=ys;
	x.b=xs;
	x.c=0;
	x.d=1;
	Q.push(x);
	while(!Q.empty()){
		y=Q.front();
		Q.pop();
		check[y.a][y.b]=1;
		if(y.d==cheese[y.a][y.b]&&n==y.d){
			break;
		}
		if(y.d==cheese[y.a][y.b]){
			memset(check,0,sizeof(check));
			while(!Q.empty()){
				Q.pop();
			}
			y.d+=1;
			x.a=y.a;
			x.b=y.b;
			x.c=y.c;
			x.d=y.d;
			Q.push(x);
			continue;
		}
		for(i=0;i<4;i++){
			if(y.a+q[i]>0&&y.a+q[i]<=h&&y.b+p[i]>0&&y.b+p[i]<=w&&cheese[y.a+q[i]][y.b+p[i]]!=-1&&check[y.a+q[i]][y.b+p[i]]!=1){
				x.a=y.a+q[i];
				x.b=y.b+p[i];
				x.c=y.c+1;
				x.d=y.d;
				Q.push(x);
			}
		}
	}
	cout<<y.c<<endl;
	return 0;
}

C++: //??-2015-11-1
# include <cstdio>
# include <string>
# include <cstring>
# include <algorithm>
# include <iostream>
# include <queue>

using namespace std;

int direction[4][2] = { { -1, 0 }, { 1, 0 }, { 0, -1 }, {0,1} };                  //四个方向，上下左右
struct node
{
	int w, h;
	int step;
};
struct node2
{
	int h, w, value;
};
int H, W, N;
string s[1005];
int vis[1005][1005];
int cmp(node2 a, node2 b)
{
	if (a.value < b.value)
		return 1;
	else
		return 0;
}
int DFS(int begin_h, int begin_w, int end_h, int end_w)
{
	int i, j,w = 0;
	queue<node>Q;
	node temp;
	temp.h = begin_h;
	temp.w = begin_w;
	temp.step = 0;
	Q.push(temp);
	vis[begin_h][begin_w] = 1;
	while (!Q.empty())                     //?列不空的?
	{
		node temp1 = Q.front();
		Q.pop();
		//printf("%d\n", w++);
		if (temp1.h == end_h&&temp1.w == end_w)
		{
			return temp1.step;
		}
		for (i = 0; i < 4; i++)
		{
			if (temp1.h + direction[i][0] >= 0 && temp1.h + direction[i][0] < H&&temp1.w + direction[i][1] >= 0 && temp1.w + direction[i][1] < W&&!vis[temp1.h + direction[i][0]][temp1.w + direction[i][1]] && s[temp1.h + direction[i][0]][temp1.w + direction[i][1]] == '.')
			{
				node temp2;
				temp2.h = temp1.h + direction[i][0];
				temp2.w = temp1.w + direction[i][1];
				temp2.step = temp1.step + 1;
				vis[temp1.h + direction[i][0]][temp1.w + direction[i][1]] = 1;
				Q.push(temp2);
			}
		}
	}
}
int main(void)
{
	memset(vis, 0, sizeof(vis));
	int i, j,k = 1;
	int all_step = 0;
	int s_h, s_w,e_h,e_w;
	//freopen("in.txt", "r", stdin);
	scanf("%d%d%d", &H, &W, &N);
	node2 node1[20];
	for (i = 0; i < H; i++)
	{
		cin >> s[i];
		for (j = 0; j < s[i].length(); j++)
		{
			if (s[i][j] >= '0'&&s[i][j] <= '9')
			{
				node1[k].h = i;
				node1[k].w = j;
				node1[k].value = s[i][j] - '0';                //保留?
				k++;
				s[i][j] = '.';                                  //?了BFS的?候?理一致
			}
			else if (s[i][j] == 'S')                            //?始?点
			{
				s_h = i;
				s_w = j;
			}
		}
	}
		sort(node1+1, node1 + N+1, cmp);                             //先排好序
		node1[0].h = s_h;                                            //?了使下面循?一?
		node1[0].w = s_w;
		for (i = 0; i < N; i++)
		{
			e_h = node1[i+1].h;                                      //?点的坐?
			e_w = node1[i+1].w;
			s_h = node1[i].h;
			s_w = node1[i].w;
			//printf("step=%d\n", DFS(s_h, s_w, e_h, e_w));
			all_step += DFS(s_h, s_w, e_h, e_w);                       //原来的?点??起始点
			memset(vis, 0, sizeof(vis));
		}
		printf("%d\n", all_step);
	
	return 0;
}