답안 #420459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420459	2021-06-08T11:24:14 Z	MetalPower	Cigle (COI21_cigle)	C++14	100 / 100	261 ms	67296 KB

cigle

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

const int MX = 5005;

void chmax(int& a, int b){
	if(b > a) a = b;
}

int N, arr[MX], dp[MX][MX];

// Observation #1 : We can easily solve this in O(N^3)
	// dp(i, j) is the largest beauty of the wall if the highest row includes [i, j]
	// the transition is we add another row [j + 1, k] for every j + 1 <= k <= N
	// calculating is easy two pointer

// Observation #2 : if the size of row[j + 1, k] is higher than row[i, j]
	// then for every other k >= current_k 
	// the value of the dp is constant
	// this is also correct for the opposite
	
// So we can find the positions where the value changes in O(N) for each j
	// update those positions
	// and after we update max the current value with the previous value

// To make finding range query faster use prefix sum (because l = 0)

struct prefix{
	int v[MX];

	void build(int p){
		for(int i = 0; i <= p; i++) v[i] = i == 0 ? dp[i][p] : max(dp[i][p], v[i - 1]);
	}
} ps;

int main(){
	ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);

	cin >> N;

	for(int i = 0; i < N; i++) cin >> arr[i];

	for(int p = 0; p < N; p++){
		int i = p, k = p + 1, cnt = -1, bot = 0, top = 0;

		ps.build(p);

		while(i >= 0 && k < N){
			if(bot == top){
				cnt++; chmax(dp[p + 1][k], ps.v[i] + cnt);
				bot += arr[i--]; top += arr[k++];
			}else if(bot < top){
				bot += arr[i--];
			}else if(top < bot){
				top += arr[k++];
			}
		}

		for(int j = p + 1; j < N; j++) chmax(dp[p + 1][j], dp[p + 1][j - 1]);
	}

	int ans = 0;

	for(int p = 0; p < N; p++) chmax(ans, dp[p][N - 1]);

	cout << ans << '\n';
}

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
52.0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	588 KB	Output is correct
11	Correct	1 ms	588 KB	Output is correct
12	Correct	1 ms	588 KB	Output is correct
13	Correct	1 ms	588 KB	Output is correct
14	Correct	1 ms	608 KB	Output is correct
15	Correct	1 ms	588 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	588 KB	Output is correct
18	Correct	1 ms	580 KB	Output is correct
19	Correct	1 ms	576 KB	Output is correct
20	Correct	1 ms	588 KB	Output is correct
21	Correct	3 ms	2764 KB	Output is correct
22	Correct	3 ms	2764 KB	Output is correct
23	Correct	3 ms	2764 KB	Output is correct
24	Correct	3 ms	2748 KB	Output is correct
25	Correct	3 ms	2764 KB	Output is correct
26	Correct	5 ms	2764 KB	Output is correct
27	Correct	4 ms	2764 KB	Output is correct
28	Correct	4 ms	2764 KB	Output is correct
29	Correct	4 ms	2764 KB	Output is correct
30	Correct	3 ms	2744 KB	Output is correct
31	Correct	3 ms	2764 KB	Output is correct
32	Correct	3 ms	2744 KB	Output is correct
33	Correct	3 ms	2764 KB	Output is correct
34	Correct	3 ms	2744 KB	Output is correct
35	Correct	3 ms	2748 KB	Output is correct
36	Correct	3 ms	2748 KB	Output is correct
37	Correct	4 ms	2764 KB	Output is correct
38	Correct	4 ms	2764 KB	Output is correct
39	Correct	4 ms	2764 KB	Output is correct
40	Correct	3 ms	2124 KB	Output is correct
41	Correct	3 ms	2748 KB	Output is correct
42	Correct	3 ms	2752 KB	Output is correct
43	Correct	3 ms	2636 KB	Output is correct
44	Correct	3 ms	2252 KB	Output is correct
45	Correct	3 ms	2636 KB	Output is correct
46	Correct	3 ms	2636 KB	Output is correct
47	Correct	3 ms	2636 KB	Output is correct
48	Correct	3 ms	2636 KB	Output is correct
49	Correct	3 ms	2636 KB	Output is correct
50	Correct	198 ms	67272 KB	Output is correct
51	Correct	207 ms	67264 KB	Output is correct
52	Correct	202 ms	67256 KB	Output is correct
53	Correct	205 ms	67256 KB	Output is correct
54	Correct	205 ms	67168 KB	Output is correct
55	Correct	205 ms	67292 KB	Output is correct
56	Correct	256 ms	67224 KB	Output is correct
57	Correct	261 ms	67240 KB	Output is correct
58	Correct	256 ms	67268 KB	Output is correct
59	Correct	253 ms	67004 KB	Output is correct
60	Correct	252 ms	66244 KB	Output is correct
61	Correct	232 ms	67296 KB	Output is correct
62	Correct	225 ms	67204 KB	Output is correct
63	Correct	224 ms	67136 KB	Output is correct
64	Correct	223 ms	67036 KB	Output is correct
65	Correct	218 ms	66860 KB	Output is correct
66	Correct	231 ms	66696 KB	Output is correct
67	Correct	215 ms	66412 KB	Output is correct
68	Correct	212 ms	66312 KB	Output is correct
69	Correct	220 ms	66284 KB	Output is correct
70	Correct	243 ms	66568 KB	Output is correct
71	Correct	250 ms	67064 KB	Output is correct
72	Correct	243 ms	67284 KB	Output is correct

답안 #420459

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