This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |