Submission #376442

#TimeUsernameProblemLanguageResultExecution timeMemory
376442gustasonRabbit Carrot (LMIO19_triusis)C++14
0 / 100
1 ms364 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; vector<bool> lifted(n+1, false); if (a[1] > m) { a[1] = m; lifted[1] = true; ans++; } for(int i = 1; i <= n; i++) { if (a[i] - a[i-1] > m) { ans++; if (i == n) break; if (a[i+1] - (a[i-1] + m) <= m || lifted[i-1]) { a[i] = a[i-1] + m; lifted[i] = true; } } 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...