oj.uz

Submission #39305

# Submission time Handle Problem Language Result Execution time Memory
39305 2018-01-11T05:44:06 Z MrPlany K blocks (IZhO14_blocks) C++14
53 / 100
 1000 ms 45032 KB 
#include <bits/stdc++.h>

using namespace std;

int n, a[100109], dp[109][100109], k;

int main(){
	
	scanf("%d%d",&n,&k);
//	if(n>100) return 0;
	
	for(int i=1;i<=n;i++) scanf("%d",a+i);
	
	for(int i=1;i<=n;i++) dp[1][i] = max(dp[1][i-1], a[i]);
	
	for(int i=2;i<=n;i++){
		
		for(int j=i;j<=n;j++){
			
			long long mx = 0, mn=1e9;
			
			for(int f = j; f>=i; f--){
				mx = max(mx, (long long)a[f]);
				
				mn= min( mx + dp[i-1][f-1], mn );
				
			}
			dp[i][j] = mn;
			
		}
		
	}
	cout << dp[k][n];
	return 0;
}

Compilation message

blocks.cpp: In function 'int main()':
blocks.cpp:9:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
                     ^
blocks.cpp:12:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++) scanf("%d",a+i);
                                       ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 45032 KB Output is correct
2 Correct 0 ms 45032 KB Output is correct
3 Correct 0 ms 45032 KB Output is correct
4 Correct 0 ms 45032 KB Output is correct
5 Correct 0 ms 45032 KB Output is correct
6 Correct 0 ms 45032 KB Output is correct
7 Correct 0 ms 45032 KB Output is correct
8 Correct 0 ms 45032 KB Output is correct
9 Correct 0 ms 45032 KB Output is correct
10 Correct 0 ms 45032 KB Output is correct
11 Correct 0 ms 45032 KB Output is correct
12 Correct 0 ms 45032 KB Output is correct
13 Correct 0 ms 45032 KB Output is correct
14 Correct 0 ms 45032 KB Output is correct
15 Correct 0 ms 45032 KB Output is correct
16 Correct 0 ms 45032 KB Output is correct
17 Correct 0 ms 45032 KB Output is correct
18 Correct 0 ms 45032 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 45032 KB Output is correct
2 Correct 0 ms 45032 KB Output is correct
3 Correct 0 ms 45032 KB Output is correct
4 Correct 0 ms 45032 KB Output is correct
5 Correct 0 ms 45032 KB Output is correct
6 Correct 0 ms 45032 KB Output is correct
7 Correct 0 ms 45032 KB Output is correct
8 Correct 0 ms 45032 KB Output is correct
9 Correct 0 ms 45032 KB Output is correct
10 Correct 0 ms 45032 KB Output is correct
11 Correct 0 ms 45032 KB Output is correct
12 Correct 0 ms 45032 KB Output is correct
13 Correct 0 ms 45032 KB Output is correct
14 Correct 0 ms 45032 KB Output is correct
15 Correct 0 ms 45032 KB Output is correct
16 Correct 0 ms 45032 KB Output is correct
17 Correct 0 ms 45032 KB Output is correct
18 Correct 0 ms 45032 KB Output is correct
19 Correct 0 ms 45032 KB Output is correct
20 Correct 0 ms 45032 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 45032 KB Output is correct
2 Correct 0 ms 45032 KB Output is correct
3 Correct 0 ms 45032 KB Output is correct
4 Correct 0 ms 45032 KB Output is correct
5 Correct 0 ms 45032 KB Output is correct
6 Correct 0 ms 45032 KB Output is correct
7 Correct 0 ms 45032 KB Output is correct
8 Correct 0 ms 45032 KB Output is correct
9 Correct 0 ms 45032 KB Output is correct
10 Correct 0 ms 45032 KB Output is correct
11 Correct 0 ms 45032 KB Output is correct
12 Correct 0 ms 45032 KB Output is correct
13 Correct 0 ms 45032 KB Output is correct
14 Correct 0 ms 45032 KB Output is correct
15 Correct 0 ms 45032 KB Output is correct
16 Correct 0 ms 45032 KB Output is correct
17 Correct 0 ms 45032 KB Output is correct
18 Correct 0 ms 45032 KB Output is correct
19 Correct 0 ms 45032 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 45032 KB Execution timed out
2 Halted 0 ms 0 KB -