Submission #1164649

#TimeUsernameProblemLanguageResultExecution timeMemory
1164649Muhammad_AneeqRabbit Carrot (LMIO19_triusis)C++20
0 / 100
13 ms328 KiB
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <set>
#warning check the output
using namespace std;
#define int long long
inline void solve()
{
    int n,k;
    cin>>n>>k;
    int a[n+1]={};
    a[0]=0;
    int b[n+1]={};
    for (int i=1;i<=n;i++)
    {
        cin>>a[i];
        b[i]=a[i];
    }
    int ans=0;
    bool ch[n+1]={};
    ch[0]=1;
    bool cj[n+1]={};
    for (int j=0;j<n;j++)
    {
        for (int i=0;i<n;i++)
        {
            if (a[i]+k<a[i+1])
            {
                if (ch[i])
                {
                    a[i+1]=a[i]+k;
                    ch[i+1]=1;
                    cj[i+1]=1;
                }
                else
                {
                    a[i]=a[i+1]-k;
                    ch[i]=1;
                    cj[i+1]=1;
                }
                ans++;
            }
        }
        for (int i=1;i<=n;i++)
            ch[i]=0;
    } 
    ans=0;
    for (int i=1;i<=n;i++)
        ans+=(a[i]!=b[i]);
    cout<<ans<<endl;
}
signed 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
      |  ^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...