oj.uz

Submission #753506

# Submission time Handle Problem Language Result Execution time Memory
753506 2023-06-05T12:08:17 Z Fidan K blocks (IZhO14_blocks) C++17
18 / 100
 1 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for(ll i=ll(a); i<ll(b); i++)
#define repn(i, a, b) for(ll i=ll(b)-1; i>=ll(a); i--)
#define ff first
#define ss second
#define si size()
#define pb push_back
#define be begin()
#define en end()
const ll N=110;
const ll K=110;
const ll inf=(1e9);
vector<vector<ll>> dp(N, vector<ll> (K, inf));
vector<vector<ll>> mx(N, vector<ll> (N));
vector<ll> a(N);
ll sol(ll n, ll k){
	if(n<k) return inf;
	if(n==0 && k==0) return 0;
	if(n==1 && k==1) return a[1];
	if(n==2 && k==1) return max(a[1], a[2]);
	if(n==2 && k==2) return a[1]+a[2];
	if(dp[n][k]!=inf) return dp[n][k];
	rep(i, 0, n){
		dp[n][k]=min(dp[n][k], sol(i, k-1)+mx[i+1][n]);
	}
	return dp[n][k];
}
void solve(){
	ll n, k;
	cin>>n>>k;
	rep(i, 1, n+1){
		cin>>a[i];
	}
	rep(i, 1, n+1){
		mx[i][i]=a[i];
		rep(j, i+1, n+1){
			mx[i][j]=max(a[j], mx[i][j-1]);
		}
	}
	cout<<sol(n, k);
}
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll t=1;
	//~ cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 516 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Incorrect 1 ms 468 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 412 KB Output is correct
13 Correct 1 ms 520 KB Output is correct
14 Correct 1 ms 516 KB Output is correct
15 Correct 1 ms 520 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 480 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 524 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 516 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Incorrect 1 ms 468 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 516 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 520 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Incorrect 1 ms 468 KB Output isn't correct
14 Halted 0 ms 0 KB -