# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033912 | trucmai | Trains (BOI24_trains) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
ll add(ll x, ll y) { return (x + y % MOD) % MOD; }
ll sub(ll x, ll y) { return (x - y % MOD + MOD) % MOD; }
ll mul(ll x, ll y) { return (x * y) % MOD; }
void upd(ll& x, ll y) { x = add(x, y); }
ll dp[N], d[N], x[N];
const int BS = 350;
ll sum[N][BS];
signed main()
{
cin.tie(0)->sync_with_stdio(0);
auto solver = [&]() {
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> d[i] >> x[i];
for (int i = n; i >= 1; --i) {
dp[i] = 1;
if (d[i] > BS) {
for (int j = 1; j <= x[i]; ++j) {
if (i + d[i] * j > n) break;
dp[i] = add(dp[i],dp[i + d[i]*j]);
}
}
if (d[i] <= BS && d[i] > 0 && x[i] > 0) {
dp[i] = add(dp[i],sum[i + d[i]][d[i]]);
if (i + (x[i] + 1) * d[i] <= n)
dp[i] = sub(dp[i],sum[i + (x[i] + 1)*d[i]][d[i]]);
}
for (int j = 1; j <= BS; ++j)
sum[i][j] = add(sum[i + j][j],dp[i]);
}
cout << dp[1] << endl;
};
int t = 1; // cin>>t;
while (t--)
solver();
}