제출 #1277527

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

triusis

#include <iostream>
#include <iomanip>
#include <fstream>
#include <string>
#include <cstring>
#include <vector>
#include <array>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <thread>
#include <mutex>
#include <bitset>
#include <atomic>
#include <future>
#include <chrono>
#include <ctime>
#include <random>
#include <cstdlib>
#include <cassert>
#include <exception>
using namespace std;

#define int long long
#define SALAM ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'

signed main(){
    /*|||\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||*/
    /*|||\/\/\/\/\*/SALAM/*/\/\/\/\/\/\|||*/
    /*|||\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/|||*/
    int n , m;
    cin >> n >> m;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    int c = 0 , h = 0;
    for(int i = 0; i < n; i++){
        if(a[i] > h + m){
            c++;
            h = h + m;
        }
        else h = a[i];
    }
    cout << c << endl;
}

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