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<queue>
#include<cstdio>
#include<cstring>
#include<utility>
using namespace std;
struct dir
{
	int x,y;
}dir[4]={{-1,0},{1,0},{0,-1},{0,1}};
char hole[1005][1005];
int d[1005][1005],h,w,factory[10][2];
typedef pair<int,int> P;
int bfs(const int &sx,const int &sy,const int &gx,const int &gy)
{
	for (int i = 0; i < h; i++)
	{
		for (int j = 0; j < w; j++)
		{
			d[i][j] = -1;
		}
	}
	//memset(d,-1,sizeof(d));
	queue<P> que;
	que.push(P(sx,sy));
	d[sx][sy]=0;
	while(que.size())
	{
		P p=que.front();
		que.pop();	
		if(p.first==gx&&p.second==gy)
		break;
		for(int i=0;i<4;i++)
		{
		int nx=p.first+dir[i].x;
		int ny=p.second+dir[i].y;
		if(nx>=0&&ny>=0&&nx<h&&ny<w&&hole[nx][ny]!='X'&&d[nx][ny]==-1)
		{
			d[nx][ny]=d[p.first][p.second]+1;
			que.push(P(nx,ny));
		}
		}
	}
	return d[gx][gy];
}
int main()
{
	int sx,sy,i,j,step=0,n;
	scanf("%d%d%d\n",&h,&w,&n);
	//cin>>h>>w>>n;
	for(i=0;i<h;i++,getchar())
		for(j=0;j<w;j++)
		{
			scanf("%c",&hole[i][j]);
			if(hole[i][j]=='S')
			{
				factory[0][0]=i;
				factory[0][1]=j;
				hole[i][j]='.';
			}
			if(isdigit(hole[i][j]))
			{
				int index=hole[i][j]-'0';
			factory[index][0]=i;
			factory[index][1]=j;
			}
		}
	for(i=0;i<n;i++)
	step+=bfs(factory[i][0],factory[i][1],factory[i+1][0],factory[i+1][1]);
	//cout<<step<<endl;
	printf("%d\n",step);
	return 0;
 }

C++: //
//  AOJ 0558 Chees
//
//  Created by TaoSama on 2015-02-20
//  Copyright (c) 2014 TaoSama. All rights reserved.
//
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))

using namespace std;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;

struct Point {
	int x, y;
	Point(int x = 0, int y = 0): x(x), y(y) {}
} c[15];
int n, m, k, dp[1005][1005];
int d[4][2] = { -1, 0, 1, 0, 0, 1, 0, -1};
char a[1005][1005];

int bfs(int x) {
	memset(dp, 0x3f, sizeof dp);
	queue <Point> q; q.push(c[x - 1]);
	dp[c[x - 1].x][c[x - 1].y] = 0;
	while(!q.empty()) {
		Point cur = q.front(); q.pop();
		for(int i = 0; i < 4; ++i) {
			Point nxt(cur.x + d[i][0], cur.y + d[i][1]);
			if(nxt.x < 1 || nxt.x > n || nxt.y < 1 || nxt.y > m
			        || a[nxt.x][nxt.y] == 'X') continue;
			if(dp[nxt.x][nxt.y] == INF) {
				dp[nxt.x][nxt.y] = dp[cur.x][cur.y] + 1;
				q.push(nxt);
			}
		}
	}
	return dp[c[x].x][c[x].y];
}
int main() {
#ifdef LOCAL
	freopen("in.txt", "r", stdin);
//	freopen("out.txt","w",stdout);
#endif
	ios_base::sync_with_stdio(0);

	while(cin >> n >> m >> k) {
		for(int i = 1; i <= n; ++i) {
			for(int j = 1; j <= m; ++j) {
				cin >> a[i][j];
				if(a[i][j] == 'S')
					c[0].x = i, c[0].y = j;
				if(isdigit(a[i][j]))
					c[a[i][j] - '0'].x = i, c[a[i][j] - '0'].y = j;
			}
		}
		int ans = 0;
		for(int i = 1; i <= k; ++i)
			ans += bfs(i);
		cout << ans << endl;
	}
	return 0;
}

