2024-02-21

AlgoLeadMe · Feb 21, 2024 · 09c5297 · 09c5297
1 parent 7e1d50c
commit 09c5297
Show file tree

Hide file tree

Showing 2 changed files with 33 additions and 2 deletions.
diff --git a/pknujsp/README.md b/pknujsp/README.md
@@ -35,5 +35,6 @@
 | 31차시 | 2024.01.30 |      SORT       |                        [멀티버스 Ⅱ](https://www.acmicpc.net/problem/18869)                        | [#123](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/123) |
 | 32차시 | 2024.02.04 |       BFS       |                        [숨바꼭질 3](https://www.acmicpc.net/problem/13549)                        | [#127](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/127) |
 | 33차시 | 2024.02.06 |       큐        |                           [철로](https://www.acmicpc.net/problem/13334)                           | [#132](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/132) |
-| 34차시 | 2024.02.12 |       BFS        |                           [이분 그래프](https://www.acmicpc.net/problem/1707)                           | [#135](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/135) |
-| 35차시 | 2024.02.18 |       그리디        |                           [선물할인](https://www.acmicpc.net/problem/25947)                           | [#137](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/137) |
+| 34차시 | 2024.02.12 |       BFS       |                        [이분 그래프](https://www.acmicpc.net/problem/1707)                        | [#135](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/135) |
+| 35차시 | 2024.02.18 |     그리디      |                         [선물할인](https://www.acmicpc.net/problem/25947)                         | [#137](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/137) |
+| 36차시 | 2024.02.21 |    이진탐색     |                       [휴게소 세우기](https://www.acmicpc.net/problem/1477)                       | [#143](https://github.com/lgoLeadMe/AlgoLeadMe-1/pull/143) |
diff --git a/pknujsp/이진탐색/36-휴게소 세우기.py b/pknujsp/이진탐색/36-휴게소 세우기.py
@@ -0,0 +1,30 @@
+N, M, L = map(int, input().split())
+array = list(map(int, input().split()))
+array.sort()
+
+left = 1
+right = L - 1
+
+min_max_distance = right
+
+while left <= right:
+    max_distance = (left + right) // 2
+    extra_added = 0
+    last_installed_x = 0
+
+    for installed_x in array:
+        if installed_x - last_installed_x > max_distance:
+            extra_added += (installed_x - last_installed_x - 1) // max_distance
+
+        last_installed_x = installed_x
+
+    if L - last_installed_x > max_distance:
+        extra_added += (L - last_installed_x - 1) // max_distance
+
+    if extra_added > M:
+        left = max_distance + 1
+    else:
+        right = max_distance - 1
+
+print(left)
+