Submission #1284254

#TimeUsernameProblemLanguageResultExecution timeMemory
1284254zxzuamRabbit Carrot (LMIO19_triusis)C++20
0 / 100
1 ms576 KiB
#include <bits/stdc++.h> #define int long long using ll = int64_t; using namespace std; constexpr int maxn = 1E5 + 1; void orz() { int N, K; cin >> N >> K; vector <int> A(N + 1); for(int i = 1; i <= N; i++) { cin >> A[i]; } int cnt = 0; for(int i = 1; i <= N; i++) { if(A[i] - A[i - 1] > K) { A[i] = A[i - 1] + K; cnt++; } } cout << cnt; } int32_t main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); //freopen("promote.in", "r", stdin); //freopen("promote.out", "w", stdout); int T = 1; //cin >> T; while(T--) orz(); 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...