oj.uz

Submission #995503

# Submission time Handle Problem Language Result Execution time Memory
995503 2024-06-09T07:38:49 Z 12345678 Trains (BOI24_trains) C++17
100 / 100
 122 ms 5712 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=1e5+5, mod=1e9+7, kx=255;

int n, d[nx], x[nx], qs[kx][kx], dp[nx], res, k=250;
vector<int> rem[nx];

void add(int idx)
{
    if (d[idx]==0||x[idx]==0) return;
    if (d[idx]>k)
    {
        for (int i=idx+d[idx], j=0; j<x[idx]&&i<=n; j++, i+=d[idx]) dp[i]=(dp[i]+dp[idx])%mod;
    }
    else
    {
        qs[d[idx]][idx%d[idx]]=(qs[d[idx]][idx%d[idx]]+dp[idx])%mod;
        if (idx+((long long)x[idx])*d[idx]<=n) rem[idx+((long long)x[idx])*d[idx]].push_back(idx); 
    }
}

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>d[i]>>x[i];
    dp[1]=1;
    add(1);
    for (int i=2; i<=n; i++)
    {
        for (int j=1; j<=k; j++) dp[i]=(dp[i]+qs[j][i%j])%mod;
        add(i);
        for (auto idx:rem[i]) qs[d[idx]][i%d[idx]]=((qs[d[idx]][i%d[idx]]-dp[idx])%mod+mod)%mod;
    }
    for (int i=1; i<=n; i++) res=(res+dp[i])%mod;
    cout<<res;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2760 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 10 ms 2972 KB Output is correct
21 Correct 4 ms 2908 KB Output is correct
22 Correct 11 ms 2940 KB Output is correct
23 Correct 8 ms 2908 KB Output is correct
24 Correct 6 ms 2904 KB Output is correct
25 Correct 11 ms 2908 KB Output is correct
26 Correct 6 ms 2872 KB Output is correct
27 Correct 10 ms 2908 KB Output is correct
28 Correct 11 ms 2908 KB Output is correct
29 Correct 11 ms 2936 KB Output is correct
30 Correct 12 ms 3164 KB Output is correct
31 Correct 11 ms 2928 KB Output is correct
32 Correct 12 ms 2904 KB Output is correct
33 Correct 11 ms 3164 KB Output is correct
34 Correct 11 ms 3164 KB Output is correct
35 Correct 11 ms 3188 KB Output is correct
36 Correct 11 ms 2908 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 8 ms 2908 KB Output is correct
3 Correct 5 ms 2652 KB Output is correct
4 Correct 10 ms 2908 KB Output is correct
5 Correct 85 ms 5208 KB Output is correct
6 Correct 103 ms 3920 KB Output is correct
7 Correct 104 ms 4216 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2648 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 11 ms 2916 KB Output is correct
12 Correct 104 ms 3940 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 11 ms 2920 KB Output is correct
15 Correct 105 ms 3732 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 3252 KB Output is correct
2 Correct 42 ms 3164 KB Output is correct
3 Correct 102 ms 3924 KB Output is correct
4 Correct 78 ms 3420 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 13 ms 2908 KB Output is correct
8 Correct 107 ms 3952 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2760 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2652 KB Output is correct
16 Correct 1 ms 2652 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 10 ms 2972 KB Output is correct
21 Correct 4 ms 2908 KB Output is correct
22 Correct 11 ms 2940 KB Output is correct
23 Correct 8 ms 2908 KB Output is correct
24 Correct 6 ms 2904 KB Output is correct
25 Correct 11 ms 2908 KB Output is correct
26 Correct 6 ms 2872 KB Output is correct
27 Correct 10 ms 2908 KB Output is correct
28 Correct 11 ms 2908 KB Output is correct
29 Correct 11 ms 2936 KB Output is correct
30 Correct 12 ms 3164 KB Output is correct
31 Correct 11 ms 2928 KB Output is correct
32 Correct 12 ms 2904 KB Output is correct
33 Correct 11 ms 3164 KB Output is correct
34 Correct 11 ms 3164 KB Output is correct
35 Correct 11 ms 3188 KB Output is correct
36 Correct 11 ms 2908 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 8 ms 2908 KB Output is correct
39 Correct 5 ms 2652 KB Output is correct
40 Correct 10 ms 2908 KB Output is correct
41 Correct 85 ms 5208 KB Output is correct
42 Correct 103 ms 3920 KB Output is correct
43 Correct 104 ms 4216 KB Output is correct
44 Correct 1 ms 2652 KB Output is correct
45 Correct 1 ms 2648 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 11 ms 2916 KB Output is correct
48 Correct 104 ms 3940 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 11 ms 2920 KB Output is correct
51 Correct 105 ms 3732 KB Output is correct
52 Correct 51 ms 3252 KB Output is correct
53 Correct 42 ms 3164 KB Output is correct
54 Correct 102 ms 3924 KB Output is correct
55 Correct 78 ms 3420 KB Output is correct
56 Correct 1 ms 2652 KB Output is correct
57 Correct 1 ms 2652 KB Output is correct
58 Correct 13 ms 2908 KB Output is correct
59 Correct 107 ms 3952 KB Output is correct
60 Correct 88 ms 3668 KB Output is correct
61 Correct 102 ms 3932 KB Output is correct
62 Correct 109 ms 5712 KB Output is correct
63 Correct 103 ms 3928 KB Output is correct
64 Correct 111 ms 3924 KB Output is correct
65 Correct 120 ms 4188 KB Output is correct
66 Correct 105 ms 3924 KB Output is correct
67 Correct 109 ms 4184 KB Output is correct
68 Correct 105 ms 3924 KB Output is correct
69 Correct 122 ms 5624 KB Output is correct
70 Correct 104 ms 4116 KB Output is correct
71 Correct 103 ms 4108 KB Output is correct
72 Correct 112 ms 4184 KB Output is correct