結果
問題 | No.157 2つの空洞 |
ユーザー | McGregorsh |
提出日時 | 2022-06-17 09:59:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 134 ms / 2,000 ms |
コード長 | 3,282 bytes |
コンパイル時間 | 169 ms |
コンパイル使用メモリ | 82,168 KB |
実行使用メモリ | 89,144 KB |
最終ジャッジ日時 | 2024-04-16 23:52:48 |
合計ジャッジ時間 | 3,442 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 114 ms
83,072 KB |
testcase_01 | AC | 117 ms
83,416 KB |
testcase_02 | AC | 119 ms
83,072 KB |
testcase_03 | AC | 118 ms
83,712 KB |
testcase_04 | AC | 115 ms
83,380 KB |
testcase_05 | AC | 111 ms
83,488 KB |
testcase_06 | AC | 115 ms
83,472 KB |
testcase_07 | AC | 114 ms
83,136 KB |
testcase_08 | AC | 113 ms
83,420 KB |
testcase_09 | AC | 120 ms
83,328 KB |
testcase_10 | AC | 118 ms
83,252 KB |
testcase_11 | AC | 120 ms
83,328 KB |
testcase_12 | AC | 117 ms
83,328 KB |
testcase_13 | AC | 118 ms
83,408 KB |
testcase_14 | AC | 117 ms
83,492 KB |
testcase_15 | AC | 134 ms
89,088 KB |
testcase_16 | AC | 115 ms
83,328 KB |
testcase_17 | AC | 134 ms
89,144 KB |
testcase_18 | AC | 116 ms
83,968 KB |
testcase_19 | AC | 117 ms
83,428 KB |
ソースコード
import sys, re 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 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): w, h = i_map() fild = [input() for i in range(h)] juge = [[False] * w for i in range(h)] kuudou1 = [] cou = 0 for i in range(h): for j in range(w): if fild[i][j] == '.' and juge[i][j] == False and cou == 0: kuudou1.append([i, j]) juge[i][j] = True cou += 1 que = deque() que.append([i, j]) move = [[0, 1], [0, -1], [1, 0], [-1, 0]] while que: num1, num2 = que.popleft() for a, b in move: ia = num1 + a jb = num2 + b if not (0<=ia<h and 0<=jb<w): continue if fild[ia][jb] == '#': continue if juge[ia][jb]: continue juge[ia][jb] = True kuudou1.append([ia, jb]) que.append([ia, jb]) kuudou2 = [] for i in range(h): for j in range(w): if fild[i][j] == '.' and juge[i][j] == False and cou == 1: kuudou2.append([i, j]) juge[i][j] = True dque = deque() dque.append([i, j]) move2 = [[0, 1], [0, -1], [1, 0], [-1, 0]] while dque: num3, num4 = dque.popleft() for c, d in move2: ic = num3 + c jd = num4 + d if not (0<=ic<h and 0<=jd<w): continue if fild[ic][jd] == '#': continue if juge[ic][jd]: continue juge[ic][jd] = True kuudou2.append([ic, jd]) dque.append([ic, jd]) ans = INF for i in range(len(kuudou1)): cou1, cou2 = kuudou1[i] for j in range(len(kuudou2)): cou3, cou4 = kuudou2[j] ans = min(ans, abs(cou1-cou3)+abs(cou2-cou4)) print(ans-1) if __name__ == '__main__': main()