Submission #1197953

#TimeUsernameProblemLanguageResultExecution timeMemory
1197953iagozagRabbit Carrot (LMIO19_triusis)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define _ ios_base::sync_with_stdio(0);cin.tie(0); #define endl '\n' #define int ll typedef long long ll; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fll; const int MAX = 2e5+10, MOD = 1e9+7; void solve(){ int n, m; cin >> n >> m; vector<int> v(n); int ans = 0; for(int i = 0; i < n; i++) cin >> v[i]; if(v[0] > m) v[0] = m, ans++; int i = 1; while(i < n and v[i]-v[i-1] > m) v[i] = v[i-1]+m, ans++; for(; i < n; i++){ if(v[i]-v[i-1] > m) ans++; } cout << ans << endl; } int32_t main(){ _ int ttt = 1; // cin >> ttt; while(ttt--) solve(); exit(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...