#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod = 1e9+7, N = 1e5;
ll dp[N];
int main() {
int n;
cin >> n;
vector<int> d(n), x(n);
for (int i = 0; i < n; ++i) cin >> d[i] >> x[i];
vector<int> final(n);
for (int i = 0; i < n; ++i) final[i] = min(n, i+d[i]*x[i]+1);
dp[n-1] = 1;
vector<ll> suff(n+1, 0);
suff[n-1] = dp[n-1];
for (int i = n-2; i >= 0; --i) {
dp[i] = (1+suff[i+1]-suff[final[i]]+mod)%mod;
suff[i] = (suff[i+1]+dp[i])%mod;
}
cout << dp[0] << endl;
return 0;
}
# | 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... |