洛谷 P5198 [USACO19JAN]Icy Perimeter S （尚贤）

https://www.luogu.com.cn/problem/P5198

粑粑： 难度 提高+/省选- （孩子做的第三题这个难度，加油）

#include <cstdio>
#include <string>
#include <iostream>
#include <queue>
using namespace std;
int n, walk[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
string map[1005];
bool vis[1005][1005];
struct node{
	int number1, number2;
	node(){}
	node(const int &x, const int &y) {
		number1 = x, number2 = y;
	}
};
struct node2{
	int x, y;
	node2(){}
	node2(const int &xx, const int &yy){
		x = xx, y = yy;
	}
};
node bfs(const int &x, const int &y);
int main() { 
	scanf("%d", &n);
	map[n + 1] += ".";
	map[0] += ".";
	for (int i = 1; i <= n; ++i) {
		string temp;
		cin >> temp;
		map[i] = "." + temp + ".";
		map[n + 1] += ".";
		map[0] += ".";
	}
	node ans = node(-1, -1);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			if (map[i][j] == '#' && !vis[i][j]) {
				node temp = bfs(i, j);
				if (temp.number1 == ans.number1) {
					if (temp.number2 < ans.number2) {
						ans = temp;
					}
				} else if (temp.number1 > ans.number1) {
					ans = temp;
				}
			}
		}
	}
	printf("%d %d\n", ans.number1, ans.number2);
	return 0;
}

node bfs(const int &x, const int &y) {
	node ans = node(1, 0);
	queue<node2> a;
	vis[x][y] = true;
	a.push(node2(x, y));
	while (!a.empty()) {
		node2 now = a.front();
		a.pop();
		for (int i = 0; i < 4; ++i) {
			int nx = now.x + walk[i][0];
			int ny = now.y + walk[i][1];
			if (map[nx][ny] == '#' && !vis[nx][ny]) {
				a.push(node2(nx, ny));
				++ans.number1;
				vis[nx][ny] = true;
			} else if (map[nx][ny] == '.') {
				++ans.number2;
			}
		}
	}
	return ans;
}