"""
https://www.lanqiao.cn/problems/178/learning/?page=1&first_category_id=1&problem_id=178
"""
import os
import sys
# 请在此输入您的代码
sys.setrecursionlimit(60000)
n = int(input())
mp = [list(input()) for i in range(n)]
vis = [[0] * n for i in range(n)] # vis[i][j]=1表示当前陆地已经走过了
ans = 0 # 被淹没的岛屿的数量
dic = [(0, 1), (0, -1), (1, 0), (-1, 0)]
def dfs(x, y):
vis[x][y] = 1 # 标记当前土地
if mp[x][y + 1] == '#' and mp[x][y - 1] == '#' and mp[x + 1][y] == '#' and mp[x - 1][y] == '#':
# 只要有一块陆地四面都是陆地那么当前岛屿就不会被淹没
global flag
flag = 1
# 将四周未遍历的土地继续遍历完, 都打上标记
for i in range(4):
xx = x + dic[i][0]
yy = y + dic[i][1]
if vis[xx][yy] == 0 and mp[xx][yy] == '#':
dfs(xx, yy)
for i in range(n):
for j in range(n):
if vis[i][j] == 0 and mp[i][j] == '#':
# flag表示当前岛屿是否被淹没, flag=0表示被淹没了
flag = 0
dfs(i, j)
if flag == 0:
ans += 1
print(ans)
蓝桥杯-全球变暖
最新推荐文章于 2024-08-15 11:54:48 发布