結果
| 問題 |
No.697 池の数はいくつか
|
| ユーザー |
|
| 提出日時 | 2023-01-27 19:24:55 |
| 言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 1,674 bytes |
| コンパイル時間 | 86 ms |
| コンパイル使用メモリ | 12,672 KB |
| 実行使用メモリ | 159,392 KB |
| 最終ジャッジ日時 | 2024-06-28 04:46:41 |
| 合計ジャッジ時間 | 13,748 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 TLE * 1 -- * 5 |
ソースコード
from collections import deque
from itertools import combinations, product
def main():
H, W = map(int, input().split())
field_map = tuple(tuple(map(int, input().split())) for _ in range(H))
searched = [[0]*W for _ in range(H)]
pond_ctr = 0
for height_idx, width_idx in product(range(H), range(W)):
if field_map[height_idx][width_idx] == 0:
continue
if searched[height_idx][width_idx] == 1:
continue
pond_ctr += 1
searching = deque(((height_idx, width_idx),))
searched[height_idx][width_idx] = 1
while searching:
current_h_idx, current_w_idx = searching.popleft()
if field_map[current_h_idx][current_w_idx] == 0:
continue
if current_h_idx < H-1 and searched[current_h_idx+1][current_w_idx] == 0:
searching.append((current_h_idx+1, current_w_idx))
searched[current_h_idx+1][current_w_idx] = 1
if current_h_idx > 0 and searched[current_h_idx-1][current_w_idx] == 0:
searching.append((current_h_idx-1, current_w_idx))
searched[current_h_idx-1][current_w_idx] = 1
if current_w_idx < W-1 and searched[current_h_idx][current_w_idx+1] == 0:
searching.append((current_h_idx, current_w_idx+1))
searched[current_h_idx][current_w_idx+1] = 1
if current_w_idx > 0 and searched[current_h_idx][current_w_idx-1] == 0:
searching.append((current_h_idx, current_w_idx-1))
searched[current_h_idx][current_w_idx-1] = 1
print(pond_ctr)
if __name__ == "__main__":
main()