Submission #697296

#	Time	Username	Problem	Language	Result	Execution time	Memory
697296		Dan4Life	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	0 ms	212 KiB

prison

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define int long long 
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mxN = (int)1e5+10;
const int LINF = mxN*mxN;
int n, k, T, a[mxN];
vector<vector<int>> dp;

int32_t main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k >> T; k++;
    dp.resize(n+2,vector<int>(k+2,LINF));
    for(int i = 1; i <= n; i++) cin >> a[i];
    dp[1][1] = a[1]<=T;
    for(int i = 2; i <= n; i++){
        for(int j = 1; j <= k; j++){
            dp[i][j] = dp[i-1][j]+(min(a[i-1]+1,a[i])<=T);
            if(j>1) dp[i][j] = min(dp[i][j],dp[i-1][j-1]+(a[i]<=T));
        }
    }
    cout << dp[n][k];
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20