Submission #1030071

#	Time	Username	Problem	Language	Result	Execution time	Memory
1030071		vjudge1	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	31 ms	5520 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), s; 
    for(auto& u : v) cin >> u; 
    
    int ans = n; 
    
    for(int i = 1; i < n; i++) if(v[i] > t && v[i-1] <= t)
    {
        s.push_back(0); 
        for(int j = i; j < n; j++){
            if(v[j] > t) s.back()++; 
            else break;
        }
        
        ans -= max(0LL, s.back() - (t - v[i-1])); 
        s.back() = min(s.back(), t - v[i-1]); 
    }

    if(v[0] > t){
        for(int i = 0; i < n; i++){
            if(v[i] > t) ans--; 
            else break;
        }
    }

    sort(all(s)); 

    while (d--)
    {
        if(s.empty()) break;
        ans -= s.back();
        s.pop_back(); 
    }

    cout << ans << 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