Submission #1113268

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1113268	2024-11-16T09:24:52 Z	stdfloat	Bigger segments (IZhO19_segments)	C++17	37 / 100	1500 ms	3408 KB

segments

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;

#define sz(v)	(int)(v).size()
#define all(v)	(v).begin(), (v).end()
 
#define ff  first
#define ss  second
#define pii pair<int, int>
 
#define all(v) (v).begin(), (v).end()
 
int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
 
	int n;
	cin >> n;
 
	vector<int> a(n);
	for (auto &i : a)
		cin >> i;
 
	vector<ll> p(n);
	for (int i = 0; i < n; i++)
		p[i] = (i ? p[i - 1] : 0) + a[i];

	vector<ll> dp = p;
	for (int i = 1; i < n; i++) {
		vector<ll> u(sz(dp));
		for (int j = 0; j < sz(dp); j++)
			u[j] = dp[j] + p[j];

		// cout << "\ni " << i << endl;
		// for (auto j : u)
		// 	cout << j << ' ';
		// cout << endl;

		// for (auto j : u)
		// 	cout << j << ' ';
		// cout << endl;
		// assert(is_sorted(all(u)));

		for (int j = sz(dp) - 1; j >= 0; j--) {
			dp[j] = (ll)1e18;

			// if (p[j] < u[0]) continue;

			// int t = upper_bound(u.begin(), u.begin() + j, p[j]) - u.begin() - 1;

			// dp[j] = p[j] - p[t];
			// cout << "\nj " << j << ' ' << t << ' ' << p[t] << ' ' << p[j] << ' ' << p[j] - p[t] << endl;

			for (int k = j; k > 0; k--) {
				if (dp[k - 1] <= p[j] - p[k - 1]) {
					// cout << "k " << k << ' ' << sm << endl;
					dp[j] = p[j] - p[k - 1]; break;
				}
			}
		}

		while (!dp.empty() && dp[0] == (ll)1e18) {
			dp.erase(dp.begin());
			p.erase(p.begin());
		}

		if (dp.empty()) return cout << i, 0;
	}

	cout << n;
}

Subtask #1
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct

Subtask #2
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	2 ms	336 KB	Output is correct
19	Correct	6 ms	336 KB	Output is correct
20	Correct	2 ms	464 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	460 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	8 ms	472 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	2 ms	472 KB	Output is correct
30	Correct	3 ms	336 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	2 ms	336 KB	Output is correct
19	Correct	6 ms	336 KB	Output is correct
20	Correct	2 ms	464 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	460 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	8 ms	472 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	2 ms	472 KB	Output is correct
30	Correct	3 ms	336 KB	Output is correct
31	Correct	5 ms	560 KB	Output is correct
32	Correct	8 ms	336 KB	Output is correct
33	Correct	21 ms	692 KB	Output is correct
34	Correct	1088 ms	552 KB	Output is correct
35	Correct	34 ms	336 KB	Output is correct
36	Correct	18 ms	336 KB	Output is correct
37	Correct	12 ms	336 KB	Output is correct
38	Correct	9 ms	336 KB	Output is correct
39	Correct	18 ms	552 KB	Output is correct
40	Correct	18 ms	576 KB	Output is correct
41	Correct	33 ms	336 KB	Output is correct
42	Correct	754 ms	544 KB	Output is correct
43	Correct	487 ms	540 KB	Output is correct
44	Correct	29 ms	560 KB	Output is correct
45	Correct	90 ms	336 KB	Output is correct

Subtask #4
0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	2 ms	336 KB	Output is correct
19	Correct	6 ms	336 KB	Output is correct
20	Correct	2 ms	464 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	460 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	8 ms	472 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	2 ms	472 KB	Output is correct
30	Correct	3 ms	336 KB	Output is correct
31	Correct	5 ms	560 KB	Output is correct
32	Correct	8 ms	336 KB	Output is correct
33	Correct	21 ms	692 KB	Output is correct
34	Correct	1088 ms	552 KB	Output is correct
35	Correct	34 ms	336 KB	Output is correct
36	Correct	18 ms	336 KB	Output is correct
37	Correct	12 ms	336 KB	Output is correct
38	Correct	9 ms	336 KB	Output is correct
39	Correct	18 ms	552 KB	Output is correct
40	Correct	18 ms	576 KB	Output is correct
41	Correct	33 ms	336 KB	Output is correct
42	Correct	754 ms	544 KB	Output is correct
43	Correct	487 ms	540 KB	Output is correct
44	Correct	29 ms	560 KB	Output is correct
45	Correct	90 ms	336 KB	Output is correct
46	Execution timed out	1561 ms	3408 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	456 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	456 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	504 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	2 ms	336 KB	Output is correct
19	Correct	6 ms	336 KB	Output is correct
20	Correct	2 ms	464 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	460 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	2 ms	504 KB	Output is correct
27	Correct	8 ms	472 KB	Output is correct
28	Correct	2 ms	336 KB	Output is correct
29	Correct	2 ms	472 KB	Output is correct
30	Correct	3 ms	336 KB	Output is correct
31	Correct	5 ms	560 KB	Output is correct
32	Correct	8 ms	336 KB	Output is correct
33	Correct	21 ms	692 KB	Output is correct
34	Correct	1088 ms	552 KB	Output is correct
35	Correct	34 ms	336 KB	Output is correct
36	Correct	18 ms	336 KB	Output is correct
37	Correct	12 ms	336 KB	Output is correct
38	Correct	9 ms	336 KB	Output is correct
39	Correct	18 ms	552 KB	Output is correct
40	Correct	18 ms	576 KB	Output is correct
41	Correct	33 ms	336 KB	Output is correct
42	Correct	754 ms	544 KB	Output is correct
43	Correct	487 ms	540 KB	Output is correct
44	Correct	29 ms	560 KB	Output is correct
45	Correct	90 ms	336 KB	Output is correct
46	Execution timed out	1561 ms	3408 KB	Time limit exceeded
47	Halted	0 ms	0 KB	-

Submission #1113268

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 36.0

Subtask #5 0 / 27.0

Subtask #1
13.0 / 13.0

Subtask #2
14.0 / 14.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 36.0

Subtask #5
0 / 27.0