Submission #6021737

---

Source Code Expand

import numpy as np
import sys
# 距離K以内にxが居ない
# xからの距離を測る

buf = sys.stdin.buffer
R,C,K = map(int,buf.readline().split())
black = np.ones((R+2,C+2),dtype=np.bool)
black[1:-1,1:] = (np.frombuffer(buf.read(R*(C+1)),dtype='S1') != b'o').reshape(R,C+1)

INF = 10 ** 9
dist = np.zeros((R+2,C+2),dtype=np.int32)
dist[~black] = INF

for n in range(1,R+1):
  np.minimum(dist[n-1]+1,dist[n],out=dist[n])
for n in range(R,0,-1):
  np.minimum(dist[n+1]+1,dist[n],out=dist[n])

for n in range(1,C+1):
  np.minimum(dist[:,n-1]+1,dist[:,n],out=dist[:,n])
for n in range(C,0,-1):
  np.minimum(dist[:,n+1]+1,dist[:,n],out=dist[:,n])

answer = (dist >= K).sum()
print(answer)

Submission Info

Judge Result