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 <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <set>

using namespace std;

#define ALL(co) co.begin(), co.end()
#define tpl(...) make_tuple(__VA_ARGS__)

typedef long long LL;
typedef pair<int, int> P; typedef pair<P, int> PI; typedef pair<P, P> PP;
typedef vector<int> Array; typedef vector<vector<int> > Array2;
typedef vector<LL> LArray; typedef vector<P> PArray; typedef vector<string> SArray;

const int INF = 1 << 29;
const LL LINF = 1LL << 60;

inline int getInt() { int itiv; return (cin >> itiv, itiv); }
template <typename T> void readAll(vector<T>& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i]; }
template <typename T, typename U> void readAll(vector<pair<T, U> >& vec) { for (int i = 0, size = vec.size(); i < size; i++) cin >> vec[i].first >> vec[i].second; }
template < typename T > inline string toString( const T &a ){ ostringstream oss; oss << a; return oss.str(); };
inline bool between(int min, int max, int n) { return min <= n && n <= max; }
inline bool inRange(int begin, int end, int n) { return begin <= n && n < end; }
inline bool inRange(int size, int n) { return 0 <= n && n < size; }

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

int h, w, n;

int main(void)
{
	ios::sync_with_stdio(false);
	while(cin >> h >> w >> n && n)
	{
		vector<vector<char> > stage(h, vector<char>(w));
		PArray goals(n + 1);
		for (int i = 0; i < h; i++)
		{
			for (int j = 0; j < w; j++)
			{
				cin >> stage[i][j];
				if(stage[i][j] == 'S') goals[0] = P(i, j);
				int num = stage[i][j] - '0';
				if(inRange(n + 1, num)) goals[num] = P(i, j);
			}
		}

		int ans = 0;
		for (int i = 0; i < n; i++)
		{
			P start = goals[i], goal = goals[i + 1];
			vector<vector<bool> > visited(h, vector<bool>(w));
			queue<PI> que;
			que.push(PI(P(start.first, start.second), 0));
			while (!que.empty())
			{
				PI pi = que.front(); que.pop();
				if(goal == pi.first)
				{
					ans += pi.second;
					break;
				}
				int r = pi.first.first, c = pi.first.second;
				if(visited[r][c]) continue;
				visited[r][c] = true;

				for (int i = 0; i < 4; i++)
				{
					int nr = r + dr[i], nc = c + dc[i];
					if(!inRange(h, r) || !inRange(w, c) || stage[r][c] == 'X') continue;
					que.push(PI(P(r, c), pi.second));
				}
			}
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>

#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define INF (1 << 30)
#define mp make_pair

using namespace std;

typedef pair<int, int> P;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
int h, w, n;
int ans = 0;
int sx, sy, gx, gy;
char field[1010][1010];
int went[1010][1010];

/*struct state{
	int x;
	int y;
	int count;
};*/

int bfs(P start, int tmp) {
	rep(i, h) {
		rep(j, w) {
			went[i][j] = INF;
			if(field[i][j] == tmp + '0') {
				gy = i;
				gx = j;
			}
		}
	}
	went[start.first][start.second] = 0;

	queue<P> q;
	q.push(start);

	while(!q.empty()) {
		P p = q.front();
		q.pop();
		//cout << p.first << " " << p.second.first << " " << p.second.second << endl;
		if(p.first == gy && p.second == gx) return went[p.first][p.second];
		rep(i, 4) {
			int nx = p.second + dx[i];
			int ny = p.first + dy[i];
			if(nx >= 0 && ny >= 0 && nx < w && ny < h && went[ny][nx] == INF && field[ny][nx] != 'X') {
				q.push(P(ny, nx));
				went[ny][nx] = went[p.first][p.second] + 1;
			}
		}
	}
}

int main() {
	cin >> h >> w >> n;
	rep(i, h) rep(j, w) {
		cin >> field[i][j];
		if(field[i][j] == 'S'){
			sx = j, sy = i;
			gx = j, gy = i;
		}
	}
	/*rep(i, h) {
		rep(j, w) cout << field[i][j];
		cout << endl;
	}*/
	for(int i = 1; i <= n; ++i) {
		ans += bfs(P(gy, gx), i);
	}
	cout << ans << endl;
	return 0;
}

C++: #include <iostream>
#include <queue>
#include <map>
#include <string.h>
#include <cstdio>
#define INF 1000000
using namespace std;
typedef pair<int,int>P;
char G[1001][1001];
int s_x,s_y,g_x,g_y;
int h,w,n;
int d[1001][1001];
int dx[] = {0,0,-1,1},dy[] = {1,-1,0,0};
int sum;
int bfs(int px,int py,int life){

  for(int i = 0 ; i < h ; i++ ){
    for(int j = 0 ; j < w ; j++ ){
      d[j][i] = INF;
      if(G[j][i]-'0' == life){
	g_x = j;
	g_y = i;
      }
    }
  }

  queue<P>que;
  que.push(P(px,py));
  d[px][py] = 0;

  while(!que.empty()){
    P p = que.front();
    que.pop();
    if(p.first == g_x && p.second == g_y)break;
    for(int i = 0 ; i < 4 ; i++ ){
      int nx = p.first + dx[i],ny = p.second + dy[i];
      if(0<= nx && nx < w && 0 <= ny && ny < h && G[nx][ny] != 'X'&&d[nx][ny] == INF){
	que.push(P(nx,ny));
	d[nx][ny] = d[p.first][p.second] + 1;
      }
    }
  }
  sum += d[g_x][g_y]; 
  if(life != n)bfs(g_x,g_y,life+1);
  return sum;
}

int main(){

  cin >> h >> w >> n;
  for(int i = 0 ; i < h ; i++ ) {
    for(int j = 0 ; j < w ; j++ ) {
      cin >> G[j][i];
      if(G[j][i] == 'S'){
	s_x = j;
	s_y = i;
      }
    }
  }
  sum = 0;
  int ret =  bfs(s_x , s_y , 1);
  cout << ret << endl;
}