Submission #376453

#TimeUsernameProblemLanguageResultExecution timeMemory
376453gustasonRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms492 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; int a[n+1]; a[0] = 0; for(int i = 1; i <= n; i++) { cin >> a[i]; } int ans = 0; if (a[1] > m) { a[1] = m; ans++; } for(int i = 2; i <= n; i++) { if (a[i] - a[i-1] > m) { ans++; // if (i == n) break; if (a[i] - (a[i-2] + m) > m) { a[i] = a[i-1] + m; } else { a[i-1] = a[i-2] + m; } } // cerr << a[i] << "\n"; } cout << ans; 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...