Submission #702123

#	Time	Username	Problem	Language	Result	Execution time	Memory
702123		ifateen	Rabbit Carrot (LMIO19_triusis)	C++14	0 / 100	1 ms	212 KiB

triusis

#ifndef ONLINE_JUDGE
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#else
#include <bits/stdc++.h>
#endif
using namespace std;
#define int long long
#define double long double
#define vec vector
#define vi vec<int>
#define pii pair<int,int>
#define vpi vec<pii>
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define pq priority_queue
#define all(v) v.begin(), v.end()


signed main() {
    int n,t;
    cin >> n >> t;
    vi v(n+1,0);
    for (int i = 1; i <= n; i++) cin >> v[i];
    int u = 0;
    for (int i = 1; i <= n; i++) {
        if (v[i] - v[i - 1] > t) u++ , v[i] = v[i - 1] + t;
        if (i == 1 and v[i] > t) u++ , v[i] = t;
    }
    cout << +u << endl;
}

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