这题跟迷宫问题是一样的,只不过指定了要到达终点的顺序,求出每组的起点和终点很容易可以做出来,重点在求起点和终点。
#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
#define INF 1000
int H, W, N;
char map[1001][1001];
int dx[4] = { 0, 0, 1, -1 };
int dy[4] = { 1, -1, 0, 0 };
int d[1001][1001];
int sx, sy;
int gx, gy;
typedef pair<int, int> P;
int sum = 0;
void bfs()
{
queue<P> que;
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
d[i][j] = INF;
que.push(P(sx, sy));
d[sx][sy] = 0;
while (que.size())
{
P p = que.front();
que.pop();
if (p.first == gx&&p.second == gy)break;
for (int i = 0; i < 4; i++)
{
int nx = p.first + dx[i], ny = p.second + dy[i];
if (0 <= nx&&nx < H && 0 <= ny&&ny < W&&map[nx][ny] != 'X'&&d[nx][ny] == INF)
{
que.push(P(nx, ny));
d[nx][ny] = d[p.first][p.second] + 1;
}
}
}
sum+=d[gx][gy];
}
int main()
{
scanf("%d%d%d", &H, &W, &N);
while (getchar() != '\n')continue;
for (int i = 0; i < H; i++){
gets(map[i]);
}
for (int i = 0; i < H; i++)
for (int j = 0; j < W; j++)
{
if (map[i][j] == 'S')
{
sx = i;
sy = j; //求s的位置。
}
}
for (int i = 0; i < N; i++)
{
for (int j = 0; j < H; j++)
{
for (int k = 0; k < W; k++)
{
if (map[j][k] == '1' + i)
{
gx = j; gy = k;
bfs();<span style="white-space:pre"> </span>//找到终点位置,bfs完毕后,把原来的终点当作下一组的起点。
sx = j; sy = k;
}
}
}
}
printf("%d\n", sum);
}