难度指数:⭐⭐
知识点: BFS
2023华为od机试真题B卷【矩阵中非1的元素个数】Python
Mine:
代码实现
from time import time
def solve():
return 0
def solve0():
nums[0][0] = 1
res = 1
def span(i, j):
if not 0 <= i < m or not 0 <= j < n or nums[i][j] == 2 or nums[i][j] == 1: return 0
else:
nums[i][j] = 1
res = 1
res += span(i - 1, j) + span(i, j + 1) + span(i + 1, j) + span(i, j - 1)
return res
res += span(0, 1) + span(1, 0)
return m * n - res
T = 1
while T:
m, n = list(map(int, input().split(' ')))
nums = [list(map(int, input().split(' '))) for _ in range(m)]
t1 = time()
res = solve()
t2 = time()
res0 = solve0()
t3 = time()
print(res, res0)
print(t3 - t2, t2 - t1)
T -= 1