Submission #991300

#	Time	Username	Problem	Language	Result	Execution time	Memory
991300		VMaksimoski008	The short shank; Redemption (BOI21_prison)	C++17	15 / 100	92 ms	4996 KiB

prison

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int n, d, t, dp[505][505], v[505];

int f(int pos, int mat) {
    if(pos == n+1) return (mat <= d + 1 ? 0 : n + 1);
    if(dp[pos][mat] != -1) return dp[pos][mat];

    int ans = 1e9, cnt = 0;
    int mn = v[pos] - pos;
    for(int i=pos; i<=n; i++) {
        mn = min(mn, v[i] - i);
        cnt += (mn + i <= t);
        ans = min(ans, f(i+1, mat+1) + cnt);
    }

    return dp[pos][mat] = ans;
}

int32_t main() {
    memset(dp, -1, sizeof(dp));
    cin >> n >> d >> t;
    d = min(d, n-1);


    for(int i=1; i<=n; i++) cin >> v[i];

    cout << f(1, 0) << '\n';
    return 0;
}

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