蓝桥三十一天刷题（python组）||第十九天

灌溉

题目

求解

模拟法。

n,m=map(int,input().split())
t=int(input())
old=[[0 for i in range(m)] for j in range(n)]
new=[[0 for i in range(m)] for j in range(n)]
location=[[0,0]]
for _ in range(t):
    r,c=map(int,input().split())
    old[r-1][c-1]=1
k=int(input())
for _ in range(k):
    for i in range(n):
        for j in range(m):
            if old[i][j]==1:
                new[i][j]=1
                if i+1<=n-1:
                    new[i+1][j]=1
                if j+1<=m-1:
                    new[i][j+1]=1
                if j>=1:
                    new[i][j-1]=1
                if i>=1:
                    new[i-1][j]=1
    old=new;

cnt=0
for i in range(n):
    for j in range(m):
        if old[i][j]==1:
            cnt+=1
print(cnt)

鸽鸽。。。