Submission #540512

#TimeUsernameProblemLanguageResultExecution timeMemory
540512juankipediaRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms328 KiB
# include <bits/stdc++.h> using namespace std; /*************************************************************************************/ # define endl "\n" # define io_boost std::ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr); typedef unsigned long long int ulli; typedef long long int lli; /*************************************JUANKIPEDIA*************************************/ const int MAXN = 200005; int N; lli a[MAXN], J; int main(){ io_boost; cin >> N >> J; for(int i = 0; i < N; i++) cin >> a[i]; lli c = 0; int ans = 0; bool b[N] = {0}; for(int i = 0; i < N; i++){ if(a[i] > (c + J)){ ans++; if(i == 0 || b[i - 1]) a[i] = c + J, b[i] = 1; } c = a[i]; } cout << ans << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...