Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 38 additions & 0 deletions Programmers/Level3/86053_금과_은_운반하기.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
/*
⭐️ 문제 정보 ⭐️
문제 : 86053 - 금과 은 운반하기
레벨 : Level 3
링크 : https://school.programmers.co.kr/learn/courses/30/lessons/86053
*/

// ANCHOR 2026.02.01 풀이
// 이분탐색
function solution(a, b, g, s, w, t) {
// time 시간 안에 모든 도시에서 필요한 광물들을 운반할 수 있는지를 확인
function check(time) {
const cityCount = g.length;
let gold = 0, silver = 0, total = 0;
for (let i = 0; i < cityCount; i++) {
// time 시간 안에 "운반"할 수 있는 최대 횟수
const maxDeliveries = Math.floor(time / (2 * t[i])) + (time % (2 * t[i]) >= t[i] ? 1 : 0);
// time 시간 안에 운반할 수 있는 광물의 최대 양
const cap = maxDeliveries * w[i];

gold += Math.min(g[i], cap);
silver += Math.min(s[i], cap);
total += Math.min(g[i] + s[i], cap);
}

return gold >= a && silver >= b && total >= a + b;
}

// 이분탐색
let left = 0, right = 10 ** 15;
while (left < right) {
const mid = Math.floor((right + left) / 2);
if (check(mid)) right = mid;
else left = mid + 1;
}

return left;
}
1 change: 1 addition & 0 deletions Programmers/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -62,6 +62,7 @@
| 77486 | 다단계 칫솔 판매 | [77486_다단계_칫솔_판매.js](Level3/77486_다단계_칫솔_판매.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/77486) |
| 77885 | 2개 이하로 다른 비트 | [77885_2개_이하로_다른_비트.js](Level2/77885_2개_이하로_다른_비트.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/77885) |
| 81303 | 표 편집 | [81303_표_편집.js](Level3/81303_표_편집.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/81303) |
| 86053 | 금과 은 운반하기 | [86053_금과_은_운반하기.js](Level3/86053_금과_은_운반하기.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/86053) |
| 87390 | n^2 배열 자르기 | [87390_n^2_배열_자르기.js](Level2/87390_n^2_배열_자르기.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/87390) |
| 92334 | 신고 결과 받기 | [92334_신고_결과_받기.js](Level1/92334_신고_결과_받기.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/92334) |
| 92341 | 주차 요금 계산 | [92341_주차_요금_계산.js](Level2/92341_주차_요금_계산.js) | [🔗](https://school.programmers.co.kr/learn/courses/30/lessons/92341) |
Expand Down