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<cmath>
#include<vector>
#include<queue>
#include<iostream>
#include<algorithm>
#define debug(ARGS) cout << #ARGS << ": " << ARGS << endl;
#define ll long long

#define INF (int)1e7
#define p pair<int, int>
#define F 0
#define X -1
#define S -2

using namespace std;

int convert(char c){
  int ret;

  if('1' <= c && c <= '9') ret = c - '1' + 1;
  else if(c == '.') ret = F;
  else if(c == 'X') ret = X;
  else if(c == 'S') ret = S;
  else ret = -3;

  return ret;
}

p find_nest(vector< vector<int> > &v, int num){
  int h = v.size(), w = v[0].size();
  p ret;
  
  for(int i = 0; i < h; i++)
    for(int j = 0; j < w; j++)
      if(v[i][j] == num) ret = p(i, j);

  return ret;
}

int count_minite(vector< vector<int> > v, int start, int end){
  int h = v.size(), w = v[0].size();
  int ret = -1;
  // vector< vector<bool> > m; m.resize(h); for(int i = 0; i < h; i++) m[i].resize(w, false);
  queue< pair< p, int> > q;
  q.push(pair< p, int>(find_nest(v, start), 0));

  while(!q.empty()){
    p here = q.front().first; 
    ret = q.front().second;
    q.pop();
    int y = here.first, x = here.second;
    
    if(v[y][x] == end) break;
    else if(v[y][x] == X) continue;

    v[y][x] = X;
    
    if(x > 0 && v[y][x-1] != X) q.push(pair< p, int>(p(y, x-1), ret+1));
    if(x < w - 1 && v[y][x+1] != X) q.push(pair< p, int>(p(y, x+1), ret+1));
    if(y > 0 && v[y-1][x] != X) q.push(pair< p, int>(p(y-1, x), ret+1));
    if(y < h - 1 && v[y+1][x] != X) q.push(pair< p, int>(p(y+1, x), ret+1));
  }
  
  return ret;
}

int main(){
  int h, w, n;
  cin >> h; cin >> w; cin >> n;
  vector< vector<int> > v;  
  v.resize(h); for(int i = 0; i < h; i++)  v[i].resize(w);
  int count = 0;

  for(int i = 0; i < h; i++)
    for(int j = 0; j < w; j++){
      char c; cin >> c;
      v[i][j] = convert(c);
    }

  int start = S;  
  for(int i = 1; i <= n; i++){
    count += count_minite(v, start, i);
    start = i;
  }

  cout << count << endl;
  
  return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <cstring>
#include <queue>
using namespace std;

char ma[1005][1005];int vis[1005][1005];
int w,h,n,ans;

int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};

struct node
{
    int x,y,time;
};
node start;

void bfs(char ed)
{
    queue<node> que;
    que.push(start);
    vis[start.x][start.y]=1;
    while(!que.empty())
    {
        node no=que.front();
        que.pop();
        for(int i=0;i<4;i++)
        {
            int x=no.x+dx[i];
            int y=no.y+dy[i];
            if(!vis[x][y]&&x<w&&x>=0&&y<h&&y>=0&&ma[x][y]!='X')
            {
                if(ma[x][y]==ed)
            {
                start.x=x;
                start.y=y;
                ans+=no.time+1;
                start.time=0;
                return ;
            }
            vis[x][y]=1;
            node no1;
            no1.x=x;no1.y=y;no1.time=no.time+1;
            que.push(no1);

            }

        }
    }
}

int main()
{
    while(~scanf("%d %d %d", & h, & w, & n))
    {
        for(int i=0;i<w;i++)
        {
            scanf("%s",&ma[i]);
            for(int j=0;j<h;j++)
                if(ma[i][j]=='S')
                {
                    start.x=i;
                    start.y=j;
                    start.time=0;

                }

        }
        ans=0;
            for(int i=1;i<=n;i++)
            {
                memset(vis,0,sizeof(vis));
                bfs(i+'0');
            }

            printf("%d\n",ans);
    }
}

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;
				s[i][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;
}