蓝桥杯c++组 2018 大学B组 9.全球变暖

题目大意
给定二维char数组，’.‘代表海洋，’#‘代表土地，连片（四方向）的土地记为一个岛屿，全球变暖后，若’#‘周围有’.’（四方向），则会变成’.’
求被淹没的岛屿数
————————————
我的做法是先dfs求出被水淹没前的岛屿数bf，再遍历模拟淹没过程，再dfs求出淹没后的岛屿数，输出两者之差

个人感觉这种方法并非最简，但是最容易想到。

#include <iostream>
#include <algorithm>
using namespace std;
int n;
const int N = 1e3 + 7;
char a[N][N];
bool vis[N][N];
int d[4][2] = { 0,1,0,-1,1,0,-1,0 };
int bf, at;
void dfs(int w, int e) {
	if (a[w][e] == '#')vis[w][e] = 1;
	else return;
	for (int i = 0; i < 4; ++i) {
		int nx = w + d[i][0];
		int ny = e + d[i][1];
		if (!vis[nx][ny] && nx >= 1 && nx <= n && ny >= 1 && ny <= n) {
			dfs(nx, ny);
		}
	}
	return;
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)for (int j = 1; j <= n; j++)cin >> a[i][j];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (a[i][j] == '#'&&!vis[i][j]) {
				dfs(i, j);
				bf++;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (a[i][j] == '#') {
				bool ck = true;
				for (int k = 0; k < 4; ++k) {
					int nx = i + d[k][0];
					int ny = j + d[k][1];
					if (a[nx][ny] == '.') {
						ck = false;
						break;
					}
				}
				if (ck)a[i][j] = '*';
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (a[i][j] == '#')a[i][j] = '.';
			else if (a[i][j] == '*')a[i][j] = '#';
		}
	}
	memset(vis, 0, sizeof(vis));
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			if (a[i][j] == '#' && !vis[i][j]) {
				dfs(i, j);
				at++;
			}
		}
	}
	cout << bf - at << '\n';
	return 0;
}