제출 #1267335

#제출 시각아이디문제언어결과실행 시간메모리
1267335vpinxRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int solve() { int n, m; cin >> n >> m; vector<int> v(n + 1); for (int i = 1; i <= n; i++) cin >> v[i]; v[0] = 0; int ans = 0; for (int i = 1; i <= n; i++) { if (v[i - 1] + m >= v[i]) continue; if (i == 1) v[i] = v[i - 1] + m, ans++; else if (v[i - 2] + (2 * m) < v[i]) v[i] = v[i - 1] + m, ans++; else v[i - 1] = v[i - 2] + m, ans++; } return ans; } int32_t main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << solve(); 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...