[BOJ]#7576. 토마토/골드5/50min

https://www.acmicpc.net/problem/7576

Author: zaqquum

Hongjoo/백준/장군.py

@@ -0,0 +1,50 @@
+
+import sys
+from collections import deque
+INF = 1e9
+# 상하좌우
+dy = [-1,1,0,0]
+dx = [0,0,-1,1]
+
+dl= [[-1,1],[1,1],[1,-1],[-1,-1]] # 우상 . 우하 / 좌하 / 좌상
+dl_combined = [0,3,1,2,2,3,0,1]
+sy ,sx= map(int,sys.stdin.readline().split())
+ty,tx = map(int, sys.stdin.readline().split())
+
+field = [[INF]*9 for _ in range(10)]
+field[sy][sx] = 0 
+field[ty][tx] = -1
+
+q = deque()
+q.append([sy,sx])
+
+def check_bound(y,x) :
+  if 0<= y <=9 and 0<= x <=8 and field[y][x]!=-1 : # 기물 x , field 안에 , 방문 상관x => 왕 위치만 안됨x
+    return True
+  return False
+def check_bound2(y,x) :
+  if 0<= y <=9 and 0<= x <=8 : # 기물 가능
+    return True
+  return False
+
+while q : 
+  cy,cx = q.popleft()
+  for i in range(8):
+    ny1, nx1 = cy +dy[i//2] , cx+dx[i//2]
+    ny2, nx2 = ny1 + dl[dl_combined[i]][0] , nx1 + dl[dl_combined[i]][1] 
+    ny3 , nx3 = ny2 + dl[dl_combined[i]][0] , nx2 + dl[dl_combined[i]][1]
+    
+    if check_bound(ny1, nx1) and check_bound(ny2, nx2) and check_bound2(ny3, nx3) : 
+      if ny3 == ty and nx3 == tx : 
+        # print(f"succes====")
+        print(field[cy][cx] +1)
+        
+        exit()
+      elif field[cy][cx] +1 <= field[ny3][nx3] : 
+        field[ny3][nx3] =field[cy][cx] +1 # 업데이트 
+        # print(f"{cy}{cx} -> {i}: {ny1}{nx1} / {ny2}{nx2} / {ny3}, {nx3} => field{field[ny3][nx3]} ")
+       
+        q.append([ny3,nx3])
+        # print(f"{cy}{cx} -> {i}: {ny1}{nx2} / {ny2}{nx2} / {ny3}, {nx3} => field{field[ny3][nx3]} ")
+  
+print(field[ty][tx])

Hongjoo/백준/토마토.py

@@ -0,0 +1,60 @@
+"""
+https://www.acmicpc.net/problem/7576
+# BFS, DFS
+(1) filed 값 중 1인 값 찾기
+(2) 상하좌우로 -1 빼고 확산 
+(3) flag로 해당 이잔 turn에서 확산 유무를 판단 -> 안되면 turn 종료
+
+"""
+# 입력 
+import sys
+from collections import deque
+
+input = sys.stdin.readline
+N,M = map(int, input().split())
+
+field = [list(map(int,input().split())) for _ in range(M) ]
+# print(field) 
+dy = [-1,1,0,0]
+dx = [-0,0,-1,1]
+# BFS
+
+
+lv = 0 
+burn = []
+q = deque()
+for m in range(M) :
+        for n in range(N) :
+            # print(m , n)
+            if field[m][n] == 1: 
+                # 안 익은 토마토 익히기 
+                q.append([m,n])
+                
+while q :
+    # 각 turn 마다 토마도 전염시키기
+
+    # print(f"{t}턴 - {m}{n}")
+    #[2] 익은 토마토 확산시키기
+    # t+= 1
+    y,x = q.popleft()
+    for d in range(4):
+        ny = y + dy[d] ; nx = x + dx[d]
+        if 0<= ny <M and 0 <= nx < N and field[ny][nx] == 0:
+            field[ny][nx] = field[y][x] +1
+            q.append([ny,nx])
+        
+max_num = 0 
+for i in range(M) :
+    for j in range(N):
+        if field[i][j]== 0 : 
+            print(-1)
+            exit()
+        max_num = max(max_num , field[i][j])
+print(max_num-1)
+
+    #             burn.append([n,m])
+    # q = deque()
+    # for sy,sx in burn : 
+    #     q.append([sy,sx])
+    #     while q : 
+