| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367297 | kahoul | Trains (BOI24_trains) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
map<int, int> resp[maxn];
vector<int> resp_dp(maxn, -1);
int x[maxn];
int d[maxn];
int dp[maxn];
map<int, int> resp[maxn];
int n;
int aux(int i, int d) {
if (i >= n) return 0;
if (i == n - 1) return 1;
if (resp[i].count(d)) return resp[i][d];
return resp[i][d] = (dp[i] + aux(i + d, d)) % mod;
}
int sum (int a, int b) {
return (((a + b) % mod) + mod) % mod;
}
int main () {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> d[i] >> x[i];
}
dp[n - 1] = 1;
for (int i = n - 2; i >= 0; i--) {
dp[i] = sum(sum(1, aux(i + d[i], d[i])), -aux(i + (x[i] + 1) * d[i], d[i]));
}
cout << dp[0] << '\n';
}