답안 #1096742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096742	2024-10-05T05:29:41 Z	stdfloat	Bigger segments (IZhO19_segments)	C++17	27 / 100	1500 ms	70992 KB

segments

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

using ll = long long;

#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<vector<ll>> dp(n, vector<ll>(n, LLONG_MAX));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			ll sm = 0;
			for (int k = i; k >= 0; k--) {
				sm += a[k];

				if (j && k && dp[k - 1][j - 1] <= sm) {
					dp[i][j] = sm; break;
				}
			}

			if (!j) dp[i][0] = sm;
		}
	}

	for (int i = 0; i <= n; i++)
		if (i == n || dp[n - 1][i] == LLONG_MAX) return cout << i, 0;
}

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

// using ll = long long;

// int main() {
// 	ios::sync_with_stdio(false); cin.tie(nullptr);

// 	int n;
// 	cin >> n;

// 	vector<int> a(n);
// 	for (auto &i : a)
// 		cin >> i;

// 	int mx = 1;
// 	for (int mk = 0; mk < 1 << n; mk++) {
// 		int cnt = 0;
// 		ll pre_sm = -1, sm = 0;
// 		for (int i = 0; i < n; i++) {
// 			if (!i || (((mk >> i) & 1) != ((mk >> (i - 1)) & 1))) {
// 				if (pre_sm > sm) {
// 					cnt = 0; break;
// 				}

// 				cnt++;
// 				pre_sm = sm; sm = 0;
// 			}

// 			sm += a[i];
// 		}

// 		if (pre_sm <= sm) mx = max(mx, cnt);
// 	}

// 	cout << mx;
// }

Subtask #1
13.0 / 13.0

#	결과	메모리	Grader output
1	Correct	352 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	456 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	344 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	344 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct

Subtask #2
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	68 ms	2396 KB	Output is correct
17	Correct	68 ms	2416 KB	Output is correct
18	Correct	60 ms	2392 KB	Output is correct
19	Correct	38 ms	2392 KB	Output is correct
20	Correct	23 ms	2396 KB	Output is correct
21	Correct	66 ms	2396 KB	Output is correct
22	Correct	29 ms	1624 KB	Output is correct
23	Correct	12 ms	964 KB	Output is correct
24	Correct	65 ms	2396 KB	Output is correct
25	Correct	63 ms	2392 KB	Output is correct
26	Correct	22 ms	2396 KB	Output is correct
27	Correct	56 ms	2396 KB	Output is correct
28	Correct	62 ms	2396 KB	Output is correct
29	Correct	22 ms	2392 KB	Output is correct
30	Correct	29 ms	2396 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	68 ms	2396 KB	Output is correct
17	Correct	68 ms	2416 KB	Output is correct
18	Correct	60 ms	2392 KB	Output is correct
19	Correct	38 ms	2392 KB	Output is correct
20	Correct	23 ms	2396 KB	Output is correct
21	Correct	66 ms	2396 KB	Output is correct
22	Correct	29 ms	1624 KB	Output is correct
23	Correct	12 ms	964 KB	Output is correct
24	Correct	65 ms	2396 KB	Output is correct
25	Correct	63 ms	2392 KB	Output is correct
26	Correct	22 ms	2396 KB	Output is correct
27	Correct	56 ms	2396 KB	Output is correct
28	Correct	62 ms	2396 KB	Output is correct
29	Correct	22 ms	2392 KB	Output is correct
30	Correct	29 ms	2396 KB	Output is correct
31	Execution timed out	1510 ms	70992 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #4
0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	68 ms	2396 KB	Output is correct
17	Correct	68 ms	2416 KB	Output is correct
18	Correct	60 ms	2392 KB	Output is correct
19	Correct	38 ms	2392 KB	Output is correct
20	Correct	23 ms	2396 KB	Output is correct
21	Correct	66 ms	2396 KB	Output is correct
22	Correct	29 ms	1624 KB	Output is correct
23	Correct	12 ms	964 KB	Output is correct
24	Correct	65 ms	2396 KB	Output is correct
25	Correct	63 ms	2392 KB	Output is correct
26	Correct	22 ms	2396 KB	Output is correct
27	Correct	56 ms	2396 KB	Output is correct
28	Correct	62 ms	2396 KB	Output is correct
29	Correct	22 ms	2392 KB	Output is correct
30	Correct	29 ms	2396 KB	Output is correct
31	Execution timed out	1510 ms	70992 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	352 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	456 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	68 ms	2396 KB	Output is correct
17	Correct	68 ms	2416 KB	Output is correct
18	Correct	60 ms	2392 KB	Output is correct
19	Correct	38 ms	2392 KB	Output is correct
20	Correct	23 ms	2396 KB	Output is correct
21	Correct	66 ms	2396 KB	Output is correct
22	Correct	29 ms	1624 KB	Output is correct
23	Correct	12 ms	964 KB	Output is correct
24	Correct	65 ms	2396 KB	Output is correct
25	Correct	63 ms	2392 KB	Output is correct
26	Correct	22 ms	2396 KB	Output is correct
27	Correct	56 ms	2396 KB	Output is correct
28	Correct	62 ms	2396 KB	Output is correct
29	Correct	22 ms	2392 KB	Output is correct
30	Correct	29 ms	2396 KB	Output is correct
31	Execution timed out	1510 ms	70992 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #1096742

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 14.0 / 14.0

Subtask #3 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
0 / 10.0

Subtask #4
0 / 36.0

Subtask #5
0 / 27.0