Submission #1313330

#TimeUsernameProblemLanguageResultExecution timeMemory
1313330rojuslol1Rabbit Carrot (LMIO19_triusis)C++20
0 / 100
2 ms332 KiB
#include <iostream> #include <vector> using namespace std; int main() { long long n, jump; cin >> n >> jump; long long currh = 0, ats = 0; vector<long long> m(n); for (long long i = 0; i < n; i++) { cin >> m[i]; } for (long long i = 0; i < n; i++) { if (currh >= m[i] || currh + jump >= m[i]) currh = m[i]; else { ats++; currh += jump; } } cout << ats << '\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...