题目
这是距离拿满最近的一道题目……
这里需要注意的是里面需要用in操作,记录树的位置的集合时可以用set,不要用list!会超时!
哎当时对python使用的不熟,就差三个字母,就拿上分了……
代码
n,l,s = map(int,input().split())
tree_set = set()
for i in range(n):
tree_set.add(tuple(map(int,input().split())))
graph = [[] for i in range(s+1)]
for i in range(s,-1,-1):
graph[i] = list(map(int,input().split()))
num = 0
for x,y in tree_set:
if x+s > l or y+s>l:
continue
flag = 1
for i in range(s+1):
for j in range(s+1):
if ((x+i,y+j) in tree_set and graph[i][j] != 1) or ((x+i,y+j) not in tree_set and graph[i][j] == 1):
flag = 0
break
if flag == 0:
break
if flag == 1:
num += 1
print(num)