提出 #76599024

---

ソースコード 拡げる

#include<bits/stdc++.h>
using namespace std;
#define int long long
using state = pair<int, int>;
#define F first 
#define S second 

int l, n, c;
vector<state> a;

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>l>>n>>c;
    if (n == 0) {
        if (c >= l) {
            cout << c - l << "\n";
        } else {
            cout << -1 << "\n";
        }
        return 0;
    }
    // a.resize(n+1);
    int cap=c;
    for(int i=1; i<=n; i++){
        int x, y;
        cin>>x>>y;
        a.push_back({x, y});
    }
    int rem = l-a[n-1].F;
    // cout<<rem<<"\n";
    for(int i = n - 1; i >= 1; i--){
        a[i].F = a[i].F - a[i-1].F;
    }
    for(int i=0; i<n; i++){
        c = c-a[i].F;
        if(c<0){
            cout<<-1;
            return 0;
        }
        if(c+a[i].S<=cap){
            c+=a[i].S;
        }
        else{
            c = cap;
        }
    }
    // cout<<c<<"\n";
    if((c-rem)>=0){
        cout<<(c-rem)<<"\n";
    }
    else{
        cout<<-1<<"\n";
    }
    return 0;
}

提出情報

ジャッジ結果