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 <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
typedef pair<int, int> Pair;
bool use[1001][1001];
char maze[1001][1001];
Pair p[10];
int m, n;
int dx[4] = {0, 1, -1, 0};
int dy[4] = {1, 0, 0, -1};
int d[1001][1001];
int bfs(int deep, int x, int y)
{
    int res = 0;
    queue<Pair> q;
    q.push(Pair(x, y));
    d[x][y] = 0;
    while(q.size())
    {
        int i;
        Pair now = q.front();
        q.pop();
        if(now.first == p[deep].first && now.second == p[deep].second)
            break;
        for(i = 0;i < 4;i++)
        {
            int nx, ny;
            nx = now.first + dx[i];
            ny = now.second + dy[i];
            if(nx >= 0 && nx < m && ny >= 0 && ny < n && maze[nx][ny] != 'X' && !use[nx][ny])
            {
                use[nx][ny] = true;
                q.push(Pair(nx, ny));
                d[nx][ny] = d[now.first][now.second] + 1;
            }
        }
    }
    return d[p[deep].first][p[deep].second];
}
int main()
{
    int k;
    while(scanf("%d%d%d", &m, &n, &k) != EOF)
    {
        int i, j;
        for(i = 0; i < m; i++)
            scanf("%s", maze[i]);
        int x, y;
        for(i = 0; i < m; i++)
            for(j = 0; j < n; j++)
                if(isdigit(maze[i][j]))
                {
                    p[maze[i][j] - '0'].first = i;
                    p[maze[i][j] - '0'].second = j;
                }
                else if(maze[i][j] == 'S')
                {
                    x = i;
                    y = j;
                }
        int ans = 0;
        for(i = 1; i <= k; i++)
        {
            memset(use, false, sizeof(use));
            ans += bfs(i, x, y);
            x = p[i].first;
            y = p[i].second;
        }
        printf("%d\n", ans);
    }
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
#include<queue>
using namespace std;
int xs[10],ys[10];
int H,W,N;
string S[1002];
int main()
{
	scanf("%d%d%d",&H,&W,&N);
	for(int i=0;i<W+2;i++){
		S[0]+='X';
		S[H+1]+='X';
	}
	for(int i=1;i<=H;i++){
		string x;
		cin >> x;
		S[i]+='X'+x+'X';
	}
	for(int i=1;i<=H;i++){
		for(int j=1;j<=W;j++){
			if(S[i][j]!='X'&&S[i][j]!='.'){
				if(S[i][j]=='S'){
					xs[0]=j;
					ys[0]=i;
				}
				else{
					xs[S[i][j]-'0']=j;
					ys[S[i][j]-'0']=i;
				}
			}
		}
	}

	int X[1002][1002];
	int ans=0;
	queue<pair<int,int>>que;
	int dx[4]={-1,0,0,1};
	int dy[4]={0,-1,1,0};
	for(int x=0;x<N-1;x++){
		for(int i=0;i<H+2;i++)for(int j=0;j<W+2;j++)X[i][j]=-1;
		X[ys[x]][xs[x]]=0;
		que.push(make_pair(ys[x],xs[x]));
		while(X[ys[x+1]][xs[x+1]]==-1){
			for(int j=0;j<4;j++){
				pair<int,int>P=que.front();
				que.pop();
				if(S[P.first+ys[j]][P.second+xs[j]]=='X')continue;
				if(X[P.first+ys[j]][P.second+xs[j]]!=-1)continue;
				X[P.first+ys[j]][P.second+xs[j]]=X[P.first][P.second]+1;
			}
		}
		ans+=X[ys[x+1]][xs[x+1]];
	}
	printf("%d\n",ans);
	return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;

#define INF 999999999
#define MAX_X 1000
#define MAX_Y 1000
#define MAX_HEALTH 10
struct status {
	int health;
	int x;
	int y;
	int minutes;
};

queue<status> bfs;
bool checked[12][1010][1010];//health,x,y
//int lastnum[11] = {0,0,0,0,0,0,0,0,0,0};
int maxhp = 0;
///queue???push??????
///??¢??????????????\??????????????¨?????????status?????´?????????????????????
bool PushToQueue(status a) {
	/*for (int i = 0;i < lastnum[a.health];i++) {
		if (checked[i].health == a.health && checked[a.health][i].x == a.x && checked[a.health][i].y == a.y && checked[a.health][i].minutes == a.minutes){
			cout << "health:" << a.health << "/" << i << "/" << lastnum[a.health] << endl;
			return true;
		} 
	}
	checked[a.health][lastnum[a.health]++] = a;*/
	if (checked[a.health][a.x][a.y] == true) return false;
	if (a.health < maxhp) return false;
	bfs.push(a);
	if (a.health > maxhp) {
		maxhp = a.health;
		//cout << "maxhp has changed to " << maxhp << endl;
	}
	checked[a.health][a.x][a.y] = true;
	return true;
}

int main() {
	for (int a = 0;a < 11;a++) {
		for (int b = 0;b < 1000;b++) {
			for (int c = 0;c < 1000;c++) {
				checked[a][b][c] = false;
			}
		}
	}

	int H , W , N;

	cin >> H >> W >> N;
	char data[H][W];
	
	for (int i = 0;i < H;i++) {
		cin >> data[i];
	}
	//cout << "A" << endl;
	//Find 'S'
	for (int y = 0;y < H;y++) {
		for (int x = 0;x < W;x++) {
			if(data[y][x] == 'S') {
				bfs.push((struct status) {1,x,y,0});
				goto getout;
			}
		}
	}


	getout:
	int result = INF;
	for (;;) {
		if (bfs.empty()) break;
		struct status popped = bfs.front();
		bfs.pop();
		//cout << popped.health << "/" << popped.x << "/" << popped.y << "/" << popped.minutes << "/" << endl;
		if (popped.health == N+1) {
			if (popped.minutes < result) {
				result = popped.minutes;
			}
		}
		else {
			for (int x = -1;x < 2;x++) {
				for (int y = -1;y < 2;y++) {
					if(x != 0 && y != 0) continue;
					if (popped.x + x < 0 || popped.x + x >= W || popped.y + y < 0 || popped.y + y >= H) continue;
					if (data[popped.y + y][popped.x + x] == 'X') continue;
					else if (data[popped.y + y][popped.x + x] == '.') {
						PushToQueue((struct status) {popped.health,popped.x + x,popped.y + y,popped.minutes + 1});
					}
					else {
						//cout << "*****************************factory" << endl;
						int factory = data[popped.y + y][popped.x + x] -48 ;
						//cout << data[popped.y + y][popped.x + x]<< endl;
						if (factory == popped.health) {
							//eat
							PushToQueue((struct status) {popped.health + 1,popped.x + x,popped.y + y,popped.minutes + 1});
						}
						else {
							//the mouse doesn't eat.
							PushToQueue((struct status) {popped.health,popped.x + x,popped.y + y,popped.minutes + 1});
						}
					}
				}
			}
		}
	}
	cout << result << endl;
	return 0;
}