Merge pull request #37 from YoonYn9915/main

YoonYn9915 / 7월 1주차 / 3문제

Author: Mingguriguri

YoonYn9915/Graph/2024-07-05-[백준]-#11725-트리의 부모 찾기.py

@@ -0,0 +1,39 @@
+from collections import deque, defaultdict
+
+def bfs(graph, start_node, n, answer):
+    queue = deque([start_node])
+    visited = [False] * n
+    visited[start_node] = True
+
+    while queue:
+        current_node = queue.popleft()
+
+        for next_node in graph[current_node]:
+            if not visited[next_node]:
+                queue.append(next_node)
+                visited[next_node] = True
+                answer[next_node] = current_node
+
+    return answer
+
+# 입력값 받기
+n = int(input())
+edges = [list(map(int, input().split())) for _ in range(n - 1)]
+
+# 그래프 초기화 (인접 리스트 사용)
+graph = defaultdict(list)
+
+for edge in edges:
+    node1, node2 = edge
+    graph[node1 - 1].append(node2 - 1)
+    graph[node2 - 1].append(node1 - 1)
+
+# 정답 배열 초기화
+answer = [0] * n
+
+# BFS 실행 (0번 노드를 루트로 설정)
+answer = bfs(graph, 0, n, answer)
+
+# 결과 출력 (루트 노드를 제외한 노드들의 부모 노드를 출력)
+for parent in answer[1:]:
+    print(parent + 1)

YoonYn9915/Graph/2024-07-08-[백준]-#2178-미로찾기.py

@@ -0,0 +1,38 @@
+from collections import deque
+
+
+def bfs(graph, visited):
+    dx = [-1, 1, 0, 0]
+    dy = [0, 0, -1, 1]
+
+    queue = deque([(0, 0, 1)])  # (x, y, distance)
+    visited[0][0] = 1
+
+    while queue:
+        x, y, dist = queue.popleft()
+
+        if x == n - 1 and y == m - 1:
+            return dist
+
+        for i in range(4):
+            row = x + dx[i]
+            col = y + dy[i]
+
+            if 0 <= row < n and 0 <= col < m and visited[row][col] == 0 and graph[row][col] == 1:
+                visited[row][col] = 1
+                queue.append((row, col, dist + 1))
+
+    return -1  # 목적지에 도달할 수 없는 경우
+
+
+n, m = map(int, input().split())
+graph = []
+visited = [[0] * m for _ in range(n)]
+
+for _ in range(n):
+    line = input()
+    graph.append([int(char) for char in line])
+
+min_answer = bfs(graph, visited)
+
+print(min_answer)

YoonYn9915/dp/2024-07-08-[백준]-#2839-설탕배달.py

@@ -0,0 +1,27 @@
+n = int(input())
+
+dp = [-1 for _ in range(5001)]
+dp[3] = 1
+dp[5] = 1
+
+if n <= 5:
+    print(dp[n])
+else:
+    for i in range(6, n + 1):
+        a, b = dp[i], dp[i]
+
+        if dp[i - 5] != -1:
+            a = dp[i - 5]
+        if dp[i - 3] != -1:
+            b = dp[i - 3]
+
+        if a > 0 and b > 0:
+            dp[i] = min(a + 1, b + 1)
+        elif a > 0 and b < 0:
+            dp[i] = a + 1
+        elif a < 0 and b > 0:
+            dp[i] = b + 1
+        else:
+            dp[i] = -1
+
+    print(dp[n])