oj.uz

Submission #526246

# Submission time Handle Problem Language Result Execution time Memory
526246 2022-02-14T03:55:56 Z maks007 Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 2228 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(void) {
	int n;
	cin >> n;
	vector <pair <int,pair <int,int>>> a;
	for(int i = 0; i < n; i ++) {
		int d, x, y;
		cin >> d >> x >> y;
		a.push_back({d, {y, x}});
	}
	vector <int> gold(n), energy(n);
	gold[0] = a[0].second.second;
	energy[0] = a[0].second.first;
	for(int i = 1; i < n; i ++) {
		gold[i] = gold[i - 1] + a[i].second.second;
		energy[i] = energy[i - 1] + a[i].second.first;
	}
	int mx = 0;
	for(int i = 0; i < n; i ++) {
		mx = max(mx, a[i].second.second);
		for(int j = i + 1; j < n; j ++) {
			if(a[i].first + energy[j] >= a[j].first + (i-1<0?0:energy[i-1])) {
				mx = max(mx, gold[j] - (i-1 < 0 ? 0 : gold[i - 1]));
			}
			// cout << cursum << " " << curgold << "\n";
		}
	}
	cout << mx;
	return false;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 15 ms 588 KB Output is correct
24 Correct 15 ms 588 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 3 ms 332 KB Output is correct
23 Correct 15 ms 588 KB Output is correct
24 Correct 15 ms 588 KB Output is correct
25 Correct 28 ms 588 KB Output is correct
26 Correct 71 ms 780 KB Output is correct
27 Correct 68 ms 780 KB Output is correct
28 Execution timed out 1079 ms 2228 KB Time limit exceeded
29 Halted 0 ms 0 KB -