-
Notifications
You must be signed in to change notification settings - Fork 0
/
poisoneddagger.cpp
67 lines (56 loc) · 1.4 KB
/
poisoneddagger.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>
using namespace std;
// Shortcuts for data types
#define ll long long
#define ull unsigned long long
#define ld long double
// Constants
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;
// Faster I/O
void fastIO() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
// Helper function to check if a given `mid` can cover height `h`
bool canAchieveHeight(ll n, ll h, vector<ll>& seconds, ll mid) {
ll sum = 0;
for (int i = 0; i < n - 1; i++) {
if (mid > seconds[i + 1] - seconds[i]) {
sum += seconds[i + 1] - seconds[i];
} else {
sum += mid;
}
}
sum += mid; // Add the final segment
return sum >= h;
}
int main() {
fastIO();
int t;
cin >> t;
while (t--) {
ll n, h;
cin >> n >> h;
vector<ll> seconds(n);
for (int i = 0; i < n; i++) {
cin >> seconds[i];
}
ll left = 1, right = LINF;
ll ans = 0;
// Binary search to find the minimum `mid` value
while (left <= right) {
ll mid = left + (right - left) / 2;
if (canAchieveHeight(n, h, seconds, mid)) {
ans = mid;
right = mid - 1;
} else {
left = mid + 1;
}
}
cout << ans << endl;
}
return 0;
}