Submission #1135726

#TimeUsernameProblemLanguageResultExecution timeMemory
1135726tvladmRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h> #define F first #define S second using namespace std; using ll = long long; using pi = pair<int, int>; using vi = vector<int>; template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; } template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; } int main() { ios::sync_with_stdio(0); cin.tie(0); int n, m; cin >> n >> m; vector<int> a(n + 1); for (int i = 1; i <= n; ++i) cin >> a[i]; int ans = 0; if (a[1] > m) { a[1] = m; ++ans; } for (int i = 1; i < n; ++i) { if (a[i] + m < a[i + 1]) { ans++; if (a[i - 1] + m >= a[i + 1]) { a[i] = a[i - 1] + m; } else { a[i + 1] = a[i] + m; } continue; } if (a[i] > a[i + 1]) { continue; } } cout << ans << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...