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 <string>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

#define fi first
#define se second
#define x second
#define y first

typedef pair<int,int> pii;

vector<string> in;
int H, W, N;

int search_length(char s, char g) {
	queue<pair<pii, int> > que;
	int vx[] = {1, -1, 0, 0};
	int vy[] = {0, 0, 1, -1};
	for(int i = 0; i < in.size(); i++) {
		for(int j = 0; j < in[i].size(); j++) {
			if(in[i][j] == s) {
				que.push(pair<pii, int>(pii(i, j), 0));
				j = in[i].size();
				i = in.size();
			}
		}
	}
	int visited[1024][1024] = {0};
	while(!que.empty()) {
		pair<pair<int,int>, int> tmp;
		tmp = que.front(); que.pop();
		for(int i = 0; i < 4; i++) {
			int x_, y_;
			x_ = tmp.fi.x + vx[i]; y_ = tmp.fi.y + vy[i];
			if(!(x_ < 0 || (int)in[0].size() <= x_ || y_ < 0 || (int)in.size() <= y_)) {
				if(in[y_][x_] == g) {
					return tmp.se + 1;
				}
				if(!visited[y_][x_] && in[y_][x_] != 'X') {
					visited[y_][x_] = 1;
					que.push(pair<pii,int>(pii(y_, x_), tmp.se + 1));
				}
			}
		}
	}
	cout << "reach" << endl;
	return -1;
}

int main() {
	cin >> H >> W >> N;
	int ret = 0;
	for(int i = 0; i < H; i++) {
		string tmp;
		cin >> tmp;
		in.push_back(tmp);
	}

	for(int i = 0; i < N; i++) {
		ret += search_length(i == 0 ? 'S' : (char)(i + '0'), (char)(i + 1 + '0'));
	}
	cout << ret << endl;
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <cstring>
#include <queue>
using namespace std;

char ma[1005][1005];int vis[1005][1005];
int w,h,n;

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

struct node
{
    int x,y,time;
};
node start;

void bfs(char ed)
{
    queue<node> que;
    que.push(start);
    vis[start.x][start.y]=1;
    while(!que.empty())
    {
        node no=que.front();
        que.pop();
        for(int i=0;i<4;i++)
        {
            int x=no.x+dx[i];
            int y=no.y+dy[i];
            if(vis[x][y]||x>=h||x<0||y>=w||y<0||ma[x][y]=='X')
                continue;
            if(ma[x][y]==ed)
            {
                start.x=x;
                start.y=y;
                start.time=no.time+1;
                return ;
            }
            vis[x][y]=1;
            node no1;
            no1.x=x;no1.y=y;no1.time=no.time+1;
            que.push(no1);
        }
    }
}

int main()
{
    while(~scanf("%d %d %d", & h, & w, & n))
    {
        for(int i=0;i<h;i++)
        {
            scanf("%s",&ma[i]);
            for(int j=0;j<w;j++)
                if(ma[i][j]=='S')
                {
                    start.x=i;
                    start.y=j;
                    start.time=0;
                }

        }
            for(int i=0;i<n;i++)
            {
                memset(vis,0,sizeof(vis));
                bfs(i+'1');
            }

            printf("%d\n",start.time);
    }
    return 0; 
}

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;

	while(!Q.empty()){
		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);
		}
	}

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