| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 881989 | skywwla | Rabbit Carrot (LMIO19_triusis) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std ;
using ll = long long ;
int32_t main() {
ios::sync_with_stdio(false) ;
cin.tie(nullptr) ;
int n , m ; cin >> n >> m ;
deque<int> a(n) ;
for (int &i : a) cin >> i ;
a.push_front(0) ; n++ ;
int cnt = 0 ;
for (int i = 0 ; i < n - 1 ; i++) {
int d = a[i + 1] - a[i] ;
if (d <= 0) continue ;
if (d > m) {
cnt++ ;
a[i + 1] = a[i] + m ;
}
}
cout << cnt ;
return 0 ;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
