답안 #420623

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420623	2021-06-08T13:00:46 Z	Nicholas_Patrick	Cigle (COI21_cigle)	C++17	100 / 100	908 ms	98524 KB

cigle

#pragma GCC optimize("O3")
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
 
int main(){
	int n;
	scanf("%d", &n);
	vector<int> d(n);
	for(int& i : d)
		scanf("%d", &i);
	vector<vector<int>> dp(n, vector<int>(n, 0));
	/*
		dp[x][y]
		x: last brick laid
		y: earliest brick in last row
		y≤x
	*/
	for(int i=1; i<n; i++){
		vector<int> suffsum, prefsum;
		for(int j=i; j--;){
			if(suffsum.empty()){
				suffsum.push_back(d[j]);
			}else{
				suffsum.push_back(d[j]+suffsum.back());
			}
		}
		for(int j=i; j<n; j++){
			if(prefsum.empty()){
				prefsum.push_back(d[j]);
			}else{
				prefsum.push_back(d[j]+prefsum.back());
			}
		}
		for(int j=0, k=0, matches=0; j<prefsum.size(); j++){
			while(k+1<suffsum.size() and suffsum[k]<prefsum[j])
				k++;
			if(prefsum[j]==suffsum[k]){
				matches++;
				if(i+j+1<n and i-k-2>=0)
					dp[i+j+1][i]=max(dp[i+j+1][i], dp[i-1][i-k-2]+matches);
			}
		}
		if(i){
			for(int j=0; j<n; j++)
				dp[j][i]=max(dp[j][i-1], dp[j][i]);
		}
		for(int j=1; j<n; j++)
			dp[j][i]=max(dp[j][i], dp[j-1][i]);
	}
	printf("%d\n", dp[n-1][n-1]);
}

Compilation message

cigle.cpp: In function 'int main()':
cigle.cpp:36:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for(int j=0, k=0, matches=0; j<prefsum.size(); j++){
      |                                ~^~~~~~~~~~~~~~~
cigle.cpp:37:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |    while(k+1<suffsum.size() and suffsum[k]<prefsum[j])
      |          ~~~^~~~~~~~~~~~~~~
cigle.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
cigle.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |   scanf("%d", &i);
      |   ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
13.0 / 13.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
52.0 / 52.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	1 ms	204 KB	Output is correct
17	Correct	1 ms	204 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	4 ms	1228 KB	Output is correct
22	Correct	4 ms	1228 KB	Output is correct
23	Correct	4 ms	1288 KB	Output is correct
24	Correct	4 ms	1228 KB	Output is correct
25	Correct	4 ms	1228 KB	Output is correct
26	Correct	5 ms	1228 KB	Output is correct
27	Correct	5 ms	1228 KB	Output is correct
28	Correct	5 ms	1228 KB	Output is correct
29	Correct	6 ms	1228 KB	Output is correct
30	Correct	4 ms	1228 KB	Output is correct
31	Correct	4 ms	1228 KB	Output is correct
32	Correct	4 ms	1228 KB	Output is correct
33	Correct	4 ms	1228 KB	Output is correct
34	Correct	4 ms	1228 KB	Output is correct
35	Correct	4 ms	1228 KB	Output is correct
36	Correct	4 ms	1228 KB	Output is correct
37	Correct	5 ms	1228 KB	Output is correct
38	Correct	5 ms	1228 KB	Output is correct
39	Correct	5 ms	1228 KB	Output is correct
40	Correct	4 ms	1228 KB	Output is correct
41	Correct	4 ms	1228 KB	Output is correct
42	Correct	4 ms	1228 KB	Output is correct
43	Correct	4 ms	1228 KB	Output is correct
44	Correct	4 ms	1228 KB	Output is correct
45	Correct	4 ms	1228 KB	Output is correct
46	Correct	4 ms	1228 KB	Output is correct
47	Correct	4 ms	1228 KB	Output is correct
48	Correct	4 ms	1228 KB	Output is correct
49	Correct	4 ms	1228 KB	Output is correct
50	Correct	861 ms	98412 KB	Output is correct
51	Correct	842 ms	98400 KB	Output is correct
52	Correct	861 ms	98396 KB	Output is correct
53	Correct	847 ms	98400 KB	Output is correct
54	Correct	864 ms	98400 KB	Output is correct
55	Correct	878 ms	98396 KB	Output is correct
56	Correct	902 ms	98400 KB	Output is correct
57	Correct	908 ms	98396 KB	Output is correct
58	Correct	859 ms	98400 KB	Output is correct
59	Correct	856 ms	98392 KB	Output is correct
60	Correct	846 ms	98368 KB	Output is correct
61	Correct	834 ms	98412 KB	Output is correct
62	Correct	799 ms	98360 KB	Output is correct
63	Correct	832 ms	98408 KB	Output is correct
64	Correct	794 ms	98408 KB	Output is correct
65	Correct	804 ms	98408 KB	Output is correct
66	Correct	820 ms	98408 KB	Output is correct
67	Correct	818 ms	98524 KB	Output is correct
68	Correct	798 ms	98408 KB	Output is correct
69	Correct	805 ms	98404 KB	Output is correct
70	Correct	826 ms	98400 KB	Output is correct
71	Correct	809 ms	98396 KB	Output is correct
72	Correct	797 ms	98404 KB	Output is correct

답안 #420623

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