제출 #1025942

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1025942		ttamx	The short shank; Redemption (BOI21_prison)	C++17	100 / 100	370 ms	255420 KiB

prison

#include<bits/stdc++.h>

using namespace std;

const int INF=INT_MAX/2;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,d,t;
    cin >> n >> d >> t;
    vector<int> a(n);
    for(auto &x:a)cin >> x;
    vector<int> pre(n,-1);
    stack<pair<int,int>> s;
    s.emplace(-INF,-1);
    int ans=0;
    for(int i=0;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);
    }
    vector<pair<int,int>> range;
    for(int i=0;i<n;i++)if(pre[i]!=-1)range.emplace_back(pre[i],i-1);
    int m=range.size();
    ans+=m;
    vector<vector<int>> g(m);
    vector<int> par(m,-1);
    stack<pair<int,int>> st;
    for(int i=0;i<m;i++){
        int x=range[i].first;
        while(!st.empty()&&st.top().first>=x){
            int j=st.top().second;
            st.pop();
            g[i].emplace_back(j);
            par[j]=i;
        }
        st.emplace(x,i);
    }
    vector<int> b,dep(m);
    function<int(int)> dfs=[&](int u){
        int deep=-1;
        for(auto v:g[u])if(dfs(v)>dep[u])dep[u]=dep[v],deep=v;
        for(auto v:g[u])if(v!=deep)b.emplace_back(dep[v]);
        return ++dep[u];
    };
    for(int i=0;i<m;i++)if(par[i]==-1)b.emplace_back(dfs(i));
    sort(b.rbegin(),b.rend());
    for(int i=0;i<min(d,(int)b.size());i++)ans-=b[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