Submission #1299709

#TimeUsernameProblemLanguageResultExecution timeMemory
1299709bethanceRabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms580 KiB
#include<bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>n>>k; vector<int> poles(n); for(int i=0;i<n;i++){ cin>>poles[i]; } int ans=0; if(poles[0]>k){ ans++; poles[0]=k; } for(int i=1;i<n;i++){ if(poles[i]-poles[i-1]>k){ ans++; poles[i]=poles[i-1]+k; } } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...