| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1229044 | buixuia | Rabbit Carrot (LMIO19_triusis) | C++17 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 1;
long long n, m, h[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>m;
h[0] = 0;
for(int i = 1; i <= n; ++i)cin>>h[i];
long long res = 0;
for(int i = 1; i <= n; ++i){
if(h[i] - h[i-1] > m){
++res;
h[i] = h[i-1] + m;
}
}
cout<<res<<'\n';
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... | ||||
