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 <cstdlib>
#include <cstdio>
#include <queue>
using namespace std;

const int INF = 10000000;

const int MAX_H = 1000;
const int MAX_W = 1000;
const int MAX_N = 10;

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

typedef struct {
	int x, y;
} node;
node makeNode(int x, int y) {
	node n = {x, y};
	return n;
}

int w, h, n;
// 入力されたフィールド (W * H)
char field[MAX_H][MAX_W];
// 各地点までのステップ数，未到達なら INF
int step[MAX_H][MAX_W];

int bfs(int startX, int startY, int goalX, int goalY) {
	queue<node> que;
	que.push(makeNode(startX, startY));
	step[startY][startX] = 0;
	while (!que.empty()) {
		node current = que.front();
		que.pop();
		if (current.x == goalX && current.y == goalY) {
			return step[goalY][goalX];
		}
		for (int i = 0; i < 4; i++) {
			int nextX = current.x + dx[i];
			int nextY = current.y + dy[i];
			if (0 <= nextX && nextX < w
					&& 0 <= nextY && nextY < h
					&& field[nextY][nextX] != 'X'
					&& step[nextY][nextX] == INF) {
				que.push(makeNode(nextX, nextY));
				step[nextY][nextX] = step[current.y][current.x] + 1;
			}
		}
	}
	exit(-1);
}

int main () {
	scanf("%d %d %d", &h, &w, &n);
	int startX, startY;
	// 入力しながらスタートの座標を探す
	for (int i = 0; i < h; i++) {
		scanf("%s", field[i]);
		for (int j = 0; j < w; j++) {
			if (field[i][j] == 'S') {
				startX = j;
				startY = i;
			}
		}
	}
	
	// 工場を順番に回って合計ステップを計算する
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		// step を INF で初期化しながらゴールの座標を探す
		int goalX, goalY;
		for (int j = 0; j < h; j++) {
			for (int k = 0; k < w; k++) {
				step[j][k] = INF;
				if (field[j][k] == '0' + i) {
					goalX = k;
					goalY = j;
				}
			}
		}
		
		
		ans += bfs(startX, startY, goalX, goalY);
		
		startX = goalX;
		startY = goalY;
	}
	
	printf("%d\n", ans);
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <queue>

using namespace std;
typedef pair<int, int> P;
static const int INF = 99999999;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

void solve()
{
	int H, W, N;
	cin >> H >> W >> N;
	vector< vector<char> > field(H, vector<char>(W));
	P pos;
	for(int i = 0; i < H; ++i)
	{
		for(int j = 0; j < W; ++j)
		{
			cin >> field[i][j];
			if(field[i][j] == 'S')
			{
				pos.first = j;
				pos.second = i;
			}
		}
	}
	int ans = 0;
	vector< vector<int> > step(H, vector<int>(W));
	for(int i = 0; i < H; ++i)
	{
		for(int j = 0; j < W; ++j)
		{
			step[i][j] = INF;
		}
	}
	step[pos.second][pos.first] = 0;
	int level = 1;
	queue<P> Que;
	Que.push(pos);
	while(!Que.empty())
	{
		P p = Que.front();
		Que.pop();
		if('1' <= field[p.second][p.first] && field[p.second][p.first] <= '9' && level >= field[p.second][p.first] - '0')
		{
			ans += step[p.second][p.first];
			field[p.second][p.first] = '.';
			while(!Que.empty())
			{
				Que.pop();
			}
			++level;
			if(level >= N + 1)
			{
				break;
			}
			Que.push(P(p.first, p.second));
			for(int i = 0; i < H; ++i)
			{
				for(int j = 0; j < W; ++j)
				{
					step[i][j] = INF;
				}
			}
			step[p.second][p.first] = 0;
			continue;
		}
		int nx, ny;
		for(int i = 0; i < 4; ++i)
		{
			nx = p.first + dx[i];
			ny = p.second + dy[i];
			if(0 <= nx && nx < W && 0 <= ny && ny < H && field[ny][nx] != 'X' && step[ny][nx] == INF)
			{
				Que.push(P(nx, ny));
				step[ny][nx] = step[p.second][p.first] + 1;
			}
		}
	}
	cout << ans << endl;
}

int main()
{
	solve();
	return(0);
}

C++: #include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define ALL(v) (v).begin(), (v).end()
#define LENGTHOF(x) (sizeof(x) / sizeof(*(x)))
#define AFILL(a, b) fill((int*)a, (int*)(a + LENGTHOF(a)), b)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define Y first
#define X second
#define INF 1 << 30
#define EPS 1e-10

typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef pair<pi, pi> pipi;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;

int H, W, N;
char field[1000][1000];
int dy[] = {0,1,0,-1}, dx[] = {1,0,-1,0};

int main(){
  scanf("%d%d%d", &H, &W, &N);
  rep(i, H) scanf("%s", field[i]);

  int x, y;
  rep(i, H) rep(j, W) if(field[i][j] == 'S'){ y = i; x = j; break;}
  pii p;
  p = MP(0, MP(y, x));
  REP(i, 1, N+1){
    map<pi, int>m;
    m[MP(p.S.Y, p.S.X)] = 1;
    queue<pii>q;
    q.push(MP(p.F, MP(p.S.Y, p.S.X)));
    while(!q.empty()){
      p = q.front(); q.pop();
      if(field[p.S.Y][p.S.X] == i + '0'){
	if(i == N)  printf("%d\n", p.F);
	break;
      }
      rep(d, 4){
	int ny = p.S.Y + dy[d], nx = p.S.X + dx[d];
	int c = p.F;
	if(ny < 0 || ny >= H || nx < 0 || nx >= W || field[ny][nx] == 'X') continue;
	if(m.count(MP(ny, nx))) continue;
	m[MP(ny, nx)] = 1;
	q.push(MP(c+1, MP(ny, nx)));
      }
    }
  }
  return 0;
}