Skip to content

Commit eb33bc4

Browse files
authored
Create maximize-the-minimum-game-score.cpp
1 parent d2cc03a commit eb33bc4

File tree

1 file changed

+43
-0
lines changed

1 file changed

+43
-0
lines changed
+43
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
// Time: O(n * log(m * r))
2+
// Space: O(1)
3+
4+
// binary search, greedy
5+
class Solution {
6+
public:
7+
long long maxScore(vector<int>& points, int m) {
8+
const auto& ceil_divide = [](int64_t a, int64_t b) {
9+
return (a + b - 1) / b;
10+
};
11+
12+
const auto& binary_search_right = [&](int64_t left, int64_t right, const auto& check) {
13+
while (left <= right) {
14+
const auto mid = left + (right - left) / 2;
15+
if (!check(mid)) {
16+
right = mid - 1;
17+
} else {
18+
left = mid + 1;
19+
}
20+
}
21+
return right;
22+
};
23+
24+
const auto& check = [&](int64_t x) {
25+
for (int64_t i = 0, prev = 0, cnt = 0; i < size(points); ++i) {
26+
const auto remain = ceil_divide(x, points[i]) - prev;
27+
if (remain >= 1) {
28+
prev = remain - 1;
29+
cnt += 2 * remain - 1;
30+
} else if (i != size(points) - 1) {
31+
prev = 0;
32+
++cnt;
33+
}
34+
if (cnt > m) {
35+
return false;
36+
};
37+
}
38+
return true;
39+
};
40+
41+
return binary_search_right(1, static_cast<int64_t>(ranges::max(points)) * m, check);
42+
}
43+
};

0 commit comments

Comments
 (0)