| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 541455 | it111 | Rabbit Carrot (LMIO19_triusis) | C++14 | 1 ms | 268 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;
int auksciai[200005] = {0};
int galimaKelti[200005] = {0};
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n,m; cin >> n >> m;
for(int i = 1; i<=n; i++){
cin >> auksciai[i];
}
int ats = 0;
for(int i = 0; i<=n-1; i++){
if(auksciai[i]+m>=auksciai[i+1]){
galimaKelti[i+1] = auksciai[i]+m-auksciai[i+1];
} else if(auksciai[i]+m+galimaKelti[i]>=auksciai[i+1]){
ats++;
} else{
ats++;
auksciai[i+1] = auksciai[i]+m;
}
}
cout << ats;
}| # | 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... | ||||