C++: //
//  main.cpp
//  AOJ0558
//
//  Created by aki33524 on 2014/04/22.
//  Copyright (c) 2014年 aki33524. All rights reserved.
//

#include <iostream>
#include <stdio.h>
#include <queue>
using namespace std;

typedef pair<int, int> pii;
int H, W, N;
char fields[1001][1001];

int dh[] = {0, 0, 1, -1};
int dw[] = {1, -1, 0, 0};
pii cheese[10];

const int INF = 100000000;

int bfs(int sh, int sw, int gh, int gw){
    int d[H][W];
    for(int i=0; i<H; i++)
        for(int j=0; j<W; j++)
            d[i][j] = INF;
    queue<pii> que;
    que.push(make_pair(sh, sw));
    d[sh][sw] = 0;
    
    while(!que.empty()){
        pii p = que.front();
        que.pop();
        
        for(int i=0; i<4; i++){
            int nh = p.first + dh[i];
            int nw = p.second + dw[i];
            if(0<=nh && nh<H && 0<=nw && nw<W && fields[nh][nw] != 'X' && d[nh][nw] == INF){
                que.push(make_pair(nh, nw));
                d[nh][nw] = d[p.first][p.second] + 1;
            }
            if(nh == gh && nw == gw)
                return d[nh][nw];
            
        }
    }
    return -1;
}

int main(int argc, const char * argv[])
{
    cin >> H >> W >> N;
    
    for(int i=0; i<H; i++)
        cin >> fields[i];
    
    for(int i=0; i<=N; i++){
        if(i==0){
            for(int j=0; j<H; j++)
                for(int k=0; k<W; k++)
                    if(fields[j][k] == 'S')
                        cheese[i] = make_pair(j, k);
        }else{
            for(int j=0; j<H; j++)
                for(int k=0; k<W; k++)
                    if(fields[j][k] == '0'+i)
                        cheese[i] = make_pair(j, k);
        }
    }
    
    int ans = 0;
    for(int i=0; i<N; i++){
        pii s = cheese[i];
        pii g = cheese[i+1];
        ans += bfs(s.first, s.second, g.first, g.second);
    }
    
    cout << ans << endl;
    
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
const int INF = 100000000;
using namespace std;
typedef pair<int, int> P;
char a[1005][1005];
int N, M;
int sx, sy;
int gx, gy;
int d[1005][1005];
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int bfs()
{
	queue<P> que;
	for (int i = 0; i < N; i++)
		for (int j = 0; j < M; j++)
			d[i][j] = INF;
	que.push(P(sx, sy));
	d[sx][sy] = 0;
	while (que.size())
	{
		P p = que.front();
		que.pop();
		if (p.first == gx&&p.second == gy)
			break;
		for (int i = 0; i < 4; i++)
		{
			int nx = p.first + dx[i];
			int ny = p.second + dy[i];
			if (nx >= 0 && nx < N&&ny >= 0 && ny < M&&a[nx][ny] != 'X'&&d[nx][ny] == INF)
			{
				que.push(P(nx, ny));
				d[nx][ny] = d[p.first][p.second] + 1;
			}
		}

	}
	return d[gx][gy];
}
int main(void)
{
	while (cin >> N >> M)
	{
		int n, sum = 0;
		cin >> n;
		for (int i = 0; i < N; i++)
			for (int j = 0; j < M; j++)
				cin >> a[i][j];
		for (int j = 0; j < N; j++)
			for (int k = 0; k < M; k++)
				if (a[j][k] == 'S')
				{
					sx = j;
					sy = k;
				}
		for (int j = 0; j < N; j++)
			for (int k = 0; k < M; k++)
				if (a[j][k] == '1')
				{
					gx = j;
					gy = k;
				}
		sum += bfs();
		for (int i = 0; i < n - 1; i++)
		{
			for (int j = 0; j < N; j++)
				for (int k = 0; k < M; k++)
				{
					if (a[j][k] == (char)(i+49))
					{
						sx = j;
						sy = k;
					}
					if (a[j][k] == (char)(i+50))
					{
						gx = j;
						gy = k;
					}
				}
			sum += bfs();

		}
		cout << sum << endl;
	}
}