oj.uz

Submission #337827

# Submission time Handle Problem Language Result Execution time Memory
337827 2020-12-21T20:01:50 Z Tosic Divide and conquer (IZhO14_divide) C++14
100 / 100
 40 ms 9320 KB 
#include <bits/stdc++.h>
#define maxn 100010

using namespace std;

long long n, ans, p[maxn], eSum[maxn], goldSum[maxn], g[maxn], e[maxn], sufM;
vector<pair<long long, int> > sufV;

int main(){
	ios_base::sync_with_stdio(0);
	cout.tie(0);
	cin.tie(0);
	cin >> n;
	for(int i = 1; i <= n; ++i){
		cin >> p[i] >> g[i] >> e[i];
		goldSum[i] = goldSum[i-1]+g[i];
		eSum[i] = eSum[i-1] + e[i];
	}
	sufM = -1e9;
	for(int i = n; i > 0; --i){
		sufM = max(sufM, eSum[i]-p[i]);
		sufV.push_back(make_pair(sufM,i));
		int tmp = (*(lower_bound(sufV.begin(), sufV.end(), make_pair(eSum[i-1]-p[i], 0)))).second;
		//cerr << tmp << '\n';
		ans = max(ans, goldSum[tmp]-goldSum[i-1]);
	}
	cout << ans;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 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 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 3 ms 876 KB Output is correct
24 Correct 2 ms 896 KB Output is correct

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 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 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 3 ms 876 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 876 KB Output is correct
26 Correct 3 ms 1260 KB Output is correct
27 Correct 4 ms 1328 KB Output is correct
28 Correct 18 ms 4460 KB Output is correct
29 Correct 20 ms 4844 KB Output is correct
30 Correct 40 ms 9320 KB Output is correct
31 Correct 33 ms 8168 KB Output is correct
32 Correct 34 ms 8296 KB Output is correct
33 Correct 33 ms 8040 KB Output is correct
34 Correct 34 ms 8040 KB Output is correct
35 Correct 36 ms 8552 KB Output is correct
36 Correct 37 ms 8808 KB Output is correct