| 提出番号 | 2055 |
|---|---|
| 提出者 | nadare881 |
| 言語 | Python3 |
| 提出日時 | 2018-08-04 15:07:12 |
| 問題名 | (69)机の配置 |
| 結果 | WA |
| 点数 | 0% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | WA | 0% | 17ms | 32544KB |
| 2 | WA | 0% | 21ms | 33664KB |
| 3 | WA | 0% | 23ms | 32784KB |
| 4 | WA | 0% | 21ms | 32672KB |
| 5 | WA | 0% | 17ms | 32896KB |
| 6 | WA | 0% | 23ms | 32640KB |
| 7 | WA | 0% | 21ms | 33424KB |
| 8 | WA | 0% | 23ms | 32672KB |
| 9 | WA | 0% | 22ms | 33264KB |
| 10 | WA | 0% | 17ms | 33360KB |
| 11 | WA | 0% | 24ms | 32960KB |
| 12 | WA | 0% | 20ms | 33696KB |
| 13 | WA | 0% | 17ms | 32864KB |
| 14 | WA | 0% | 21ms | 32704KB |
| 15 | WA | 0% | 21ms | 32864KB |
| 16 | WA | 0% | 25ms | 32736KB |
| 17 | WA | 0% | 17ms | 32544KB |
| 18 | WA | 0% | 21ms | 33328KB |
| 19 | WA | 0% | 22ms | 32752KB |
| 20 | WA | 0% | 22ms | 33344KB |
| 21 | WA | 0% | 19ms | 33360KB |
| 22 | WA | 0% | 21ms | 32928KB |
| 23 | WA | 0% | 21ms | 32864KB |
| 24 | WA | 0% | 17ms | 33328KB |
| 25 | WA | 0% | 18ms | 33456KB |
| 26 | WA | 0% | 23ms | 32736KB |
| 27 | WA | 0% | 20ms | 32880KB |
| 28 | WA | 0% | 17ms | 33440KB |
| 29 | WA | 0% | 23ms | 32784KB |
| 30 | WA | 0% | 21ms | 33680KB |
# -*- coding: utf-8 -*-
N, H, W = map(int, input().split())
F = []
def parse(L):
f = []
t = 0
for l in L:
if l == "#":
if t != 0:
f.append(t)
t = -1
t += 1
if t != 0:
f.append(t)
return f
S = [input() for _ in range(H)]
for s in S:
F.append(parse(s))
ans = [0]
for n in range(1, N+1):
tmp = 0
for f in F:
for s in f:
tmp += s//n
ans.append(tmp)
F = []
for s in list(zip(*S)):
F.append(parse(s))
for n in range(1, N+1):
tmp = 0
for f in F:
for s in f:
tmp += s//n
print(max(tmp, ans[n]))