結果
問題 | No.697 池の数はいくつか |
ユーザー | McGregorsh |
提出日時 | 2023-07-05 21:41:01 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
MLE
|
実行時間 | - |
コード長 | 2,060 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 10,980 KB |
実行使用メモリ | 668,060 KB |
最終ジャッジ日時 | 2023-09-26 22:14:33 |
合計ジャッジ時間 | 17,630 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 33 ms
14,524 KB |
testcase_01 | AC | 32 ms
10,100 KB |
testcase_02 | AC | 32 ms
10,124 KB |
testcase_03 | AC | 32 ms
10,096 KB |
testcase_04 | AC | 33 ms
10,160 KB |
testcase_05 | AC | 33 ms
10,148 KB |
testcase_06 | AC | 33 ms
10,252 KB |
testcase_07 | AC | 32 ms
10,268 KB |
testcase_08 | AC | 33 ms
10,160 KB |
testcase_09 | AC | 33 ms
10,096 KB |
testcase_10 | AC | 33 ms
10,164 KB |
testcase_11 | AC | 32 ms
10,092 KB |
testcase_12 | AC | 32 ms
10,084 KB |
testcase_13 | AC | 32 ms
10,108 KB |
testcase_14 | AC | 32 ms
10,172 KB |
testcase_15 | AC | 33 ms
10,148 KB |
testcase_16 | AC | 32 ms
10,120 KB |
testcase_17 | AC | 33 ms
10,076 KB |
testcase_18 | AC | 33 ms
10,124 KB |
testcase_19 | AC | 33 ms
10,128 KB |
testcase_20 | AC | 33 ms
10,088 KB |
testcase_21 | AC | 32 ms
10,156 KB |
testcase_22 | AC | 32 ms
9,992 KB |
testcase_23 | AC | 32 ms
10,088 KB |
testcase_24 | AC | 894 ms
26,888 KB |
testcase_25 | AC | 895 ms
27,048 KB |
testcase_26 | AC | 895 ms
26,960 KB |
testcase_27 | AC | 881 ms
26,904 KB |
testcase_28 | AC | 901 ms
26,860 KB |
testcase_29 | MLE | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): H, W = i_map() A = [i_list() for i in range(H)] juge = [[False] * W for i in range(H)] for i in range(H): for j in range(W): if A[i][j] == 1: juge[i][j] = True def dfs(x, y): move = [[0, 1], [0, -1], [1, 0], [-1, 0]] for a, b in move: nx = x + a ny = y + b if not (0<=nx<H and 0<=ny<W): continue if juge[nx][ny] == False: continue juge[nx][ny] = False dfs(nx, ny) ans = 0 for i in range(H): for j in range(W): if juge[i][j]: dfs(i, j) ans += 1 #print(juge) print(ans) if __name__ == '__main__': main()