oj.uz

Submission #991236

# Submission time Handle Problem Language Result Execution time Memory
991236 2024-06-01T15:46:29 Z VMaksimoski008 Trains (BOI24_trains) C++17
100 / 100
 340 ms 166740 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;
using ll = long long;

const int mod = 1e9 + 7;
const int maxn = 1e5 + 5;

ll dp[maxn+5], pref[325][maxn+5], rem[325][maxn+5];

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    int n, mx = 0, mx2=0;
    cin >> n;
    int B = sqrt(n);

    vector<int> d(n+1), x(n+1);
    for(int i=0; i<n; i++) cin >> d[i] >> x[i];
    for(int i=0; i<n; i++) mx = max(mx, d[i]);
    for(int i=0; i<n; i++) mx2 = max(mx2, x[i]);

    dp[0] = 1;

    for(int i=0; i<n; i++) {
        for(int j=1; j<=B; j++) {
            pref[j][i%j] = (pref[j][i%j] - rem[j][i] + mod) % mod;
        }
        for(int j=1; j<=B; j++) {
            dp[i] += pref[j][i%j];
            dp[i] %= mod;
        }

        if(d[i] == 0) continue;

        if(d[i] > B) {
            for(int j=i+d[i]; j<=min((ll)n, (ll)i+x[i]*d[i]); j+=d[i]) dp[j] = (dp[j] + dp[i]) % mod;
        } else {
            pref[d[i]][i%d[i]] += dp[i];
            pref[d[i]][i%d[i]] %= mod;
            if((ll)i + (ll)(x[i]+1)*d[i] <= n) {
                rem[d[i]][i+(x[i]+1)*d[i]] += dp[i];
                rem[d[i]][i+(x[i]+1)*d[i]] %= mod;
            }
        }
    }
    
    ll ans = 0;
    for(int i=0; i<n; i++) ans = (ans + dp[i]) % mod;
    cout << ans << '\n';
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 9 ms 2396 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 11 ms 2140 KB Output is correct
23 Correct 7 ms 1372 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 9 ms 1484 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 8 ms 1256 KB Output is correct
28 Correct 10 ms 1372 KB Output is correct
29 Correct 9 ms 1372 KB Output is correct
30 Correct 9 ms 1572 KB Output is correct
31 Correct 12 ms 1504 KB Output is correct
32 Correct 11 ms 1472 KB Output is correct
33 Correct 12 ms 8540 KB Output is correct
34 Correct 10 ms 1372 KB Output is correct
35 Correct 10 ms 1704 KB Output is correct
36 Correct 10 ms 2140 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 6 ms 1116 KB Output is correct
3 Correct 4 ms 1116 KB Output is correct
4 Correct 9 ms 1372 KB Output is correct
5 Correct 151 ms 5228 KB Output is correct
6 Correct 218 ms 6464 KB Output is correct
7 Correct 218 ms 6996 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 10 ms 1548 KB Output is correct
12 Correct 222 ms 6660 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 10 ms 1540 KB Output is correct
15 Correct 229 ms 6484 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 3756 KB Output is correct
2 Correct 61 ms 3240 KB Output is correct
3 Correct 222 ms 6740 KB Output is correct
4 Correct 135 ms 5380 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 10 ms 1548 KB Output is correct
8 Correct 214 ms 6528 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 9 ms 2396 KB Output is correct
21 Correct 2 ms 1116 KB Output is correct
22 Correct 11 ms 2140 KB Output is correct
23 Correct 7 ms 1372 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 9 ms 1484 KB Output is correct
26 Correct 4 ms 1116 KB Output is correct
27 Correct 8 ms 1256 KB Output is correct
28 Correct 10 ms 1372 KB Output is correct
29 Correct 9 ms 1372 KB Output is correct
30 Correct 9 ms 1572 KB Output is correct
31 Correct 12 ms 1504 KB Output is correct
32 Correct 11 ms 1472 KB Output is correct
33 Correct 12 ms 8540 KB Output is correct
34 Correct 10 ms 1372 KB Output is correct
35 Correct 10 ms 1704 KB Output is correct
36 Correct 10 ms 2140 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 6 ms 1116 KB Output is correct
39 Correct 4 ms 1116 KB Output is correct
40 Correct 9 ms 1372 KB Output is correct
41 Correct 151 ms 5228 KB Output is correct
42 Correct 218 ms 6464 KB Output is correct
43 Correct 218 ms 6996 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 10 ms 1548 KB Output is correct
48 Correct 222 ms 6660 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 10 ms 1540 KB Output is correct
51 Correct 229 ms 6484 KB Output is correct
52 Correct 79 ms 3756 KB Output is correct
53 Correct 61 ms 3240 KB Output is correct
54 Correct 222 ms 6740 KB Output is correct
55 Correct 135 ms 5380 KB Output is correct
56 Correct 1 ms 360 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 10 ms 1548 KB Output is correct
59 Correct 214 ms 6528 KB Output is correct
60 Correct 173 ms 8788 KB Output is correct
61 Correct 225 ms 6740 KB Output is correct
62 Correct 230 ms 13720 KB Output is correct
63 Correct 210 ms 6224 KB Output is correct
64 Correct 229 ms 7280 KB Output is correct
65 Correct 227 ms 6748 KB Output is correct
66 Correct 215 ms 6480 KB Output is correct
67 Correct 232 ms 7004 KB Output is correct
68 Correct 223 ms 6484 KB Output is correct
69 Correct 340 ms 166740 KB Output is correct
70 Correct 218 ms 6632 KB Output is correct
71 Correct 214 ms 7060 KB Output is correct
72 Correct 231 ms 9700 KB Output is correct