Submission #526234

# Submission time Handle Problem Language Result Execution time Memory
526234 2022-02-14T02:20:57 Z maks007 Divide and conquer (IZhO14_divide) C++14
48 / 100
1000 ms 2724 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}});
	}
	sort(a.begin(), a.end());
	int mx = 0;
	for(int i = 0; i < n; i ++) {
		int cursum = 0;
		cursum += a[i].second.first;
		int curgold = 0;
		curgold += a[i].second.second;
		mx = max(mx, curgold);
		for(int j = i + 1; j < n; j ++) {
			curgold += a[j].second.second;
			cursum += a[j].second.first;
			if(a[j].first - a[i].first <= cursum) {
				mx = max(mx, curgold);
			}
			// cout << cursum << " " << curgold << "\n";
		}
	}
	cout << mx;
	return false;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 2 ms 332 KB Output is correct
18 Correct 3 ms 308 KB Output is correct
19 Correct 2 ms 304 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 4 ms 304 KB Output is correct
23 Correct 19 ms 652 KB Output is correct
24 Correct 19 ms 664 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 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 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 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 2 ms 332 KB Output is correct
18 Correct 3 ms 308 KB Output is correct
19 Correct 2 ms 304 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 4 ms 304 KB Output is correct
23 Correct 19 ms 652 KB Output is correct
24 Correct 19 ms 664 KB Output is correct
25 Correct 16 ms 588 KB Output is correct
26 Correct 57 ms 908 KB Output is correct
27 Correct 60 ms 908 KB Output is correct
28 Execution timed out 1063 ms 2724 KB Time limit exceeded
29 Halted 0 ms 0 KB -