oj.uz

Submission #420595

# Submission time Handle Problem Language Result Execution time Memory
420595 2021-06-08T12:51:58 Z Nicholas_Patrick Cigle (COI21_cigle) C++17
48 / 100
 1000 ms 98392 KB 
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
 
int n;
vector<vector<int>> dp;
int qry(int x, int y){
	int ret=-1000000000;
	for(int j=y; j>=0; j-=j+1&~j)
		ret=max(ret, dp[x][j]);
	return ret;
}
void upd(int x, int y, int v){
	dp[x][y]=max(dp[x][y], v);
}
int main(){
	scanf("%d", &n);
	vector<int> d(n);
	for(int& i : d)
		scanf("%d", &i);
	dp.assign(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)
					upd(i+j+1, i, qry(i-1, i-k-2)+matches);
			}
		}
		for(int j=1; j<n; j++)
			dp[j][i]=max(dp[j][i], dp[j-1][i]);
		for(int j=0; j<n; j++)for(int k=i; k<n; k+=k+1&~k)
			dp[j][k]=max(dp[j][k], dp[j][i]);
	}
	int ans=0;
	for(auto& i : dp)
		ans=max(ans, *max_element(i.begin(), i.end()));
	printf("%d\n", ans);
}

Compilation message

cigle.cpp: In function 'int qry(int, int)':
cigle.cpp:10:25: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   10 |  for(int j=y; j>=0; j-=j+1&~j)
      |                        ~^~
cigle.cpp: In function 'int main()':
cigle.cpp:45:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for(int j=0, k=0, matches=0; j<prefsum.size(); j++){
      |                                ~^~~~~~~~~~~~~~~
cigle.cpp:46:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |    while(k+1<suffsum.size() and suffsum[k]<prefsum[j])
      |          ~~~^~~~~~~~~~~~~~~
cigle.cpp:56:47: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
   56 |   for(int j=0; j<n; j++)for(int k=i; k<n; k+=k+1&~k)
      |                                              ~^~
cigle.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
cigle.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%d", &i);
      |   ~~~~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 264 KB Output is correct
4 Correct 1 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 276 KB Output is correct
8 Correct 0 ms 276 KB Output is correct
9 Correct 1 ms 204 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 264 KB Output is correct
4 Correct 1 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 276 KB Output is correct
8 Correct 0 ms 276 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

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1228 KB Output is correct
2 Correct 9 ms 1172 KB Output is correct
3 Correct 7 ms 1280 KB Output is correct
4 Correct 7 ms 1228 KB Output is correct
5 Correct 7 ms 1172 KB Output is correct
6 Correct 9 ms 1284 KB Output is correct
7 Correct 8 ms 1172 KB Output is correct
8 Correct 10 ms 1288 KB Output is correct
9 Correct 8 ms 1288 KB Output is correct
10 Correct 7 ms 1228 KB Output is correct
11 Correct 8 ms 1280 KB Output is correct
12 Correct 8 ms 1176 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 264 KB Output is correct
4 Correct 1 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 276 KB Output is correct
8 Correct 0 ms 276 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 7 ms 1228 KB Output is correct
22 Correct 9 ms 1172 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 7 ms 1228 KB Output is correct
25 Correct 7 ms 1172 KB Output is correct
26 Correct 9 ms 1284 KB Output is correct
27 Correct 8 ms 1172 KB Output is correct
28 Correct 10 ms 1288 KB Output is correct
29 Correct 8 ms 1288 KB Output is correct
30 Correct 7 ms 1228 KB Output is correct
31 Correct 8 ms 1280 KB Output is correct
32 Correct 8 ms 1176 KB Output is correct
33 Correct 7 ms 1284 KB Output is correct
34 Correct 8 ms 1288 KB Output is correct
35 Correct 9 ms 1228 KB Output is correct
36 Correct 8 ms 1280 KB Output is correct
37 Correct 8 ms 1228 KB Output is correct
38 Correct 8 ms 1228 KB Output is correct
39 Correct 8 ms 1228 KB Output is correct
40 Correct 7 ms 1228 KB Output is correct
41 Correct 7 ms 1284 KB Output is correct
42 Correct 7 ms 1228 KB Output is correct
43 Correct 7 ms 1280 KB Output is correct
44 Correct 9 ms 1172 KB Output is correct
45 Correct 9 ms 1288 KB Output is correct
46 Correct 8 ms 1356 KB Output is correct
47 Correct 8 ms 1228 KB Output is correct
48 Correct 7 ms 1228 KB Output is correct
49 Correct 7 ms 1228 KB Output is correct

Subtask #5
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 264 KB Output is correct
4 Correct 1 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 276 KB Output is correct
8 Correct 0 ms 276 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 7 ms 1228 KB Output is correct
22 Correct 9 ms 1172 KB Output is correct
23 Correct 7 ms 1280 KB Output is correct
24 Correct 7 ms 1228 KB Output is correct
25 Correct 7 ms 1172 KB Output is correct
26 Correct 9 ms 1284 KB Output is correct
27 Correct 8 ms 1172 KB Output is correct
28 Correct 10 ms 1288 KB Output is correct
29 Correct 8 ms 1288 KB Output is correct
30 Correct 7 ms 1228 KB Output is correct
31 Correct 8 ms 1280 KB Output is correct
32 Correct 8 ms 1176 KB Output is correct
33 Correct 7 ms 1284 KB Output is correct
34 Correct 8 ms 1288 KB Output is correct
35 Correct 9 ms 1228 KB Output is correct
36 Correct 8 ms 1280 KB Output is correct
37 Correct 8 ms 1228 KB Output is correct
38 Correct 8 ms 1228 KB Output is correct
39 Correct 8 ms 1228 KB Output is correct
40 Correct 7 ms 1228 KB Output is correct
41 Correct 7 ms 1284 KB Output is correct
42 Correct 7 ms 1228 KB Output is correct
43 Correct 7 ms 1280 KB Output is correct
44 Correct 9 ms 1172 KB Output is correct
45 Correct 9 ms 1288 KB Output is correct
46 Correct 8 ms 1356 KB Output is correct
47 Correct 8 ms 1228 KB Output is correct
48 Correct 7 ms 1228 KB Output is correct
49 Correct 7 ms 1228 KB Output is correct
50 Execution timed out 1086 ms 98392 KB Time limit exceeded
51 Halted 0 ms 0 KB -