Submission #1164636

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164636		Muhammad_Aneeq	Rabbit Carrot (LMIO19_triusis)	C++20	0 / 100	1 ms	328 KiB

triusis

/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <set>
#warning check the output
using namespace std;
inline void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n+1]={};
    a[0]=0;
    for (int i=1;i<=n;i++)
        cin>>a[i];
    int ans=(a[0]+k<a[1]);
    bool ch[n+1]={};
    ch[1]=ans;
    a[1]=min(a[1],k);
    for (int i=1;i<n;i++)
    {
        if (a[i]+k<a[i+1])
        {
            if (ch[i])
            {
                a[i+1]=a[i]+k;
                ch[i+1]=1;
            }
            else
            {
                ch[i]=1;
            }
            ans++;
        }
    } 
    cout<<ans<<endl;
}
int main()
{
    int t=1;
    for (int i=1;i<=t;i++)
    {
        solve();
    }
}

Compilation message (stderr)

triusis.cpp:9:2: warning: #warning check the output [-Wcpp]
    9 | #warning check the output
      |  ^~~~~~~

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