Merge pull request #62 from 24-Algorithm/minjeong

Minjeong / 9월 4주차 / 3문제

Author: zaqquum

minjeong/DFSBFS/2024-09-24-[PGS]-#모음사전.py

@@ -0,0 +1,13 @@
+from itertools import product
+
+def solution(word):
+    answer = 0
+    c_list = ['A', 'E', 'I', 'O', 'U']
+    dictionary = []
+
+    for i in range(1, len(c_list) + 1):
+        for j in product(c_list, repeat=i):
+            dictionary.append(''.join(j))
+    dictionary.sort()
+
+    return dictionary.index(word) + 1

minjeong/DynamicProgramming/2024-09-23-[백준]-#14501-퇴사.py

@@ -0,0 +1,19 @@
+import sys
+input = sys.stdin.readline
+
+# 초기화
+N = int(input())    # 남은 날짜
+t = [0] * (N+1)     # 걸리는 기간 리스트
+p = [0] * (N+1)     # 상담 금액 리스트
+dp = [0] * (N+1)    # DP
+for i in range(1, N+1):
+    t[i], p[i] = map(int, input().split())
+
+# DP 채우기
+for i in range(1, N+1):
+    time, pay = t[i], p[i]
+    day = i + time - 1
+    dp[i] = max(dp[i], dp[i-1])
+    if day <= N:
+        dp[day] = max(dp[day], dp[i - 1] + pay)
+print(dp[-1])

minjeong/Greedy/2024-09-29-[PGS]-#단속카메라.py

@@ -0,0 +1,19 @@
+import heapq
+
+def solution(routes):
+    routes.sort(key=lambda x:x[0])
+
+    answer = 0
+    h = [30001]
+    for r in routes:
+        earliestend = heapq.heappop(h)
+        if r[0] > earliestend:
+            answer += 1
+            h.clear()
+        else:
+            heapq.heappush(h, earliestend)
+        heapq.heappush(h, r[1])
+    else:
+        if len(h) != 0:
+            answer += 1
+    return answer