洛谷P1331–海战
bfs模板题
一.题意
题目的要求是找到图中有多少个矩形并输出其数量,假如有一个不是矩形就输出Bad placement.
二.分析
既然是要求矩形的数量,可以利用bfs去搜索图,然后利用面积来判断是否是矩形:(行最大值减行最小值 + 1) * (列最大值减列最小值 + 1)== 当前联通的‘#’的数量
三.代码
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
char mp[maxn][maxn];
int n,m,cnt,flag;
bool vis[maxn][maxn];
int nxt[4][2] = {{1,0},{-1,0},{0,-1},{0,1}};
queue<pair<int,int> > q;
bool bfs(int x,int y){
int mx = x,my = y,mix = x,miy = y, num = 1;
vis[x][y] = true;
while(!q.empty()) q.pop();
q.push(make_pair(x,y));
while(!q.empty()){
int nx = q.front().first;
int ny = q.front().second;
q.pop();
for(int i = 0; i < 4; i++){
int dx = nx + nxt[i][0];
int dy = ny + nxt[i][1];
if(dx < 1 || dx > n || dy < 1 || dy > m || mp[dx][dy] == '.' || vis[dx][dy]) continue;
vis[dx][dy] = true;
mx = max(dx,mx), my = max(my,dy), mix = min(mix,dx), miy = min(miy,dy);
num++;
q.push(make_pair(dx,dy));
}
}
if((mx - mix + 1) * (my - miy + 1) == num) return true;
else
return false;
}
int main(){
scanf("%d%d",&n,&m);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++)
scanf(" %c",&mp[i][j]);
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(mp[i][j] == '#' && !vis[i][j] && !flag){
if(bfs(i,j)) cnt++;
else flag = 1;
}
}
}
if(!flag)
printf("There are %d ships.\n",cnt);
else
printf("Bad placement.\n");
return 0;
}