Merge branch 'main' into 85-tgyuuAn

H0ngJu/README.md

@@ -38,3 +38,4 @@
 | 34차시 | 2024.11.19 |  누적합   |                                               [개똥벌레](https://www.acmicpc.net/problem/3020)                                                | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/256 |
 | 35차시 | 2024.11.23 |    DP     |                                                [전깃줄](https://www.acmicpc.net/problem/2565)                                                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/258 |
 | 36차시 | 2024.12.02 |   수학    |                                               [머리 톡톡](https://www.acmicpc.net/problem/1241)                                               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/260 |
+| 36차시 | 2024.12.31 |  그리디   |                                              [회의실 배정](https://www.acmicpc.net/problem/1931)                                              | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/261 |

H0ngJu/그리디/회의실 배정.py

@@ -0,0 +1,24 @@
+import sys
+
+def input() : return sys.stdin.readline().rstrip()
+
+N = int(input()) # 100000
+info = [tuple(map(int, input().split())) for _ in range(N)]
+
+
+info.sort(key=lambda x: (x[1], x[0]))
+# 최대한 많이 넣으려면 빨리 끝나는 회의들을 정렬을 해야함
+# ** 끝나는 시간이 같은 경우를 고려해야함 **
+
+tmp_a,tmp_b  = info[0][0], info[0][1]
+answer = 1
+
+for i in range(1,N):
+    a = info[i][0]
+    b = info[i][1]
+
+    if a >= tmp_b:
+        tmp_a, tmp_b = a, b
+        answer += 1
+
+print(answer)

H0ngJu/정렬/최소 회의실 개수.py

@@ -0,0 +1,20 @@
+import sys
+import heapq
+
+def input() : return sys.stdin.readline().rstrip()
+
+N = int(input()) # 100000
+info = [tuple(map(int, input().split())) for _ in range(N)]
+room = []
+
+info.sort(key=lambda x: x[0])
+heapq.heappush(room, info[0][1])
+answer = 1
+
+for i in range(1,N):
+    a, b = info[i][0], info[i][1]
+    if a >= room[0]:
+        heapq.heappop(room)
+    heapq.heappush(room, b)
+
+print(len(room))

tgyuuAn/README.md

@@ -87,4 +87,5 @@
 | 83차시 | 2024.12.01 |  수학 + 구현 | <a href="https://www.acmicpc.net/problem/1033">칵테일</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/259
 | 84차시 | 2024.12.31 |  BFS | <a href="https://www.acmicpc.net/problem/4179">불!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/261
 | 85차시 | 2025.01.09 |  다익스트라 + 이분 탐색 | <a href="https://www.acmicpc.net/problem/1800">인터넷 설치</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/264
+| 86차시 | 2025.01.16 |  이분 탐색  | <a href="https://www.acmicpc.net/problem/1114">통나무 자르기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/265
 ---

tgyuuAn/이분 탐색/통나무 자르기.py

@@ -0,0 +1,43 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+L, K, C = map(int, input().split())
+cut_points = sorted(list(map(int, input().split())))
+cut_points = [0] + cut_points + [L]
+
+def check(max_len):
+    cuts = 0
+    last_cut = L
+    for i in range(len(cut_points) - 1, 0, -1):
+        if cut_points[i] - cut_points[i - 1] > max_len:
+            return False
+        if last_cut - cut_points[i - 1] > max_len:
+            cuts += 1
+            last_cut = cut_points[i]
+    return cuts <= C
+
+left, right = 1, L
+answer = L
+while left <= right:
+    mid = (left + right) // 2
+    if check(mid):
+        answer = mid
+        right = mid - 1
+    else:
+        left = mid + 1
+
+cuts = 0
+last_cut = L
+first_cut = None
+for i in range(len(cut_points) - 1, 0, -1):
+    if last_cut - cut_points[i - 1] > answer:
+        cuts += 1
+        last_cut = cut_points[i]
+        if C == cuts:
+            first_cut = cut_points[i]
+
+if first_cut is None:
+    first_cut = cut_points[1]
+
+print(answer, first_cut)