Submission #1025955

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025955		ttamx	The short shank; Redemption (BOI21_prison)	C++17	100 / 100	205 ms	51284 KiB

prison

#include<bits/stdc++.h>

using namespace std;

const int INF=INT_MAX/2;

const int N=2e6+5;

int n,d,t,ans;
int a[N],pre[N],par[N],dep[N],deep[N],cnt[N];
stack<pair<int,int>> s,st;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> d >> t;
    for(int i=1;i<=n;i++)cin >> a[i];
    s.emplace(-INF,0);
    for(int i=1;i<=n;i++){
        int x=min(a[i],t)-i;
        while(s.top().first>x)s.pop();
        if(a[i]>t)pre[i]=s.top().second;
        else ans++;
        s.emplace(a[i]-i,i);
    }
    for(int i=1;i<=n;i++)if(pre[i]){
        ans++;
        while(!st.empty()&&st.top().first>=pre[i]){
            par[st.top().second]=i;
            st.pop();
        }
        st.emplace(pre[i],i);
    }
    for(int i=1;i<=n;i++)if(pre[i]){
        cnt[dep[deep[i]]]--;
        dep[i]=dep[deep[i]]+1;
        cnt[dep[i]]++;
        if(dep[i]>dep[deep[par[i]]])deep[par[i]]=i;
    }
    for(int i=n;i>=1;i--)while(cnt[i]--&&d-->0)ans-=i;
    cout << ans;
}

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