제출 #1063145

#제출 시각아이디문제언어결과실행 시간메모리
1063145antonTrains (BOI24_trains)C++17
0 / 100
146 ms932 KiB
#include<bits/stdc++.h>

using namespace std;

#define int long long 
#define pii pair<int, int>
const int MAX_N = 1e4;
const int MOD = 1e9+7;
int N;

int d[MAX_N];
int x[MAX_N];
int dp[MAX_N];


signed main(){
    cin>>N;

    for(int i = 0; i<N; i++){
        cin>>d[i]>>x[i];
    }

    for(int i = N-1; i>=0; i--){
        dp[i] =1;
        if(d[i] != 0){
            for(int j = i+d[i]; j<=min(N-1, i+d[i]*x[i]); j++){
                dp[i] =(dp[i]+dp[j])%MOD;
            }
        }
    }

    cout<<dp[0]<<endl;
}
#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...