Submission #384565

# Submission time Handle Problem Language Result Execution time Memory
384565 2021-04-01T20:52:30 Z ritul_kr_singh Divide and conquer (IZhO14_divide) C++17
100 / 100
38 ms 3436 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

signed main(){
	cin.tie(0)->sync_with_stdio(0);

	int n, ans = 0; cin >> n;
	vector<int> a(n+1), b(n+1), c(n+1), d(n+1);
	for(int i=1; i<=n; ++i){
		cin >> c[i] >> b[i] >> a[i];
		ans = max(ans, b[i]);
		a[i] += a[i-1];
		b[i] += b[i-1];
	}
	for(int i=0; i<n; ++i) a[i] -= c[i+1];
	for(int i=0; i<=n; ++i) d[i] = a[i];
	for(int i=1; i<=n; ++i) d[i] = min(d[i], d[i-1]);

	for(int i=1; i<=n; ++i){
		int sub = (i < n ?  c[i+1] : 0LL);
		int low = 0, high = i;
		while(low<high){
			int mid = (low+high)/2;
			if(d[mid] <= a[i] + sub - c[i]) high = mid;
			else low = mid+1;
		}
		ans = max(ans, b[i] - b[low]);
	}
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 4 ms 492 KB Output is correct
24 Correct 3 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 4 ms 492 KB Output is correct
24 Correct 3 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 4 ms 620 KB Output is correct
27 Correct 4 ms 620 KB Output is correct
28 Correct 17 ms 2048 KB Output is correct
29 Correct 19 ms 1900 KB Output is correct
30 Correct 38 ms 3436 KB Output is correct
31 Correct 31 ms 3436 KB Output is correct
32 Correct 32 ms 3436 KB Output is correct
33 Correct 31 ms 3436 KB Output is correct
34 Correct 34 ms 3436 KB Output is correct
35 Correct 35 ms 3436 KB Output is correct
36 Correct 36 ms 3436 KB Output is correct