結果
問題 | No.697 池の数はいくつか |
ユーザー |
|
提出日時 | 2023-01-27 19:22:30 |
言語 | Python3 (3.11.2 + numpy 1.24.2 + scipy 1.10.1) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,668 bytes |
コンパイル時間 | 90 ms |
コンパイル使用メモリ | 10,916 KB |
実行使用メモリ | 160,668 KB |
最終ジャッジ日時 | 2023-09-10 13:15:33 |
合計ジャッジ時間 | 13,322 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 19 ms
8,624 KB |
testcase_01 | AC | 20 ms
8,572 KB |
testcase_02 | AC | 19 ms
8,624 KB |
testcase_03 | AC | 18 ms
8,716 KB |
testcase_04 | AC | 18 ms
8,584 KB |
testcase_05 | AC | 19 ms
8,760 KB |
testcase_06 | AC | 19 ms
8,592 KB |
testcase_07 | AC | 19 ms
8,556 KB |
testcase_08 | AC | 19 ms
8,744 KB |
testcase_09 | AC | 19 ms
8,584 KB |
testcase_10 | AC | 19 ms
8,548 KB |
testcase_11 | AC | 19 ms
8,552 KB |
testcase_12 | AC | 18 ms
8,580 KB |
testcase_13 | AC | 19 ms
8,572 KB |
testcase_14 | AC | 19 ms
8,624 KB |
testcase_15 | AC | 18 ms
8,740 KB |
testcase_16 | AC | 18 ms
8,728 KB |
testcase_17 | AC | 18 ms
8,544 KB |
testcase_18 | AC | 19 ms
8,580 KB |
testcase_19 | AC | 18 ms
8,764 KB |
testcase_20 | AC | 19 ms
8,700 KB |
testcase_21 | AC | 19 ms
8,728 KB |
testcase_22 | AC | 20 ms
8,668 KB |
testcase_23 | AC | 18 ms
8,736 KB |
testcase_24 | AC | 622 ms
25,396 KB |
testcase_25 | AC | 621 ms
25,320 KB |
testcase_26 | AC | 627 ms
25,280 KB |
testcase_27 | AC | 621 ms
25,360 KB |
testcase_28 | AC | 618 ms
25,404 KB |
testcase_29 | TLE | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
ソースコード
from collections import deque from itertools import combinations, product def main(): H, W = map(int, input().split()) field_map = [list(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()