제출 #995325

#제출 시각아이디문제언어결과실행 시간메모리
995325PagodePaivaTrains (BOI24_trains)C++17
0 / 100
6 ms1116 KiB
#include<bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int N = 1e5+10;
const int B = 500;
int n;
int dp[N], d[N], x[N];
int pref[N];

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> d[i] >> x[i];
    }
    for(int i = 1;i <= n;i++){
        dp[i] = 1;
    }
    for(int i = n;i >= 1;i--){
        dp[i] += pref[i+1] - pref[min(n+1, i+x[i]+1)];
        pref[i] = pref[i+1] + dp[i];
    }
    cout << dp[1] << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...