转载请注明出处:忆梦http://blog.csdn.net/fjy4328286/article/details/9459695
题目链接:http://www-personal.umich.edu/~msgsss/sgu/344.html
题目大意:输入n,m,分别表示矩阵的行和列。X为有杂草的,'.'四个方向中只要有两个或两个以上的方向有杂草,那么'.'就会变成‘X’有杂草的。问最后这个矩阵中有‘X’的一共有多少个。
题解:BFS,将每一个‘X’入队列,将‘X’周围的'.'都加1,当大于等于2时,‘.’也入队列,同时将‘.’变成‘X’;
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
#define N 1005
int n, m;
int x[] = {1,0,-1,0};
int y[] = {0,1,0,-1};
char map[N][N];
bool vis[N][N];
int cnt[N][N];
typedef struct Node
{
int x, y;
}Node;
queue<Node>Q;
void BFS()
{
int i, j, k;
Node temp, s;
while(!Q.empty())
{
s = Q.front();
Q.pop();
temp = s;
for(k = 0; k < 4; k++)
{
int a = temp.x + x[k];
int b = temp.y + y[k];
if(a >= 0 && a<n && b>=0 && b<m && map[a][b] == '.' && !vis[a][b])
{
cnt[a][b]++;
if(cnt[a][b] == 2)
{
Node tmp;
tmp.x = a;
tmp.y = b;
vis[a][b] = true;
Q.push(tmp);
map[a][b] = 'X';
}
}
}
}
}
int main ()
{
while(scanf("%d %d", &n, &m) != EOF)
{
int i, j;
for(i = 0; i < n; i++)
scanf("%s", map[i]);
memset(vis, 0, sizeof(vis));
memset(cnt, 0, sizeof(cnt));
for(i = 0; i < n; i++)
for(j = 0; j < m; j++)
{
if(map[i][j] == 'X')
{
Node temp;
temp.x = i;
temp.y = j;
Q.push(temp);
vis[i][j] = true;
}
}
BFS();
int ans = 0;
for(i = 0; i < n; i++)
for(j = 0; j < m; j++)
if(map[i][j] == 'X')
ans++;
printf("%d\n", ans);
}
return 0;
}