Merge pull request #233 from AlgoLeadMe/24-H0ngJu

24-H0ngJu

H0ngJu/BFS/맥주 마시면서 걸어가기.py

@@ -0,0 +1,45 @@
+import sys
+from collections import deque
+
+def input() : return sys.stdin.readline().rstrip()
+
+t = int(input())
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+
+
+for i in range(t):
+    n = int(input())
+    hx, hy = map(int, input().split())
+    store = [list(map(int, input().split())) for _ in range(n)]
+    fx, fy = map(int, input().split())
+
+    x, y = hx, hy
+    result = "sad"
+
+    q = deque([(x, y, 20)])
+    visited = set([x, y])
+
+    while q:
+        x, y, beer = q.popleft()
+
+        if abs(x-fx) + abs(y-fy) <= 50*beer: # 축제까지 갈 수 있는지
+            result = "happy"
+            break
+
+        for sx, sy in store: # 편의점 들릴 수 있는지
+            if abs(x-sx) + abs(y-sy) <= 50 * beer and (sx, sy) not in visited:
+                visited.add((sx, sy))
+                q.append((sx, sy, 20))
+
+        if beer > 0: # beer 먹고 가기
+            for i in range(4):
+                nx = x + dx[i]
+                ny = y + dy[i]
+
+                if (nx, ny) not in visited:
+                    visited.add((nx, ny))
+                    q.append((nx, ny, beer - 1))
+
+    print(result)
+

H0ngJu/BFS/아기상어.py

@@ -0,0 +1,64 @@
+import sys
+from collections import deque
+
+def input() : return sys.stdin.readline().rstrip()
+
+N = int(input())
+space = [list(map(int, input().split())) for _ in range(N)]
+
+dir = [(0,1), (0,-1), (1,0), (-1,0)]
+x = 0
+y = 0
+
+for i in range(N):
+    for j in range(N):
+        if space[i][j] == 9:
+            x, y = i, j
+            space[x][y] = 0
+
+def check(a, b):
+    if 0<=a<N and 0<=b<N:
+        return True
+    return False
+
+baby = 2
+
+time = 0
+fish = 0
+
+while True:
+    q = deque([(x, y, 0)])
+    visited = [[False] * N for _ in range(N)]
+    visited[x][y] = True
+    min_dis = float('inf')
+    tmp = []
+
+    while q:
+        cx, cy, dis = q.popleft()
+
+        if 0 < space[cx][cy] < baby:
+            if dis < min_dis:
+                min_dis = dis
+                tmp = [(cx, cy)]
+            elif dis == min_dis:
+                tmp.append((cx, cy))
+
+        for dx, dy in dir:
+            nx, ny = cx + dx, cy + dy
+            if check(nx, ny) and not visited[nx][ny] and space[nx][ny] <= baby:
+                visited[nx][ny] = True
+                q.append((nx, ny, dis + 1))
+
+    if not tmp:
+        break
+
+    tx, ty = min(tmp)
+    space[tx][ty] = 0
+    time += min_dis
+    fish += 1
+    if fish == baby:
+        baby += 1
+        fish = 0
+    x, y = tx, ty
+
+print(time)

H0ngJu/README.md

@@ -22,7 +22,8 @@
 | 18차시 | 2024.05.26 |   DFS    |              [계란으로 계란치기](https://www.acmicpc.net/problem/16987)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/199 |
 | 19차시 | 2024.05.31 |    DP    |                    [합분해](https://www.acmicpc.net/problem/2225)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/202 |
 | 20차시 | 2024.06.03 | 백트래킹 |                [스타트와 링크](https://www.acmicpc.net/problem/14889)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/206 |
+| 21차시 | 2024.06.07 |  그리디  |                 [행복 유치원](https://www.acmicpc.net/problem/13164)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/208 |
 
-| 21차시 | 2024.06.07 | 그리디 | [행복 유치원](https://www.acmicpc.net/problem/13164) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/208 |
+| 24차시 | 2024.08.17 | BFS | [아기상어](https://www.acmicpc.net/problem/16236) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/233 |
 
 ---