Submission #72886585

---

Source Code Expand

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

using ll = long long;
using mi = map<int, int>;
using ml = map<long long, long long>;
using mc = map<char, int>;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

void solve() {
    ll n, t;
    cin >> n >> t;
    vector<ll> a(n);
    for (auto& x : a) cin >> x;
    ll cur = 0, T = 0, prev = 0;
    for (ll i = 0; i < n; i++) {
        if (a[i] > cur) {
            T += a[i] - cur;
            cur = a[i] + 100;
        }
    }

    cout << T + (t > cur ? (t - cur) : 0) << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result