답안 #653982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
653982	2022-10-29T07:32:59 Z	pavement	Cigle (COI21_cigle)	C++17	100 / 100	195 ms	67452 KB

cigle

#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;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
//~ #define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, ans, p[5005], dp[5005][5005], m[5005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N; i++) {
		cin >> p[i];
		p[i] += p[i - 1];
	}
	for (int j = N; j >= 1; j--) {
		for (int k = N; k > j; k--)
			m[k] = max(m[k + 1], dp[j + 1][k]);
		int ptr = j + 1, sf = 0, cnt = 0;
		for (int i = j; i >= 1; i--) {
			int ans = -1;
			while (ptr <= N && p[ptr] - p[j] < p[j] - p[i - 1]) ptr++;
			if (ptr <= N && p[ptr] - p[j] == p[j] - p[i - 1]) ans = ptr;
			dp[i][j] = sf;
			if (ans != -1) {
				cnt++;
				if (ans + 1 <= N) sf = max(sf, m[ans + 1] + cnt);
			}
		}
	}
	for (int i = 1; i <= N; i++) {
		ans = max(ans, dp[1][i]);
	}
	cout << ans << '\n';
}

Compilation message

cigle.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct

Subtask #2
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	596 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	1 ms	596 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	1 ms	596 KB	Output is correct
19	Correct	1 ms	596 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	2776 KB	Output is correct
2	Correct	3 ms	2772 KB	Output is correct
3	Correct	2 ms	2772 KB	Output is correct
4	Correct	2 ms	2772 KB	Output is correct
5	Correct	3 ms	2772 KB	Output is correct
6	Correct	2 ms	2772 KB	Output is correct
7	Correct	2 ms	2772 KB	Output is correct
8	Correct	3 ms	2772 KB	Output is correct
9	Correct	3 ms	2772 KB	Output is correct
10	Correct	2 ms	2772 KB	Output is correct
11	Correct	3 ms	2772 KB	Output is correct
12	Correct	2 ms	2772 KB	Output is correct

Subtask #4
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	596 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	1 ms	596 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	1 ms	596 KB	Output is correct
19	Correct	1 ms	596 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	4 ms	2776 KB	Output is correct
22	Correct	3 ms	2772 KB	Output is correct
23	Correct	2 ms	2772 KB	Output is correct
24	Correct	2 ms	2772 KB	Output is correct
25	Correct	3 ms	2772 KB	Output is correct
26	Correct	2 ms	2772 KB	Output is correct
27	Correct	2 ms	2772 KB	Output is correct
28	Correct	3 ms	2772 KB	Output is correct
29	Correct	3 ms	2772 KB	Output is correct
30	Correct	2 ms	2772 KB	Output is correct
31	Correct	3 ms	2772 KB	Output is correct
32	Correct	2 ms	2772 KB	Output is correct
33	Correct	2 ms	2772 KB	Output is correct
34	Correct	2 ms	2772 KB	Output is correct
35	Correct	2 ms	2772 KB	Output is correct
36	Correct	2 ms	2772 KB	Output is correct
37	Correct	3 ms	2772 KB	Output is correct
38	Correct	3 ms	2772 KB	Output is correct
39	Correct	2 ms	2772 KB	Output is correct
40	Correct	4 ms	2772 KB	Output is correct
41	Correct	3 ms	2772 KB	Output is correct
42	Correct	2 ms	2772 KB	Output is correct
43	Correct	2 ms	2772 KB	Output is correct
44	Correct	2 ms	2772 KB	Output is correct
45	Correct	2 ms	2772 KB	Output is correct
46	Correct	2 ms	2772 KB	Output is correct
47	Correct	2 ms	2772 KB	Output is correct
48	Correct	2 ms	2772 KB	Output is correct
49	Correct	2 ms	2772 KB	Output is correct

Subtask #5
52.0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	596 KB	Output is correct
11	Correct	1 ms	596 KB	Output is correct
12	Correct	1 ms	596 KB	Output is correct
13	Correct	1 ms	596 KB	Output is correct
14	Correct	1 ms	596 KB	Output is correct
15	Correct	1 ms	596 KB	Output is correct
16	Correct	1 ms	596 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	1 ms	596 KB	Output is correct
19	Correct	1 ms	596 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	4 ms	2776 KB	Output is correct
22	Correct	3 ms	2772 KB	Output is correct
23	Correct	2 ms	2772 KB	Output is correct
24	Correct	2 ms	2772 KB	Output is correct
25	Correct	3 ms	2772 KB	Output is correct
26	Correct	2 ms	2772 KB	Output is correct
27	Correct	2 ms	2772 KB	Output is correct
28	Correct	3 ms	2772 KB	Output is correct
29	Correct	3 ms	2772 KB	Output is correct
30	Correct	2 ms	2772 KB	Output is correct
31	Correct	3 ms	2772 KB	Output is correct
32	Correct	2 ms	2772 KB	Output is correct
33	Correct	2 ms	2772 KB	Output is correct
34	Correct	2 ms	2772 KB	Output is correct
35	Correct	2 ms	2772 KB	Output is correct
36	Correct	2 ms	2772 KB	Output is correct
37	Correct	3 ms	2772 KB	Output is correct
38	Correct	3 ms	2772 KB	Output is correct
39	Correct	2 ms	2772 KB	Output is correct
40	Correct	4 ms	2772 KB	Output is correct
41	Correct	3 ms	2772 KB	Output is correct
42	Correct	2 ms	2772 KB	Output is correct
43	Correct	2 ms	2772 KB	Output is correct
44	Correct	2 ms	2772 KB	Output is correct
45	Correct	2 ms	2772 KB	Output is correct
46	Correct	2 ms	2772 KB	Output is correct
47	Correct	2 ms	2772 KB	Output is correct
48	Correct	2 ms	2772 KB	Output is correct
49	Correct	2 ms	2772 KB	Output is correct
50	Correct	184 ms	67224 KB	Output is correct
51	Correct	181 ms	67308 KB	Output is correct
52	Correct	173 ms	67280 KB	Output is correct
53	Correct	173 ms	67268 KB	Output is correct
54	Correct	173 ms	67312 KB	Output is correct
55	Correct	181 ms	67300 KB	Output is correct
56	Correct	195 ms	67344 KB	Output is correct
57	Correct	189 ms	67244 KB	Output is correct
58	Correct	187 ms	67352 KB	Output is correct
59	Correct	186 ms	67336 KB	Output is correct
60	Correct	186 ms	67280 KB	Output is correct
61	Correct	175 ms	67268 KB	Output is correct
62	Correct	179 ms	67276 KB	Output is correct
63	Correct	169 ms	67228 KB	Output is correct
64	Correct	175 ms	67232 KB	Output is correct
65	Correct	174 ms	67408 KB	Output is correct
66	Correct	171 ms	67336 KB	Output is correct
67	Correct	175 ms	67384 KB	Output is correct
68	Correct	176 ms	67452 KB	Output is correct
69	Correct	174 ms	67288 KB	Output is correct
70	Correct	186 ms	67324 KB	Output is correct
71	Correct	184 ms	67264 KB	Output is correct
72	Correct	177 ms	67400 KB	Output is correct

답안 #653982

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 11.0 / 11.0

Subtask #3 13.0 / 13.0

Subtask #4 15.0 / 15.0

Subtask #5 52.0 / 52.0

Subtask #1
9.0 / 9.0

Subtask #2
11.0 / 11.0

Subtask #3
13.0 / 13.0

Subtask #4
15.0 / 15.0

Subtask #5
52.0 / 52.0