제출 #489254

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

triusis

#include <bits/stdc++.h>
#define  endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
    if(y == 0) return 1 ;
    if(y == 1) return x ;
    ll ret = mypower(x , y / 2);
    ret = (ret * ret) % mod;
    if(y % 2) ret = ( ret * x ) % mod ;
    return ret ;
}
ll n , m , a[200009] ;
bool vis[200009] ;
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n >> m ;
    for(int i = 0 ; i < n ; i++){
        cin >> a[i] ;
    }
    a[n] = 0 ;
    ll ans =  0 ;
    if(a[0] > m){
        ans++ ;
        vis[0] = 1 ;
        a[0] = m  ;
    }
    for(int i = 0 ; i < n ; i++){
        if(a[i+1] > a[i])
        {
            if(a[i+1] - a[i] > m){
                if(vis[i]){
                    a[i + 1] = a[i] + m ;
                    vis[i + 1] = 1 ;
                    ans++ ;
                }
                else{
                    a[i] = a[i+1] ;
                    ans++ ;
                    vis[i] = 1 ;
                }
            }
        }
    }
    cout << ans << endl ;
    return 0 ;
}

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