1233. 全球变暖
摘要
Title: 1233. 全球变暖
Tag: BFS、DFS
Memory Limit: 64 MB
Time Limit: 1000 ms
Powered by:NEFU AB-IN
1233. 全球变暖
-
题意
见原题
-
思路
对于每个连通块，判断其中每个点，是否周围有海洋，有就是被覆盖了，如果这个连通块中所有点都被覆盖，那么就是完全淹没
DFS又爆栈，最喜欢用的爆搜遇到python都要被换
-
代码
BFS
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52'''
Author: NEFU AB-IN
Date: 2022-03-29 17:23:48
FilePath: \ACM\Acwing\1223.py
LastEditTime: 2022-03-29 17:25:34
'''
from collections import deque
N = int(1e3 + 10)
g = []
st = [[0] * N for _ in range(N)]
ans = 0
dir = [[-1, 0], [1, 0], [0, 1], [0, -1]]
def judge(x, y):
for i in range(4):
a = x + dir[i][0]
b = y + dir[i][1]
if g[a][b] == '.':
return 0
return 1
def bfs(sx, sy):
global flag
st[sx][sy] = 1
q = deque()
q.appendleft([sx, sy])
while q:
sx, sy = q.pop()
if judge(sx, sy):
flag = 1
for i in range(4):
x = sx + dir[i][0]
y = sy + dir[i][1]
if x >= 0 and x < n and y >= 0 and y < n and g[x][y] == '#' and st[x][y] == 0:
q.appendleft([x, y])
st[x][y] = 1
n = int(input())
for i in range(n):
g.append(list(input()))
for i in range(n):
for j in range(n):
if g[i][j] == '#' and st[i][j] == 0:
flag = 0
bfs(i, j)
if flag == 0: ans += 1
print(ans)
DFS
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47'''
Author: NEFU AB-IN
Date: 2022-03-29 17:23:48
FilePath: \ACM\Acwing\1223.py
LastEditTime: 2022-03-29 17:25:34
'''
N = int(1e3 + 10)
g = []
st = [[0] * N for _ in range(N)]
ans = 0
dir = [[-1, 0], [1, 0], [0, 1], [0, -1]]
def judge(x, y):
for i in range(4):
a = x + dir[i][0]
b = y + dir[i][1]
if g[a][b] == '.':
return 0
return 1
def dfs(sx, sy):
global ans, flag
st[sx][sy] = 1
if judge(sx, sy):
flag = 1
for i in range(4):
x = sx + dir[i][0]
y = sy + dir[i][1]
if x >= 0 and x < n and y >= 0 and y < n and g[x][y] == '#' and st[x][
y] == 0:
dfs(x, y)
n = int(input())
for i in range(n):
g.append(list(input()))
for i in range(n):
for j in range(n):
if g[i][j] == '#' and st[i][j] == 0:
flag = 0
dfs(i, j)
if flag == 0: ans += 1
print(ans)