2020-09-08

CCF-CSP 201912-2 回收站选址（python实现） 100分 实现 简单直接

很直接的思想，直接判断， 运行时间150ms 上下

n = int(input())
b=[0]*5
a=[]

for i in range(n):
    a.append(tuple(map(int,input().split())))

for x,y in a:
    i=0
    if ((x+1,y) in a)  and ((x-1,y) in a) and ((x,y+1) in a) and ((x,y-1) in a):
        if ((x+1,y+1) in a):
            i+=1
        if ((x+1,y-1) in a):
            i+=1
        if((x-1,y+1) in a):
            i+=1
        if ((x-1,y-1) in a):
            i+=1

        b[i]+=1

for i in b:
    print(i)