結果
問題 | No.157 2つの空洞 |
ユーザー | tonnnura172 |
提出日時 | 2020-05-05 20:54:21 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 30 ms / 2,000 ms |
コード長 | 1,404 bytes |
コンパイル時間 | 602 ms |
コンパイル使用メモリ | 11,088 KB |
実行使用メモリ | 9,692 KB |
最終ジャッジ日時 | 2023-09-09 10:38:53 |
合計ジャッジ時間 | 2,083 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 29 ms
9,648 KB |
testcase_01 | AC | 28 ms
9,692 KB |
testcase_02 | AC | 28 ms
9,488 KB |
testcase_03 | AC | 28 ms
9,652 KB |
testcase_04 | AC | 29 ms
9,476 KB |
testcase_05 | AC | 28 ms
9,532 KB |
testcase_06 | AC | 29 ms
9,688 KB |
testcase_07 | AC | 28 ms
9,644 KB |
testcase_08 | AC | 28 ms
9,664 KB |
testcase_09 | AC | 29 ms
9,564 KB |
testcase_10 | AC | 28 ms
9,488 KB |
testcase_11 | AC | 28 ms
9,640 KB |
testcase_12 | AC | 29 ms
9,664 KB |
testcase_13 | AC | 29 ms
9,640 KB |
testcase_14 | AC | 29 ms
9,544 KB |
testcase_15 | AC | 30 ms
9,496 KB |
testcase_16 | AC | 29 ms
9,484 KB |
testcase_17 | AC | 28 ms
9,500 KB |
testcase_18 | AC | 28 ms
9,560 KB |
testcase_19 | AC | 28 ms
9,648 KB |
ソースコード
import sys, re from collections import deque, defaultdict, Counter from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd, log from itertools import accumulate, permutations, combinations, product from operator import itemgetter, mul, add from copy import deepcopy from string import ascii_lowercase, ascii_uppercase, digits from bisect import bisect, bisect_left from heapq import heappush, heappop from functools import reduce, lru_cache def input(): return sys.stdin.readline().strip() def INT(): return int(input()) def MAP(): return map(int, input().split()) def LIST(): return list(map(int, input().split())) def ZIP(n): return zip(*(MAP() for _ in range(n))) sys.setrecursionlimit(10 ** 9) INF = float('inf') mod = 10 ** 9 + 7 W, H = MAP() C = [input() for _ in range(H)] dx = [0, -1, 0, 1] dy = [1, 0, -1, 0] check = [[False]*W for _ in range(H)] hole = [] for i in range(H): for j in range(W): if check[i][j] or C[i][j] == "#": continue ret = [] q = deque([(i, j)]) check[i][j] = True while q: y, x = q.popleft() ret.append((y, x)) for k in range(4): ny = y+dy[k] nx = x+dx[k] if check[ny][nx] == False and C[ny][nx] != "#": q.append((ny, nx)) check[ny][nx] = True hole.append(ret) ans = INF for x in product(hole[0], hole[1]): y1, x1 = x[0] y2, x2 = x[1] dist = abs(y2-y1)+abs(x2-x1) ans = min(ans, dist) print(ans-1)