結果

問題 No.157 2つの空洞
ユーザー McGregorshMcGregorsh
提出日時 2022-06-17 09:59:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 144 ms / 2,000 ms
コード長 3,282 bytes
コンパイル時間 195 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 89,140 KB
最終ジャッジ日時 2024-10-08 06:56:24
合計ジャッジ時間 3,763 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 134 ms
83,328 KB
testcase_01 AC 127 ms
83,320 KB
testcase_02 AC 143 ms
83,260 KB
testcase_03 AC 129 ms
83,456 KB
testcase_04 AC 127 ms
83,328 KB
testcase_05 AC 131 ms
82,816 KB
testcase_06 AC 126 ms
83,200 KB
testcase_07 AC 122 ms
83,328 KB
testcase_08 AC 123 ms
82,816 KB
testcase_09 AC 121 ms
82,816 KB
testcase_10 AC 121 ms
82,816 KB
testcase_11 AC 122 ms
83,200 KB
testcase_12 AC 122 ms
82,944 KB
testcase_13 AC 123 ms
83,328 KB
testcase_14 AC 124 ms
82,912 KB
testcase_15 AC 143 ms
89,140 KB
testcase_16 AC 126 ms
83,200 KB
testcase_17 AC 144 ms
89,088 KB
testcase_18 AC 123 ms
83,044 KB
testcase_19 AC 138 ms
83,200 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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()
0