提出 #8599357
ソースコード 拡げる
H, W, K = map(int, input().split())
cake = [input() for _ in range(H)]
# 答え
memo = [[0] * W for _ in range(H)]
#print(memo)
# 行にケーキが何個あるか
cake_count_row = [0] * H
for y in range(H):
count = 0
for x in range(W):
if cake[y][x] == "#":
count += 1
cake_count_row[y] = count
# イチゴがある行について色塗り
count = 1
for y in range(H):
first = True
if cake_count_row[y] == 0:
continue
for x in range(W):
if cake[y][x] == "#":
if first:
first = False
else:
count += 1
memo[y][x] = count
count += 1
# イチゴがない行について色塗り
# 上から下に
for y in range(1, H):
if cake_count_row[y] == 0:
for x in range(W):
memo[y][x] = memo[y-1][x]
# 下から上に
for y in range(H-1)[::-1]:
if cake_count_row[y] == 0:
for x in range(W):
memo[y][x] = memo[y+1][x]
# 出力
for i in range(H):
print(" ".join(list(map(str, memo[i]))))
提出情報
| 提出日時 | |
|---|---|
| 問題 | C - Strawberry Cakes |
| ユーザ | lzhjiuzhi |
| 言語 | Python (3.4.3) |
| 得点 | 400 |
| コード長 | 1102 Byte |
| 結果 | AC |
| 実行時間 | 81 ms |
| メモリ | 7284 KiB |
ジャッジ結果
| セット名 | Sample | All | ||||
|---|---|---|---|---|---|---|
| 得点 / 配点 | 0 / 0 | 400 / 400 | ||||
| 結果 |
|
|
| セット名 | テストケース |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, sample_01.txt, sample_02.txt, sample_03.txt |
| ケース名 | 結果 | 実行時間 | メモリ |
|---|---|---|---|
| in01.txt | AC | 18 ms | 3064 KiB |
| in02.txt | AC | 18 ms | 3064 KiB |
| in03.txt | AC | 18 ms | 3064 KiB |
| in04.txt | AC | 18 ms | 3064 KiB |
| in05.txt | AC | 18 ms | 3064 KiB |
| in06.txt | AC | 17 ms | 3064 KiB |
| in07.txt | AC | 18 ms | 3064 KiB |
| in08.txt | AC | 18 ms | 3064 KiB |
| in09.txt | AC | 17 ms | 3064 KiB |
| in10.txt | AC | 18 ms | 3064 KiB |
| in11.txt | AC | 18 ms | 3064 KiB |
| in12.txt | AC | 17 ms | 3064 KiB |
| in13.txt | AC | 18 ms | 3064 KiB |
| in14.txt | AC | 18 ms | 3064 KiB |
| in15.txt | AC | 17 ms | 3064 KiB |
| in16.txt | AC | 18 ms | 3064 KiB |
| in17.txt | AC | 72 ms | 5104 KiB |
| in18.txt | AC | 69 ms | 4980 KiB |
| in19.txt | AC | 74 ms | 5108 KiB |
| in20.txt | AC | 68 ms | 4980 KiB |
| in21.txt | AC | 73 ms | 4212 KiB |
| in22.txt | AC | 65 ms | 4212 KiB |
| in23.txt | AC | 18 ms | 3064 KiB |
| in24.txt | AC | 18 ms | 3064 KiB |
| in25.txt | AC | 74 ms | 4084 KiB |
| in26.txt | AC | 75 ms | 4084 KiB |
| in27.txt | AC | 18 ms | 3064 KiB |
| in28.txt | AC | 65 ms | 4596 KiB |
| in29.txt | AC | 72 ms | 5492 KiB |
| in30.txt | AC | 74 ms | 6388 KiB |
| in31.txt | AC | 79 ms | 6896 KiB |
| in32.txt | AC | 76 ms | 7028 KiB |
| in33.txt | AC | 81 ms | 7156 KiB |
| in34.txt | AC | 81 ms | 7284 KiB |
| in35.txt | AC | 75 ms | 4212 KiB |
| in36.txt | AC | 78 ms | 4212 KiB |
| in37.txt | AC | 79 ms | 4332 KiB |
| in38.txt | AC | 79 ms | 4328 KiB |
| sample_01.txt | AC | 17 ms | 3064 KiB |
| sample_02.txt | AC | 17 ms | 3064 KiB |
| sample_03.txt | AC | 18 ms | 3064 KiB |