Submission #685888

# Submission time Handle Problem Language Result Execution time Memory
685888 2023-01-25T03:05:28 Z GudStonks Divide and conquer (IZhO14_divide) C++17
100 / 100
32 ms 6232 KB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ft first
#define sd second
const ll MOD = 1e9+7;
ll n, ans, pr[200005], p[200005], d[200005], g[200005];

void fun(){
	cin>>n;
	for(ll i = 1, a, b, c, l = 0; i <= n; i++){
		cin>>a>>b>>c;
		if(i == 1)l = a;
		pr[i] = pr[i - 1] + c - (a - l);
		p[i] = c;
		d[i] = (a - l);
		g[i] = b + g[i - 1];
		l = a;
	}
	for(ll i = n - 1; i; i--)pr[i] = max(pr[i], pr[i + 1]);
	for(ll i = 1, sum = 0; i <= n; i++){
		ll l = i, r = n, res = 0;
		while(r >= l){
			ll m = (l + r) / 2;
			if(pr[m] - sum >= 0)
				l = m + 1, res = m;
			else
				r = m - 1;
		}
		ans = max(ans, g[res] - g[i - 1]);
		sum += p[i] - d[i + 1];
	}
	cout<<ans<<endl;
}

int  main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int ttt = 1;
	//cin>>ttt;
	while(ttt--)fun();
}


# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 3 ms 844 KB Output is correct
28 Correct 14 ms 2832 KB Output is correct
29 Correct 15 ms 3148 KB Output is correct
30 Correct 32 ms 6232 KB Output is correct
31 Correct 27 ms 5076 KB Output is correct
32 Correct 27 ms 5168 KB Output is correct
33 Correct 27 ms 5056 KB Output is correct
34 Correct 28 ms 5064 KB Output is correct
35 Correct 27 ms 5480 KB Output is correct
36 Correct 32 ms 5732 KB Output is correct