제출 #1032458

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1032458		vjudge1	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	1 ms	348 KiB

prison

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

#pragma GCC optimize("O3")
#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

void solve()
{
    int n, d, t; cin >> n >> d >> t; 
    vector <int> v(n), c(n, -1); 
    for(auto& u : v) cin >> u; 

    queue <int> q; 
    for(int i = n-1; i >= 0; i--)
    {
        if(v[i] > t){
            q.push(i); 
            continue;
        }

        while (!q.empty())
        {
            int x = q.front();
            if((t-v[i]) >= (x-i)){
                c[x] = i; 
                q.pop(); 
            } else break;
        }
    }  

    vector <vector<int>> dp(n + 1, vector <int> (d + 1, 0)); 

    auto f = [&](int i, int j) {
        if(c[i] == -1) return 0LL; 
        return ((int) (c[i] >= j)); 
    };

    int ans = 0;    

    for(int i = 0; i < n; i++)
    {
        dp[i][0] = 0;
        for(int j = 0; j <= i; j++)
        {
            for(int k = 1; k <= d; k++){
                dp[i][k] = max(dp[i][k], dp[j][k-1]);  
                dp[j][k] = dp[j][k] + f(i, j); 
                ans = max(ans, dp[j][k]); 
            }
        }
    }

  

    cout << (n - ans + q.size()) << endl; 
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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