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 <stdio.h>
#include <stack>
#include <math.h>
#include <queue>

using namespace std;

int height,width,N;
char** table;
bool** checkTable;

struct Info{
	int cheese_id,row,col;
};

struct Data{
	int row,col,dist;
	char pre_move;
};

bool rangeCheck(int row,int col){
	if(row >= 0 && row <= height-1 && col >=0 && col <= width-1)return true;
	else{
		return false;
	}
}

int func(int row,int col,int goal_row,int goal_col,int dist){
	queue<Data> Q;
	Data data,tmp;
	data.row = row;
	data.col = col;
	data.dist = 0;
	data.pre_move = 'F';
	Q.push(data);

	checkTable[row][col] = true;

	int ret = 0;

	while(!Q.empty()){
		tmp = Q.front();
		Q.pop();

		if(tmp.col == goal_col && tmp.row == goal_row){
			ret = tmp.dist;
			break;
		}

		if(rangeCheck(tmp.row-1,tmp.col) == true && tmp.pre_move != 'D' && table[tmp.row-1][tmp.col] != 'X' && checkTable[tmp.row-1][tmp.col] == false){
			Data new_data;
			new_data.row = tmp.row-1;
			new_data.col = tmp.col;
			new_data.dist = tmp.dist+1;
			new_data.pre_move = 'U';
			checkTable[tmp.row-1][tmp.col] = true;
			Q.push(new_data);
		}
		if(rangeCheck(tmp.row+1,tmp.col) == true && tmp.pre_move != 'U' && table[tmp.row+1][tmp.col] != 'X'&& checkTable[tmp.row+1][tmp.col] == false){
			Data new_data;
			new_data.row = tmp.row+1;
			new_data.col = tmp.col;
			new_data.dist = tmp.dist+1;
			new_data.pre_move = 'D';
			checkTable[tmp.row+1][tmp.col] = true;
			Q.push(new_data);
		}
		if(rangeCheck(tmp.row,tmp.col-1) == true && tmp.pre_move != 'R' && table[tmp.row][tmp.col-1] != 'X'&& checkTable[tmp.row][tmp.col-1] == false){
			Data new_data;
			new_data.row = tmp.row;
			new_data.col = tmp.col-1;
			new_data.dist = tmp.dist+1;
			new_data.pre_move = 'L';
			checkTable[tmp.row][tmp.col-1] = true;
			Q.push(new_data);
		}
		if(rangeCheck(tmp.row,tmp.col+1) == true && tmp.pre_move != 'L' && table[tmp.row][tmp.col+1] != 'X'&& checkTable[tmp.row][tmp.col+1] == false){
			Data new_data;
			new_data.row = tmp.row;
			new_data.col = tmp.col+1;
			new_data.dist = tmp.dist+1;
			new_data.pre_move = 'R';
			checkTable[tmp.row][tmp.col+1] = true;
			Q.push(new_data);
		}
	}

	return ret;
}

int main(){

	scanf("%d %d %d",&height,&width,&N);
	table = new char*[1000];
	checkTable = new bool*[1000];
	Info info[N+1];
	int info_index = 0,total_dist = 0;


	for(int i=0; i < height; i++){
		table[i] = new char[1001];
		checkTable[i] = new bool[1000];

		scanf("%s",table[i]);

		for(int k = 0; k <width; k++){
			checkTable[i][k] = false;

			if(table[i][k] == 'S'){
				info[info_index].cheese_id = 0;
				info[info_index].row = i;
				info[info_index].col = k;
				info_index++;
			}else if(table[i][k] >= '1' && table[i][k] <= '9'){
				info[info_index].cheese_id = table[i][k] - '0';
				info[info_index].row = i;
				info[info_index].col = k;
				info_index++;
			}
		}
	}

	//???????????????????????±?????????????????????
	for(int i=1; i <= N; i++){
		for(int k=N; k >= i; k--){
			if(info[k].cheese_id < info[k-1].cheese_id)swap(info[k],info[k-1]);
		}
	}

	//i????????????????????????i+1???????????????????????§??????????????¢?????¨??¢?´¢??§?±???????
	for(int i = 0; i <= N-1; i++){
		total_dist += func(info[i].row,info[i].col,info[i+1].row,info[i+1].col,0);
		for(int k = 0; k < height; k++){
			for(int p = 0; p < width; p++)checkTable[k][p] = false;
		}
	}

	printf("%d\n",total_dist);

    return 0;
}

C++: #include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define itrep(it, a) for(it = (a).begin(); it != (a).end; it++)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
#define INF (1 << 30)
using namespace std;

#define N 1005

char M[N][N];
int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
int cnt = 0;

struct point{
    int x,y;
};

point solve(struct point p, int n, char cheese){
    int dist[N][N];
    queue<point> q;
    rep(i,N) rep(j,N) dist[i][j] = INF;

    dist[p.y][p.x] = 0;
    q.push(p);
    struct point u;
    while(!q.empty()){
        //debug(q.size())
        u = q.front(); q.pop();
        rep(i,4){
            struct point a;
            a.x = u.x + dx[i];
            a.y = u.y + dy[i];
            //debug(M[a.y][a.x])
            if(M[a.y][a.x] != 'X' && dist[a.y][a.x] == INF){
                dist[a.y][a.x]  = dist[u.y][u.x] + 1;
                q.push(a);
                //debug(dist[a.y][a.x])
                if(M[a.y][a.x] == cheese){
                    cnt += dist[a.y][a.x];
                    return a;
                }
            }
        }
    }
    return p;
}

int main(){
    int h, w, n, ans = 0;
    struct point p;
    cin >> h >> w >> n;
    rep(i,N) rep(j,N) M[i][j] = 'X';
    range(i,1,h + 1){
        range(j,1,w + 1){
            cin >> M[i][j];
            if(M[i][j] == 'S'){
                p.x = j;
                p.y = i;
            }
        }
    }
    rep(i,n){
        p = solve(p,n,'1' + i);
    }
    cout << cnt << endl;
}