-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1907D.cpp
70 lines (48 loc) · 795 Bytes
/
1907D.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
68
69
70
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
void solve() {
int n;
cin >> n;
vector<pair<int, int>> vp;
for(int i=0; i<n; i++){
int a, b;
cin >> a >> b;
vp.push_back({a, b});
}
int res = 1e9, low = 0, high = 1e9, mid;
auto check = [&](int k){
int x = 0, y = 0;
for(auto [a, b]: vp){
x -= k;
y += k;
x = max(x, a);
y = min(y, b);
if(x > y)
return false;
}
return true;
};
while(low <= high){
int mid = low + (high - low)/2;
if(check(mid)){
res = mid;
high = mid - 1;
}
else {
low = mid + 1;
}
}
cout << res << endl;
return;
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
int t = 1;
cin >> t;
while(t--){
solve();
}
return 0;
}