답안 #523231

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
523231	2022-02-07T08:47:34 Z	boykut	금 캐기 (IZhO14_divide)	C++14	48 / 100	1000 ms	2664 KB

divide

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef tree<int, null_type, less<int>,
rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;
	vector<int> x(n), g(n), d(n);
	for (int i = 0; i < n; i++) {
		cin >> x[i] >> g[i] >> d[i];
	}
	vector<long long> pd(n), pg(n);
	for (int i = 0; i < n; i++) {
		pd[i] = d[i];
		pg[i] = g[i];
		if (i)	pd[i] += pd[i - 1],
						pg[i] += pg[i - 1];
	}

	long long ans = 0;
	for (int l = 0; l < n; l++) {
		for (int r = l; r < n; r++) {
			if (pd[r] - (l ? pd[l - 1] : 0LL) >= x[r] - x[l]) {
				ans = max(ans, pg[r] - (l ? pg[l - 1] : 0LL));
			}
		}
	}
	cout << ans << '\n';

	return 0;
}

Subtask #1

17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	312 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	0 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	0 ms	204 KB	Output is correct

Subtask #2

31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	312 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	0 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	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	308 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	1 ms	324 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	268 KB	Output is correct
22	Correct	3 ms	332 KB	Output is correct
23	Correct	11 ms	452 KB	Output is correct
24	Correct	12 ms	480 KB	Output is correct

Subtask #3

0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	312 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	0 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	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	308 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	304 KB	Output is correct
18	Correct	2 ms	332 KB	Output is correct
19	Correct	1 ms	324 KB	Output is correct
20	Correct	2 ms	332 KB	Output is correct
21	Correct	2 ms	268 KB	Output is correct
22	Correct	3 ms	332 KB	Output is correct
23	Correct	11 ms	452 KB	Output is correct
24	Correct	12 ms	480 KB	Output is correct
25	Correct	17 ms	504 KB	Output is correct
26	Correct	61 ms	676 KB	Output is correct
27	Correct	61 ms	716 KB	Output is correct
28	Execution timed out	1010 ms	2664 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-