제출 #582721

#제출 시각아이디문제언어결과실행 시간메모리
582721ngano_upat_naRabbit Carrot (LMIO19_triusis)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<ll> v(n); for (int i=0; i<n; i++) cin >> v[i]; ll cur = 0, ans = 0; for (int i=0; i<n; i++) { if (v[i] - cur <= m) { cur = v[i]; } else { ans++; cur += m; } } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...