P1506 拯救oibh总部(洛谷 BFS)

#include<bits/stdc++.h>
using namespace std;
const int N = 1000;
//提前读取 * 的个数 在最外围建立额外 0 圈 方便BFS 
struct Node{
	int x;
	int y;
};

int dir[][2] = {{0,1},{1,0},{0,-1},{-1,0}};

int n,m,cnt = 0,num_star = 0,ans;
int x,y;
char table[N][N];

int check(Node tmp){
	if(tmp.x < 0 || tmp.x > n + 1)return 0;
	if(tmp.y < 0 || tmp.y > m + 1)return 0;
	return 1;
}

void BFS(int x,int y){
	//int mul = 1,sum = 0;
	bool vis[N][N];
	cnt++;
	vis[x][y] = true;
	
	queue<Node>q;
	
	Node cur,tmp;
	cur.x = x;
	cur.y = y;
	q.push(cur);
	
	while(!q.empty()){
		cur = q.front();
		q.pop();
		
		for(int i = 0;i < 4;i++){
			tmp.x = cur.x + dir[i][0];
			tmp.y = cur.y + dir[i][1];
			
			if(table[tmp.x][tmp.y] == '*')continue;
			
			if(check(tmp) && vis[tmp.x][tmp.y] == false){
				q.push(tmp);
				vis[tmp.x][tmp.y] = true;
				cnt++;
			}
		}
	}
}

int main(){
	cin>>n>>m;
	for(int i = 1;i <= n;i++)
		for(int j = 1;j <= m;j++){
			cin>>table[i][j];
			if(table[i][j] == '*')num_star++;
		}
	
	BFS(0,0);
	
	ans = (n + 2) * (m + 2) - num_star - cnt;
	cout<<ans<<endl;
	return 0;
}