Submission #1056837

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056837		Zbyszek99	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	847 ms	8400 KiB

prison

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

void solve()
{
    int n,d,t;
    cin >> n >> d >> t;
    vector<ll> v(n);
    rep(i,n) cin >> v[i];
    vector<int> pop(n,0);
    int ans = n;
    //cout << " xd\n";
    rep(i,n)
    {
        if(v[i] <= t)
        {
            continue;
        }
        bool is = false;
        for(int j = i; j >= 0; j--)
        {
            if(v[j] + i-j <= t)
            {
                is = true;
                pop[j]++;
                break;
            }
        }
        if(!is) ans--;
    }
    //cout << "xd\n";
    vector<int> segs;
    int p = 0;
    rep(i,n)
    {
  //      cout << pop[i] << " pop\n";
        if(v[i] > t)
        {
            segs.pb(p);
            p = 0;
        }
        else p += pop[i];
    }
    sort(all(segs));
    reverse(all(segs));
    rep(i,min(d,size(segs)))
    {
        ans -= segs[i];
    }
    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

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