# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033670 | vjudge1 | Trains (BOI24_trains) | C++17 | 2075 ms | 1372 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.
#include <stdio.h>
const int M = 1e9 + 7;
int n, d[100100], x[100100], v[100100];
int main() {
scanf("%d", &n);
int all1 = 1, res = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d%d", &d[i], &x[i]);
// if (d[i] != 1) all1 = 0;
}
// if (all1) {
// return 0;
// }
v[1] = 1;
for (int i = 1; i <= n; ++i) {
if (d[i] && x[i]) {
for (int t = 1; t <= x[i]; ++t) {
int c = i + t * d[i];
if (c > n) break;
v[c] = (v[c] + v[i]) % M;
}
}
}
for (int i = 1; i <= n; ++i) res = (res + v[i]) % M;
printf("%d", res);
}
Compilation message (stderr)
# | 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... |