Submission #1014468

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014468		vjudge1	The short shank; Redemption (BOI21_prison)	C++17	100 / 100	213 ms	151864 KiB

prison

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=2e6+5;
int n,d,T,a[MAXN];
int q[MAXN],tp;
bool fuc[MAXN];
int head[MAXN],tot;
struct node{int nxt,to;}e[MAXN<<1];
inline void add(int u,int v){
    e[++tot].nxt=head[u];
    e[tot].to=v;
    head[u]=tot;
}
int dep[MAXN];
basic_string<int>cnt;
inline void dfs(int u){
    int son=-1;
    for(int i=head[u],v;i;i=e[i].nxt){
        dfs(v=e[i].to);if(dep[u]<dep[v]){dep[u]=dep[v];son=v;}
    }
    dep[u]+=fuc[u];
    for(int i=head[u],v;i;i=e[i].nxt){
        if((v=e[i].to)!=son)cnt.push_back(-dep[v]);
    }
}
signed main(){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    cin>>n>>d>>T;
    for(int i=1;i<=n;i++)cin>>a[i];////
    for(int i=n;i>=1;i--){
        if(a[i]>T)q[++tp]=i;
        else{
            while(tp&&(a[i]+(q[tp]-i)<=T)){
                fuc[q[tp]]=1;add(q[tp-1],q[tp]);tp--;
            }
        }
    }
    int ans=tp;
    for(int i=1;i<=tp;i++)add(0,q[i]);
    dfs(0);cnt.push_back(-dep[0]);
    sort(cnt.begin(),cnt.end());
    for(int i=0;i<cnt.size()&&i<d;i++)ans-=cnt[i];
    cout<<n-ans<<"\n";
}

Compilation message (stderr)

prison.cpp: In function 'int main()':
prison.cpp:45:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i=0;i<cnt.size()&&i<d;i++)ans-=cnt[i];
      |                 ~^~~~~~~~~~~

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