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++: //???2:???????????¢?´¢
#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;
};

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;
	Q.push(data);


	int ret = 0,count = 0;

	while(!Q.empty() && count <= 100){
		tmp = Q.front();
		Q.pop();
		checkTable[tmp.row][tmp.col] = true;

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

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

	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[1001];

		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]);
		}
	}

	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<iostream>
#include<vector>
#include<queue>

using namespace std;

int nowS = 0;
int x, y, n;
int mp[1000][1000] = {};
int k[4] = {1, -1, 0, 0};
int h[4] = {0, 0, 1, -1};
int cx[9] = {};
int cy[9] = {};
queue<int> bufX, bufY, bufD;

bool search(int xx, int yy, int dd) {//???????????????????????\????????????
	bufX.pop();//??????????¶????
	bufY.pop();
	bufD.pop();

	mp[yy][xx] = nowS + 1;//?????£??????????????????????????°
	for (int i = 0; i < 4; i++) {
		if (xx + k[i] < 0 || xx + k[i] >= x || yy + h[i] < 0 || yy + h[i] >= y)//?????????
			continue;
		if (mp[yy + h[i]][xx + k[i]] == -1) {//?£?
			continue;
		}
		if (cx[nowS] == xx + k[i] && cy[nowS] == yy + h[i]) {//??????
			nowS++;
			while (!bufX.empty()) {
				bufX.pop();
				bufY.pop();
				bufD.pop();
			}
			if (nowS == n) {//?????????????????????
				cout << dd + 1 << endl;
				return true;
			}
			else {//
				bufX.push(xx + k[i]);
				bufY.push(yy + h[i]);
				bufD.push(dd + 1);
			}
			return false;
		}
		if(mp[yy + h[i]][xx + k[i]] >= 0 && mp[yy + h[i]][xx + k[i]] < nowS + 1){//?????\????????????
			bufX.push(xx + k[i]);
			bufY.push(yy + h[i]);
			bufD.push(dd + 1);
		}
	}
	return false;
}

int main() {
	int ch = 0;
	cin >> y >> x >> n;
	for (int i = 0; i < y; i++) {//??\???
		char c[1001];
		cin >> c;
		for (int j = 0; j < x; j++) {
			if(c[j] == 'X')
				mp[i][j] = -1;
			else if(c[j] == 'S'){
				bufX.push(j);
				bufY.push(i);
				bufD.push(0);
				mp[i][j] = 0;
			}	
			else {
				mp[i][j] = 0;
			}
			if (c[j] >= 48 && c[j] <= 57) {
				int m;
				m = c[j] - 49;
				cx[m] = j;
				cy[m] = i;		
				ch++;
			}
		}
	}
	

	while(!search(bufX.front(), bufY.front(), bufD.front())){}//??????????????§?????????

	return 0;
}