86-tgyuuAn

tgyuuAn/README.md

@@ -65,8 +65,6 @@
 | 61차시 | 2024.06.20 |  크루스칼  | <a href="https://www.acmicpc.net/problem/1774">우주신과의 교감</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/212
 | 62차시 | 2024.07.01 |  DP  | <a href="https://www.acmicpc.net/problem/1949">우수 마을</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/214
 | 63차시 | 2024.07.08 |  BFS  | <a href="https://www.acmicpc.net/problem/3108">로고</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/216
-| 62차시 | 2024.07.01 |  DP  | <a href="https://www.acmicpc.net/problem/1949">우수 마을</a> | https://github.com/AlgoLeadMe/AlgoLeadMse-1/pull/214
-| 63차시 | 2024.07.08 |  BFS  | <a href="https://www.acmicpc.net/problem/3108">로고</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/216
 | 64차시 | 2024.07.12 |  최소 공통 조상  | <a href="https://www.acmicpc.net/problem/11812">K진 트리</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/217
 | 65차시 | 2024.07.19 |  최소 공통 조상  | <a href="https://www.acmicpc.net/problem/3584">가장 가까운 공통 조상</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/220
 | 66차시 | 2024.07.22 |  DP  | <a href="https://www.acmicpc.net/problem/2169">로봇 조종하기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/222
@@ -88,4 +86,5 @@
 | 82차시 | 2024.11.22 |  희소 배열  | <a href="https://www.acmicpc.net/problem/17435">합성함수와 쿼리</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/257
 | 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
+| 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)