제출 #1164801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1164801		Ghulam_Junaid	Rabbit Carrot (LMIO19_triusis)	C++20	63 / 100	1096 ms	780 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main(){
    ll n, m;
    cin >> n >> m;

    deque<ll> dq;
    dq.push_front(0);
    ll ans = 0;
    for (ll i = 1; i <= n; i ++){
        ll x;
        cin >> x;
        
        if (dq.front() + m < x){
            ans++;
            for (int j = 0; j < dq.size(); j ++)
                dq[j] += m;
            for (int j = 1; j < dq.size(); j ++)
                if (dq[j] >= x) dq[j - 1] = max(dq[j - 1], x);
        }
        else{
            for (int j = 0; j < dq.size(); j ++)
                dq[j] += m;
            dq.push_front(x);
        }
    }
    cout << ans << endl;
}

• Subtask 1: 14 / 14
• Subtask 2: 21 / 21
• Subtask 3: 28 / 28
• Subtask 4: 0 / 37