Submission #1063161

#TimeUsernameProblemLanguageResultExecution timeMemory
1063161antonTrains (BOI24_trains)C++17
0 / 100
17 ms3416 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define pii pair<int, int> const int MAX_N = 1e5; const int MOD = 1e9+7; int N; int d[MAX_N]; int x[MAX_N]; int dp[MAX_N]; int sufs[MAX_N+1]; signed main(){ cin>>N; for(int i = 0; i<N; i++){ cin>>d[i]>>x[i]; } sufs[N] = 0; for(int i = N-1; i>=0; i--){ dp[i] =1; dp[i] = (dp[i]+sufs[i+1]-sufs[min(N, i+x[i]+1)])%MOD; sufs[i]= (sufs[i+1]+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...