题意:在一个M行N列的迷宫中(看下样例别弄反了),‘#’表示墙不可以走,其他都可以走,还有两种英文字母A和S,现在从S出发,要求用最短的路径L连接所有字母A,输出这条路径L的总长度。
AC是AC了,但是我依旧没看懂样例是咋来的。。。
思路:先把所有A,S点编号,用BFS处理出来A,S中每一个点到剩余所有点的最短路径长度,然后以A,S为点,A到S的最短路径长度为边权建立一个新图,最后对于这个新图求最小生成树就是答案。
题目有两个坑点:①N和M数据范围不是50,要比50大,我开到100就过了②测试数据中N和M后面有几个空格,在%d后面加一个\n即可。
//#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
const int MAXN = 105;
const int INF = 0x3f3f3f3f;
struct Node
{
int x, y, step;
}NOW, NEXT;
int n, m, a[MAXN][MAXN], dir[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
string MAP[MAXN];//原地图
int cnt, dis[MAXN], G[MAXN][MAXN];//建图
bool vis[MAXN][MAXN], vis1[MAXN * MAXN];
int bfs(int sx, int sy, int u)
{
memset(vis, 0, sizeof(vis)); vis[sx][sy] = true;
NOW.x = sx; NOW.y = sy; NOW.step = 0;
queue<Node> q;
q.push(NOW);
while (!q.empty())
{
NOW = q.front();
q.pop();
if (a[NOW.x][NOW.y] != -1)
{
int v = a[NOW.x][NOW.y];
G[u][v] = NOW.step;
}
for (int i = 0; i < 4; i++)
{
int X = NOW.x + dir[i][0], Y = NOW.y + dir[i][1];
if (X >= 0 && Y >= 0 && X < n && Y < m && MAP[X][Y] != '#' && !vis[X][Y])
{
vis[X][Y] = true;
NEXT.x = X; NEXT.y = Y; NEXT.step = NOW.step + 1;
q.push(NEXT);
}
}
}
return -1;
}
int prim()
{
memset(vis1, 0, sizeof(vis1));
for (int i = 0; i < cnt; i++) dis[i] = G[0][i];
vis1[0] = true; dis[0] = 0;
int ans = 0;
for (int i = 1; i < cnt; i++)
{
int pos = -1, MIN = INF;
for (int j = 0; j < cnt; j++)
{
if (!vis1[j] && dis[j] < MIN)
{
MIN = dis[j]; pos = j;
}
}
if (MIN == INF) return -1;
ans += MIN;
vis1[pos] = true;
for (int j = 0; j < cnt; j++)
{
if (!vis1[j] && dis[j] > G[pos][j])
{
dis[j] = G[pos][j];
}
}
}
return ans;
}
int main()
{
int T;
scanf("%d", &T);
while (T--)
{
cnt = 0;
memset(a, -1, sizeof(a));
scanf("%d%d\n", &m, &n);
for (int i = 0; i < n; i++)
{
getline(cin, MAP[i]);
for (int j = 0; j < MAP[i].length(); j++)
{
if (MAP[i][j] == 'S' || MAP[i][j] == 'A')
{
a[i][j] = cnt++;
}
}
}
memset(G, INF, sizeof(G));
for (int i = 0; i < n; i++)
{
for (int j = 0; j < MAP[i].length(); j++)
{
if (a[i][j] != -1) bfs(i, j, a[i][j]);
}
}
printf("%d\n", prim());
}
return 0;
}
/*
2
6 5
#####
#A#A##
# # A#
#S ##
#####
7 7
#####
#AAA###
# A#
# S ###
# #
#AAA###
#####
*/