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 <set>
#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];

const int MAXN = 10;
int locationsX[MAXN];
int locationsY[MAXN];
 
int H, W, N;

int get_shortest_distance(int current_HP)
{
	int sx = locationsX[current_HP-1];
	int sy = locationsY[current_HP-1];
	int ex = locationsX[current_HP];
	int ey = locationsY[current_HP];

//	bool is_visit[MAX_SIZE + 1][W + 1]={};
	bool is_visit[MAX_SIZE + 1][MAX_SIZE + 1]={};

//	std::set<std::pair<int,int>> frontier;
//	frontier.insert(std::pair<int,int>{sx,sy});
	std::vector<std::pair<int,int>> frontier;
	frontier.push_back(std::pair<int,int>{sx,sy});
	int nx,ny;
	for(int step=0;step<100000000;step++)
	{
		for(auto p:frontier)
		{
			if(p.first==ex && p.second==ey)	return step;
			is_visit[p.first][p.second] = true;
		}
//		std::set<std::pair<int,int>> next_frontier;
		std::vector<std::pair<int,int>> next_frontier;
		for(auto p:frontier)
		{
			for(int i=0;i<STEP_NUM;i++)
			{
				nx = p.first+STEP[i][0];
				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.insert(std::make_pair(nx,ny));
				next_frontier.push_back(std::make_pair(nx,ny));
			}
		}
		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)
			{
				locationsX[HP]=i;
				locationsY[HP]=j;
			}
		}
	printf("%d\n", solve());
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
queue <pair<int ,int> > po;
int memo[1005][1005],ans,h,w,n, miti[1005][1005];
char c;
bool flag=false;


int main(){

    cin >> h >> w >> n;
    fill((int*)miti,(int*)miti+1005,100);

    for(int i=1;i<=h;i++){
        for(int j=1;j<=w;j++){
            cin >> c;
            if(c=='S'){
                po.push(make_pair(j,i));
                miti[j][i]=0;
            }else if(c=='X')miti[j][i]=100;
            else if(c=='.')miti[j][i]=0;
            else miti[j][i]=c-'0'+10;
        }
    }

    for(int hp=1;hp<=n;hp++){
            flag=false;
            //printf("hp=%d\n",hp);

        while(!po.empty()){
        int px,py;
        px=po.front().first;
        py=po.front().second;
        po.pop();
         //printf("%d %d\n",px,py);

    int xx[4]={0,1,0,-1};
    int yy[4]={1,0,-1,0};

    if(px<1||py<1||px>w||py>h);
    else{
    for(int i=0;i<4;i++){
            if(miti[px+xx[i]][py+yy[i]]==hp+10){
                ans+=memo[px][py]+1;
                 // printf("%d=(%d %d)\nans=%d\n",hp,px+xx[i],py+yy[i],ans);
                flag=true;
                while(!po.empty()){
                    po.pop();
                }
                po.push(make_pair(px+xx[i],py+yy[i]));
                fill((int*)memo,(int*)memo+1005,0);
                break;
        }else if((miti[px+xx[i]][py+yy[i]]<hp||miti[px+xx[i]][py+yy[i]]>10)&&miti[px+xx[i]][py+yy[i]]!=100){
            po.push(make_pair(px+xx[i],py+yy[i]));
            memo[px+xx[i]][py+yy[i]]=memo[px][py]+1;
            if(miti[px+xx[i]][py+yy[i]]>10&&miti[px+xx[i]][py+yy[i]]!=100);
            else miti[px+xx[i]][py+yy[i]]=hp;
                }
            }
            if(flag==true)break;
    }
        }
    }


    cout << ans << endl;


return 0;
}

C++: #include<iostream>
#include<queue>
using namespace std;
int H,W,N,a,b,c,d,nh,nw;
int cost[1000][1000];
char t[1000][1000];
queue< int > qh;
queue< int > qw;
int th[4]={0,-1,0,1};
int tw[4]={1,0,-1,0};
int map[10][2];
int bfs(int tah,int taw){
  int h,w,ans;
  while(!qw.empty()){
    h=qh.front(),qh.pop();
    w=qw.front(),qw.pop();
    for(int i=0;i<4;i++){
      nh=h+th[i];
      nw=w+tw[i];
      if(nh==tah&&nw==taw){
	ans=cost[h][w]+1;
	return ans;
      }else if(cost[nh][nw]==-1){
	qh.push(nh);
	qw.push(nw);
	cost[nh][nw]=cost[h][w]+1;
      }
    }
  }
}
void syokika(){
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      if(cost[i][j]!=-2)cost[i][j]=-1;
    }
  }
  while(!qh.empty()){
    b=qh.front(),qh.pop();
    b=qw.front(),qw.pop();
  }
}
int main(){
  cin>>H>>W>>N;
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cin>>t[i][j];
      if(t[i][j]=='S'){
	map[0][0]=i;
	map[0][1]=j;
      }else if(t[i][j]=='X'){
	cost[i][j]=-2;
      }else if(t[i][j]!='.'){
	map[t[i][j]-'0'][0]=i;
	map[t[i][j]-'0'][1]=j;
      }else{
	
      }
    }
  }
  int sum=0,a;
  for(int i=0;i<N;i++){
    syokika();

    qh.push(map[i][0]);
    qw.push(map[i][1]);
    cost[map[i][0]][map[i][1]]=0;
    a=bfs(map[i+1][0],map[i+1][1]);
    sum+=a;
  }
  cout<<sum<<endl;
  return 0;
}