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<utility>
typedef std::pair<int,int> PP;
int H, W, N;
int sh, sw;
char tar[9] = { '1','2','3','4','5','6','7','8','9' };
char HW[1000][1000];
int cnt = 0;
const int INF = 1 << 30;
int ans;
int tx, ty;
int D[1000][1000];
void solve(int h, int w) {
	std::queue<PP> q;
	q.push(std::make_pair(h, w));
	for (int a = 0; a < H; a++) {
		for (int b = 0; b < W; b++) {
			D[a][b] = INF;
		}
	}
	D[h][w] = 0;
	while (q.size()) {
		std::pair<int, int> p = q.front();
		q.pop();
		if (HW[p.first][p.second] == tar[cnt]) {
			ans += D[p.first][p.second];
			tx = p.first;
			ty = p.second;
			return;
		}
		int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
		for (int i = 0; i < 4; i++) {
			int ux = p.first + dx[i];
			int uy = p.second + dy[i];
			if (0 <= ux&&ux < H && 0 <= uy&&uy < W&&D[ux][uy] == INF&&HW[ux][uy] != 'X') {
				q.push(std::make_pair(ux, uy));
				D[ux][uy] = D[p.first][p.second] + 1;
			}
		}
	}
	return;
}
int main() {
	std::cin >> H >> W >> N;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			std::cin >> HW[i][j];
			if (HW[i][j] == 'S') {
				sh = i;
				sw = j;
			}
		}
	}
	solve(sh, sw);
	for (int i = 0; i < N; i++) {
		cnt = i;
		solve(tx, ty);
	}
	std::cout << ans << "\n";
	return 0;
}

C++: #include <iostream>
#include <queue>
using namespace std;
typedef pair<int, int> P;

const int MAX_H = 1000, MAX_W = 1000;
int h, w, n, loop = 0, ans, dis[MAX_H][MAX_W] = {};
char town[MAX_H][MAX_W], list[10] = "123456789";
bool reached[MAX_H][MAX_W];
queue <P> place;
P xy;

int solve(){
	int dx[4] = {0, 0, -1, 1}, dy[4] = {-1, 1, 0, 0};
	
	while(1){
		xy = place.front();
		place.pop();
		for(int i = 0; i < 4; i++){
			int x = xy.first + dx[i], y = xy.second + dy[i];
			
			if(x < 0 || x >= h || y < 0 || y >= w){
				continue;
			}
			if(town[x][y] == 'X' || reached[x][y] == 1){
				continue;
			}
			
			reached[x][y] = 1;
			dis[x][y] = dis[xy.first][xy.second] + 1;
			place.push(P(x, y));
			
			if(town[x][y] == list[loop]){
				loop++;
				if(loop == n){
					return dis[x][y];
				} else{
					for(int i = 0; i < h; i++){
						for(int j = 0; j < w; j++){
							reached[i][j] = 0;
						}
					}
					reached[x][y] = 1;
				
					while(place.size() != 1){
						place.pop();
					}
					
					break;
				}
			}
		}
	}
}

int main() {
	cin >> h >> w >> n;
	for(int i = 0; i < h; i++){
		for(int j = 0; j < w; j++){
			cin >> town[i][j];
			
			if(town[i][j] == 'S'){
				reached[i][j] = 1;
				place.push(P(i, j));
			}
		}
	}
	
	cout << solve() << endl;
	
	return 0;
}

C++: //
//  main.cpp
//

#include <algorithm>
#include <array>
#include <iostream>
#include <vector>
#include <limits>
#include <math.h>
#include <queue>
#include <tuple>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <memory>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <memory>

// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0558

using namespace std;

//// #define TEST
//
//#ifdef TEST
//static const string g_SAMPLE = R"(10 10 9
//.X...X.S.X
//6..5X..X1X
//...XXXX..X
//X..9X...X.
//8.X2X..X3X
//...XX.X4..
//XX....7X..
//X..X..XX..
//X...X.XX..
//..X.......)";
//static FILE* g_IN_FP;
//static const char* g_IN_FN = "./in";
//#define scanf(...) fscanf(g_IN_FP, __VA_ARGS__)
//#endif // TEST

int main() {
//#ifdef TEST
//    g_IN_FP = fopen(g_IN_FN, "w");
//    fwrite(g_SAMPLE.c_str(), 1, g_SAMPLE.size(), g_IN_FP);
//    fclose(g_IN_FP);
//    g_IN_FP = fopen(g_IN_FN, "r");
//#endif // TEST
    int H, W, N;
    scanf("%d %d %d", &H, &W, &N);
    vector<vector<char>> field;
    field.reserve(H);
    for (int i = 0; i < H; i++) {
        field.push_back(vector<char>(W, '.'));
    }
    for (int i = 0; i < H; i++) {
        scanf("%s", &field[i][0]);
    }
    return 0;
    vector<pair<int,int>> factories(N+1, pair<int,int>(0,0));
    for (int i = 0; i < H; i++) {
        for (int j = 0; j < W; j++) {
            if (field[i][j] == 'S') {
                factories[0] = pair<int,int>(i,j);
            } else if ('1' <= field[i][j] && field[i][j] <= '0' + N) {
                factories[field[i][j] - '0'] = pair<int,int>(i,j);
            }
        }
    }
    function<int(pair<int,int>,pair<int,int>)> calcDist = [&field, H, W](pair<int,int> start, pair<int,int> end) -> int {
        vector<vector<int>> distMap;
        distMap.reserve(H);
        for (int i = 0; i < H; i++) {
            distMap.push_back(vector<int>(W, numeric_limits<int>::max()));
        }
        queue<pair<int,int>> seeds;
        seeds.push(start);
        distMap[start.first][start.second] = 0;
        while (true) {
//#ifdef TEST
//            for (int i = 0; i < H; i++) {
//                for (int j = 0; j < W; j++) {
//                    if (distMap[i][j] < numeric_limits<int>::max()) {
//                        cout << distMap[i][j];
//                    } else {
//                        cout << "@";
//                    }
//                }
//                cout << endl;
//            }
//            cout << endl;
//#endif // TEST
            pair<int,int> seed = seeds.front();
            seeds.pop();
            int dist = distMap[seed.first][seed.second];
            if (seed == end) {
                return dist;
            }
            using V = pair<int,int>;
            static const vector<V> VECTS = {V{-1,0}, V{1,0}, V{0,-1}, V{0,1}};
            for (V vec : VECTS) {
                V pt(seed.first + vec.first, seed.second + vec.second);
                if (pt.first < 0 || pt.first >= H || pt.second < 0 || pt.second >= W) {
                    continue;
                }
                if (distMap[pt.first][pt.second] != numeric_limits<int>::max()) {
                    continue;
                }
                if (field[pt.first][pt.second] == 'X') {
                    continue;
                }
                seeds.push(pt);
                distMap[pt.first][pt.second] = dist + 1;
            }
        }
        return numeric_limits<int>::max();
    };
    int total = 0;
    for (int i = 1; i <= N; i++) {
        total += calcDist(factories[i-1],factories[i]);
    }
    printf("%d\n",total);
    return 0;
}