oj.uz

Submission #646999

# Submission time Handle Problem Language Result Execution time Memory
646999 2022-10-01T10:21:20 Z nandonathaniel K blocks (IZhO14_blocks) C++14
0 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXK=105,MAXN=100005;
int dp[MAXK][MAXN],a[MAXN];
typedef pair<int,int> pii;
 
//https://codeforces.com/blog/entry/18866
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int N,K;
	cin >> N >> K;
	for(int i=1;i<=N;i++)cin >> a[i];
	for(int i=1;i<=N;i++)dp[1][i]=max(dp[1][i-1],a[i]);
	for(int i=2;i<=K;i++){
		stack<int> st;
		for(int j=i;j<=N;j++){
			while(!st.empty() && a[st.top()]<=a[j]){
				st.pop();
			}
			if(st.empty()){
				dp[i][j]=dp[i-1][i-1]+a[j];
			}
			else{
				dp[i][j]=dp[i][st.top()];
				if(i-1<=st.top())dp[i][j]=min(dp[i][j],dp[i-1][st.top()]+a[j]);
				else dp[i][j]=min(dp[i][j],dp[i-1][i-1]+a[j]);
			}
			st.push(j);
		}
	}
	cout << dp[K][N] << '\n';
	return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -