Merge branch 'main' into 9-H0ngJu

H0ngJu/README.md

@@ -9,6 +9,7 @@
 | 5차시 | 2024.03.16 |   구현   |                 [요세푸스 문제](https://www.acmicpc.net/problem/1158)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/161 |
 | 6차시 | 2024.03.19 |   스택   |                    [오큰수](https://www.acmicpc.net/problem/17298)                    | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/164 |
 | 7차시 | 2024.03.22 |    DP    |                 [1,2,3 더하기](https://www.acmicpc.net/problem/9095)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/166 |
+| 8차시 | 2024.03.16 |    DP    |                 [쉬운 계단 수](https://www.acmicpc.net/problem/10844)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/170 |
 | 9차시 | 2024.03.22 |    DP    |                  [RGB거리 2](https://www.acmicpc.net/problem/17404)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/172 |
 
 ---

H0ngJu/쉬운 계단 수.py

@@ -0,0 +1,28 @@
+import sys
+
+DIV = 1_000_000_000
+
+N = int(sys.stdin.readline().rstrip())
+
+dp = [[0] * 10 for _ in range(N+1)] 
+answer = 0
+
+for i in range(1,N+1):
+    if i == 1:
+        for k in range(1,10):
+            dp[i][k] = 1
+
+    else:
+        for num in range(10):
+            if num == 0:
+                dp[i][num] = dp[i-1][1]%DIV
+            elif num == 9:
+                dp[i][num] = dp[i-1][8]%DIV
+            else:
+                dp[i][num] = (dp[i-1][num-1] + dp[i-1][num+1])%DIV
+
+for k in range(10):
+    answer += dp[N][k]
+
+print(answer%DIV)
+

Munbin-Lee/README.md

@@ -38,5 +38,6 @@
 | 35차시 | 2024.02.18 |  백트래킹  | <a href="https://www.acmicpc.net/problem/24891">단어 마방진</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/140 |
 | 36차시 | 2024.02.21 |  문자열  | <a href="https://www.acmicpc.net/problem/15927">회문은 회문아니야!!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/143 |
 | 37차시 | 2024.03.05 |  백트래킹  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/250136">석유 시추</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/150 |
-| 37차시 | 2024.03.08 |  트라이  | <a href="https://www.acmicpc.net/problem/5052">전화번호 목록</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/155 |
+| 38차시 | 2024.03.08 |  트라이  | <a href="https://www.acmicpc.net/problem/5052">전화번호 목록</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/155 |
+| 39차시 | 2024.03.14 |  문자열  | <a href="https://www.acmicpc.net/problem/1050">물약</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/160 |
 ---

Munbin-Lee/문자열/39-물약.py

@@ -0,0 +1,45 @@
+stdin = open(0)
+
+def input():
+    return stdin.readline().rstrip()
+
+N, M = map(int, input().split())
+
+prices = {}
+
+for _ in range(N):
+    item, price = input().split()
+    prices[item] = int(price)
+
+recipes = []
+
+for _ in range(M):
+    target, formula = input().split('=')
+    terms = formula.split('+')
+    recipes.append([target, terms])
+
+def updatePrice(target, terms):
+    price = 0
+
+    for term in terms:
+        count = int(term[0])
+        item = term[1:]
+
+        if item not in prices:
+            return
+
+        price += count * prices[item]
+
+    if target not in prices or prices[target] > price:
+        prices[target] = price
+
+for _ in range(M):
+    for recipe in recipes:
+        updatePrice(recipe[0], recipe[1])
+
+if 'LOVE' not in prices:
+    print('-1')
+    exit()
+
+answer = min(prices['LOVE'], 1000000001)
+print(answer)

pknujsp/BRUTE_FORCE/38-자물쇠와 열쇠.py

@@ -0,0 +1,50 @@
+# 자물쇠의 중간 부분이 모두 1인지 확인
+def is_valid(new_lock):
+    length = len(new_lock) // 3
+
+    for r in range(length, length * 2):
+        for c in range(length, length * 2):
+            if new_lock[r][c] != 1:
+                return False
+
+    return True
+
+def solution(key, lock):
+    n = len(lock)
+    k = len(key)
+    new_lock = [[0] * (n * 3) for _ in range(n * 3)]
+
+    for r in range(n):
+        for c in range(n):
+            new_lock[r + n][c + n] = lock[r][c]
+
+    for _ in range(4):
+        rev_key = key[::-1]
+        key = []
+        for c in range(k):
+            row = []
+            for r in range(k):
+                row.append(rev_key[r][c])
+            key.append(row)
+
+        """
+        열쇠를 돌리는 로직은 한 줄로도 구현가능 합니다
+        key = [row for row in zip(*reversed(key))]
+        """
+
+        for r in range(n * 2):
+            for c in range(n * 2):
+                # 자물쇠에 열쇠를 끼운다
+                for i in range(k):
+                    for j in range(k):
+                        new_lock[r + i][c + j] += key[i][j]
+
+                # 자물쇠에 열쇠가 딱 들어갔는지 확인
+                if is_valid(new_lock):
+                    return True
+
+                # 자물쇠에서 열쇠를 빼서 복구시킨다
+                for i in range(k):
+                    for j in range(k):
+                        new_lock[r + i][c + j] -= key[i][j]
+    return False

pknujsp/README.md

@@ -38,4 +38,8 @@
 | 34차시 | 2024.02.12 |       BFS       |                        [이분 그래프](https://www.acmicpc.net/problem/1707)                        | [#135](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/135) |
 | 35차시 | 2024.02.18 |     그리디      |                         [선물할인](https://www.acmicpc.net/problem/25947)                         | [#137](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/137) |
 | 36차시 | 2024.02.21 |    이진탐색     |                       [휴게소 세우기](https://www.acmicpc.net/problem/1477)                       | [#143](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/143) |
-| 37차시 | 2024.03.04 |      구현       |         [n+1 카드게임](https://school.programmers.co.kr/learn/courses/30/lessons/258707)          | [#149](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/149) |
+| 37차시 | 2024.03.04 |      구현       |         [n+1 카드게임](https://school.programmers.co.kr/learn/courses/30/lessons/258707)          | [#149](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/149) |
+| 38차시 | 2024.03.08 |   BRUTE_FORCE   |         [자물쇠와 열쇠](https://school.programmers.co.kr/learn/courses/30/lessons/60059)          | [#154](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/154) |
+| 39차시 | 2024.03.19 |       큐        |        [디스크 컨트롤러](https://school.programmers.co.kr/learn/courses/30/lessons/42627)         | [#163](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/163) |
+| 40차시 | 2024.03.22 |     그리디      |                           [센서](https://www.acmicpc.net/problem/2212)                            | [#168](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/168) |
+| 41차시 | 2024.03.25 |   다익스트라    |                         [알고스팟](https://www.acmicpc.net/problem/1261)                          | [#169](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/169) |

pknujsp/그리디/40-센서.py

@@ -0,0 +1,18 @@
+from sys import *
+
+N = int(stdin.readline())
+K = int(stdin.readline())
+SENSORS = sorted(set(map(int, stdin.readline().split())))
+
+if K >= N:
+    print(0)
+    exit()
+
+distances = [SENSORS[i] - SENSORS[i - 1] for i in range(1, len(SENSORS))]
+distances.sort(reverse=True)
+
+result = 0
+for i in range(K - 1, len(distances)):
+    result += distances[i]
+
+print(result)

pknujsp/다익스트라/41-알고스팟.py

@@ -0,0 +1,33 @@
+from heapq import *
+from sys import *
+
+C, R = map(int, stdin.readline().split())
+arr = [list(map(int, list(stdin.readline().strip()))) for _ in range(R)]
+
+drc = ((1,0),(-1,0),(0,1),(0,-1))
+visited = [[False] * C for _ in range(R)]
+heap = [(0, 0, 0)]
+target_r = R - 1
+target_c = C - 1
+
+while heap:
+    cost, r, c = heappop(heap)
+
+    if r == target_r and c == target_c:
+        print(cost)
+        break
+    if visited[r][c]:
+        continue      
+
+    visited[r][c] = True
+
+    for dr, dc in drc:
+        nr = r + dr
+        nc = c + dc
+
+        if not 0 <= nr < R or not 0 <= nc < C:
+            continue
+        if visited[nr][nc]:
+            continue
+
+        heappush(heap, (cost + arr[nr][nc], nr, nc))

pknujsp/큐/39-디스크 컨트롤러.py

@@ -0,0 +1,24 @@
+from heapq import *
+from collections import *
+
+def solution(jobs):
+    jobs = deque(sorted(jobs))
+    jobs_num = len(jobs) 
+
+    curr_time = wait_time = 0
+    heap = []
+
+    while heap or jobs:
+        while jobs and jobs[0][0] <= curr_time:
+            requested_time, duration = jobs.popleft()
+            heappush(heap, (duration, requested_time))
+
+        if heap:
+            duration, requested_time = heappop(heap)
+
+            curr_time += duration
+            wait_time += curr_time - requested_time
+        else:
+            curr_time += 1
+
+    return wait_time // jobs_num

tgyuuAn/BFS/열쇠.py

@@ -0,0 +1,97 @@
+import sys 
+from collections import deque, defaultdict
+
+def input(): return sys.stdin.readline().rstrip()
+
+dx = [0, 0, -1, 1]
+dy = [-1, 1, 0, 0]
+
+T = int(input())
+
+for _ in range(T):
+
+    H, W = map(int, input().split())
+    building = [["." for _ in range(W+2)]]
+    door_info = defaultdict(set)
+    keys_i_have = set()
+
+    for row in range(H):
+        _input = "."
+        _input += input()
+        _input += "."
+
+        for col in range(W+2):
+            if _input[col] not in ("*", ".", "$") and _input[col].isupper():
+                door_info[_input[col]].add((row+1, col))
+
+        building.append(list(_input))
+
+    building.append(["." for _ in range(W+2)])
+
+    keys_info = input()
+    if keys_info != "0":
+        keys_i_have.update(set(keys_info))
+
+    answer = 0
+    visited = set()
+    locked_doors_to_access = set()
+
+    deq = deque([(0, 0)])
+    while deq:
+        now_row, now_col = deq.popleft()
+
+        for dir in range(4):
+            new_row = now_row + dy[dir]
+            new_col = now_col + dx[dir]
+
+            if new_row < 0 or new_row >= H+2: continue
+            if new_col < 0 or new_col >= W+2: continue
+            if (new_row, new_col) in visited: continue
+            if building[new_row][new_col] == "*": continue
+
+            # print(now_row, now_col,building[new_row][new_col])
+            # print(locked_doors_to_access)
+            # print(keys_i_have)
+            # print()
+
+            if building[new_row][new_col] == "$":
+                answer += 1
+                visited.add((new_row, new_col))
+                deq.append((new_row, new_col))
+                continue
+
+            # 문을 만났을 경우, 이 때 까지 얻은 열쇠로 열 수 있는 지 확인함. 아닐 경우 접근할 수 있는 문 목록에 추가
+            if building[new_row][new_col].isalpha() and building[new_row][new_col].isupper():
+
+                # 열쇠를 이미 가지고 있는 경우
+                if building[new_row][new_col].lower() in keys_i_have:
+                    building[new_row][new_col] = "."
+                    visited.add((new_row, new_col))
+                    deq.append((new_row, new_col))
+
+                # 열쇠가 없어서 문을 못 열 경우 접근할 수 있는 문 목록에 추가
+                else: locked_doors_to_access.add((new_row, new_col))
+
+                continue
+
+            # 열쇠를 획득했을 경우, 이 때 까지 만난 문들 중에 열 수 있는 것들을 queue에 넣음
+            if building[new_row][new_col].isalpha() and building[new_row][new_col].islower():
+                keys_i_have.add(building[new_row][new_col])
+                visited.add((new_row, new_col))
+                deq.append((new_row, new_col))
+
+                for can_open_row, can_open_col in door_info[building[new_row][new_col].upper()]:
+                    if (can_open_row, can_open_col) in locked_doors_to_access:
+                        building[can_open_row][can_open_col] = "."
+                        visited.add((can_open_row, can_open_col))
+                        deq.append((can_open_row, can_open_col))
+                        locked_doors_to_access.discard((can_open_row, can_open_col))
+
+                continue
+
+            # 빈 공간일 경우, 그냥 지나감
+            if building[new_row][new_col] == ".":
+                visited.add((new_row, new_col))
+                deq.append((new_row, new_col))
+
+    print(answer)

tgyuuAn/DP/KCM Travel.py

@@ -0,0 +1,30 @@
+from collections import defaultdict, deque
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+T = int(input())
+for _ in range(T):
+    N, M, K = map(int, input().split())
+
+    costs = [[int(1e9) for _ in range(M+1)] for _ in range(N+1)]
+    costs[1][0] = 0
+
+    graph = [[] for _ in range(N+1)]
+    for _ in range(K):
+        start, destination, cost, duration = map(int,input().split())
+        graph[start].append((destination, cost, duration))
+
+    # print(edges)
+
+    for cost in range(M+1):
+        for city in range(1, N):
+            if costs[city][cost] == int(1e9): continue
+
+            for now_destination, now_cost, now_duration in graph[city]:
+
+                if now_cost + cost <= M and costs[now_destination][cost + now_cost] > costs[city][cost] + now_duration: 
+                    costs[now_destination][cost + now_cost] = costs[city][cost] + now_duration
+
+    result = min(costs[N])
+    print(result) if result != int(1e9) else print("Poor KCM")