제출 #1054013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054013		aun5x	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	0 ms	348 KiB

triusis

#include <bits/stdc++.h>
using namespace std;

int main (){
    long long n, m;
    cin >> n >> m;
    long long height = 0;
    int i = 0;
    // first pass
    int ans = 0;
    for (; i < n; i++){
        long long h; cin >> h;
        // we decrease h till h - height = m
        // so we jump up to h, h should equal height + m;
        if (h - height > m){
            ans++;
            height = height + m;
        } 
        // Otherwise we dont do anything
        else{
            i++;
            height = h;
            break;
        }
    }
    // second pass now we can choose to increase 
    for (; i < n; i++){
        long long h; cin >> h;
        // increase h to height 
        if (h - height > m){
            ans++; 
        }
        height = h;
    }
    cout << ans;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37