Submission #1063152

#TimeUsernameProblemLanguageResultExecution timeMemory
1063152antonTrains (BOI24_trains)C++17
0 / 100
4 ms604 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];
    }

    int sufs= 0;
    for(int i = N-1; i>=0; i--){
        dp[i] =1;
        dp[i] = (dp[i]+sufs)%MOD;
        sufs=  (sufs+dp[i])%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...