Submission #1056177

#	Time	Username	Problem	Language	Result	Execution time	Memory
1056177		Szymon_Pilipczuk	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	0 ms	348 KiB

prison

#include <iostream>
#include <queue>
using namespace std;
int main()
{
    int n,d,T;
    cin>>n>>d>>T;
    priority_queue <int> m;
    int t[n];
    int time = 0;
    int rebels = 0;
    int true_rebels = 0;
    for(int i = 0;i<n;i++)
    {
        cin>>t[i];
    }
    for(int i = 0;i<n;i++)
    {
        if(t[i]<=T)
        {
            time = max(time-1,T-t[i]);
            m.push(rebels);
            true_rebels+=rebels;
            rebels = 0;
            true_rebels++;

        }
        else if(time>0)
        {

            rebels++;
        }

    }
    for(int i = 0;i<d;i++)
    {
        if(m.empty() == false)
        {
            true_rebels -= m.top();
            m.pop();
        }
    }
    cout<<true_rebels;
}

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