제출 #91610

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
91610		model_code	Collecting Mushrooms (NOI18_collectmushrooms)	Cpython 3	100 / 100	1036 ms	27912 KiB

mushrooms

import sys

header_line = sys.stdin.readline()
header_line = header_line.split(" ")
R = int(header_line[0])
C = int(header_line[1])
D = int(header_line[2])
K = int(header_line[3])
G = []
for i in range(R):
	G.append(sys.stdin.readline())

P = []
for i in range(R + 1):
	P_row = []
	for j in range(C + 1):
		P_row.append(0)
	P.append(P_row)

for i in range(R):
	for j in range(C):
		if G[i][j] == 'S':
			li = max(0, i - D)
			hi = min(R - 1, i + D)
			lj = max(0, j - D)
			hj = min(C - 1, j + D)
			P[li][lj] += 1
			P[li][hj + 1] -= 1
			P[hi + 1][lj] -= 1
			P[hi + 1][hj + 1] += 1

for i in range(1, R):
	for j in range(C):
		P[i][j] += P[i - 1][j]
for i in range(R):
	for j in range(1, C):
		P[i][j] += P[i][j - 1]


ans = 0
for i in range(R):
	for j in range(C):
		if G[i][j] == 'M' and P[i][j] >= K:
			ans += 1
			
print(ans)

• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 23 / 23
• Subtask 5: 19 / 19
• Subtask 6: 21 / 21