Submission #1153247

#TimeUsernameProblemLanguageResultExecution timeMemory
1153247sodbayrRabbit Carrot (LMIO19_triusis)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> #define ll long long #define ss second #define ff first #define pb push_back #define endl "\n" #define mod 1000000007 using namespace std; ll a[200005],n,sum2,m,h,sum,l; int main(){ ios::sync_with_stdio(false); cout.tie(0); cin.tie(0); cin>>n>>m; for(ll i=1;i<=n;i++){ cin>>a[i]; } for(ll i=1;i<=n;i++){ if(l+m<a[i]){ l+=m;sum++; } else { l=a[i]; } } l=a[n]; sum2=n; for(ll i=n-1;i>0;i--){ //cout<<l<<"\n"; if(l-m<=a[i]){ //cout<<l; l-=m; } else { l=a[i]; sum2--; } } cout<<min(sum,sum2); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...