Submission #72876698

---

Source Code Expand

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 1e6 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
ll a[N];
void solve()
{
    ll n, t;
    cin >> n >> t;
    for (ll i = 1; i <= n;i++)
        cin >> a[i];
    ll pre = -1;
    ll ans = 0;
    if(n==0)
    {
        cout << t << '\n';
        return;
    }
    for (ll i = 1; i <= n;i++)
    {
        if(pre==-1)
        {
            ans += a[i];
            pre = a[i]+100;
            continue;
        }
        if(a[i] > pre)
        {
            ans += a[i] - pre;
            pre = a[i] + 100;
        }
    }
    if(pre <= t)
        ans += t - pre;
    cout << ans << '\n';
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    //cin>>T;
    while (T--)
    {
        solve();
    }
}

Submission Info

Judge Result