| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 805652 | AmrT | Rabbit Carrot (LMIO19_triusis) | C++17 | 1 ms | 320 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>
#define lop(i,a,b) for(ll i = a; i < b; i++)
#define alop(i,v) for(auto &i: v)
#define in(v) for(auto &i: v) cin >> i;
#define ll long long
#define endl '\n'
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(p, x) memset(p, x, sizeof(p))
using namespace std;
ll mod = 1e9 + 7;
ll ind(vector<ll> &v, int i){
if(v.size() == 1){
if(v[0] < i) return v[0];
else return -1;
}
int res = lower_bound(all(v), i) - v.begin();
if(res == v.size()) return *v.rbegin();
else if(res == 0){
if(v[res] < i) return v[res];
else return -1;
}
else return v[res - 1];
}
signed main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k; cin >> n >> k;
ll arr[n + 1] = {};
lop(i, 0, n) cin >> arr[i + 1];
ll ans = 0;
for(int i = 0; i <= n; i++){
if(i == 0){
if(arr[1] > k) ans++, arr[1] = k;
}
else if(i == n){
if(arr[n - 1] + k < arr[n]) ans++;
}
else{
if(arr[i] + k < arr[i + 1]) ans++, arr[i + 1] = arr[i] + k;
}
}
cout << ans;
return 0;
}Compilation message (stderr)
| # | 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... | ||||
