oj.uz

Submission #997816

# Submission time Handle Problem Language Result Execution time Memory
997816 2024-06-12T23:42:47 Z jj_master Trains (BOI24_trains) C++17
100 / 100
 90 ms 6356 KB 
/** Baltic Olympiad in Informatics 2024 **/
 
#include <bits/stdc++.h>
 
using namespace std;
 
const int md = 1e9 + 7;
 
int add(int a, int b) { 
  if (a + b < md) {
    return a + b;
  } else {
    return a + b - md;
  }
}
 
int sub(int a, int b) {
  if (a >= b) {
    return a - b;
  } else {
    return a - b + md;
  }
}
 
void ckadd(int& a, int b) {
  a = add(a, b);
}
 
void cksub(int& a, int b) {
  a = sub(a, b);
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> d(n), x(n);
  for (int i = 0; i < n; i++) {
    cin >> d[i] >> x[i];
  }
  const int B = 300;
  vector<int> dp(n);
  dp[0] = 1;
  vector<vector<int>> sum(B, vector<int>(B));
  vector<vector<array<int, 3>>> qs(n + 1);
  for (int i = 0; i < n; i++) {
    for (auto p : qs[i]) {
      cksub(sum[p[0]][p[1]], p[2]);
    }
    for (int j = 1; j < B; j++) {
      ckadd(dp[i], sum[j][i % j]);
    }
    if (d[i] == 0) {
      continue;
    }
    if (d[i] < B) {
      ckadd(sum[d[i]][i % d[i]], dp[i]);
      qs[min((long long) n, i + d[i] * 1ll * x[i] + 1)].push_back({d[i], i % d[i], dp[i]});
    } else {
      for (int j = 1; j <= x[i] && i + j * d[i] < n; j++) {
        ckadd(dp[i + j * d[i]], dp[i]);
      }
    }
  }
  int res = 0;
  for (int i = 0; i < n; i++) {
    ckadd(res, dp[i]);
  }
  cout << res << '\n';
  return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 684 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 632 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 684 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 632 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 7 ms 1116 KB Output is correct
21 Correct 3 ms 956 KB Output is correct
22 Correct 8 ms 1116 KB Output is correct
23 Correct 5 ms 1116 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 8 ms 1428 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 7 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 8 ms 1424 KB Output is correct
30 Correct 8 ms 1116 KB Output is correct
31 Correct 8 ms 1204 KB Output is correct
32 Correct 8 ms 1372 KB Output is correct
33 Correct 10 ms 1276 KB Output is correct
34 Correct 8 ms 1116 KB Output is correct
35 Correct 8 ms 1116 KB Output is correct
36 Correct 8 ms 1436 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 6 ms 1156 KB Output is correct
3 Correct 4 ms 1056 KB Output is correct
4 Correct 7 ms 1372 KB Output is correct
5 Correct 65 ms 5240 KB Output is correct
6 Correct 79 ms 5964 KB Output is correct
7 Correct 80 ms 6244 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 8 ms 1268 KB Output is correct
12 Correct 80 ms 6004 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 8 ms 1456 KB Output is correct
15 Correct 79 ms 5836 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 3404 KB Output is correct
2 Correct 31 ms 2884 KB Output is correct
3 Correct 80 ms 5924 KB Output is correct
4 Correct 59 ms 4812 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 10 ms 1372 KB Output is correct
8 Correct 83 ms 5956 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 684 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 632 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 856 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 7 ms 1116 KB Output is correct
21 Correct 3 ms 956 KB Output is correct
22 Correct 8 ms 1116 KB Output is correct
23 Correct 5 ms 1116 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 8 ms 1428 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 7 ms 1372 KB Output is correct
28 Correct 8 ms 1372 KB Output is correct
29 Correct 8 ms 1424 KB Output is correct
30 Correct 8 ms 1116 KB Output is correct
31 Correct 8 ms 1204 KB Output is correct
32 Correct 8 ms 1372 KB Output is correct
33 Correct 10 ms 1276 KB Output is correct
34 Correct 8 ms 1116 KB Output is correct
35 Correct 8 ms 1116 KB Output is correct
36 Correct 8 ms 1436 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 6 ms 1156 KB Output is correct
39 Correct 4 ms 1056 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 65 ms 5240 KB Output is correct
42 Correct 79 ms 5964 KB Output is correct
43 Correct 80 ms 6244 KB Output is correct
44 Correct 0 ms 600 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 0 ms 604 KB Output is correct
47 Correct 8 ms 1268 KB Output is correct
48 Correct 80 ms 6004 KB Output is correct
49 Correct 0 ms 600 KB Output is correct
50 Correct 8 ms 1456 KB Output is correct
51 Correct 79 ms 5836 KB Output is correct
52 Correct 38 ms 3404 KB Output is correct
53 Correct 31 ms 2884 KB Output is correct
54 Correct 80 ms 5924 KB Output is correct
55 Correct 59 ms 4812 KB Output is correct
56 Correct 0 ms 604 KB Output is correct
57 Correct 0 ms 604 KB Output is correct
58 Correct 10 ms 1372 KB Output is correct
59 Correct 83 ms 5956 KB Output is correct
60 Correct 69 ms 5352 KB Output is correct
61 Correct 82 ms 5804 KB Output is correct
62 Correct 83 ms 6356 KB Output is correct
63 Correct 81 ms 5908 KB Output is correct
64 Correct 82 ms 4188 KB Output is correct
65 Correct 90 ms 4724 KB Output is correct
66 Correct 78 ms 5912 KB Output is correct
67 Correct 82 ms 4184 KB Output is correct
68 Correct 78 ms 5196 KB Output is correct
69 Correct 86 ms 6344 KB Output is correct
70 Correct 83 ms 4332 KB Output is correct
71 Correct 77 ms 4188 KB Output is correct
72 Correct 81 ms 5860 KB Output is correct