oj.uz

Submission #995476

# Submission time Handle Problem Language Result Execution time Memory
995476 2024-06-09T07:01:58 Z 12345678 Trains (BOI24_trains) C++17
21 / 100
 2000 ms 3932 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=0;
vector<int> rem[nx];

void add(int idx)
{
    if (d[idx]==0) return;
    if (d[idx]>k)
    {
        if (idx+d[idx]>n) return;
        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+x[idx]*d[idx]<=n) rem[idx+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]][idx%d[idx]]=(((qs[d[idx]][idx%d[idx]]-dp[idx])%mod)+mod)%mod;
    }
    for (int i=1; i<=n; i++) res=(res+dp[i])%mod;
    cout<<res;
}

/*
7
2 4
0 3
4 2
1 4
1 1
2 1
4 2
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 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 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 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 2736 KB Output is correct
11 Correct 1 ms 2648 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 2648 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 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 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 2736 KB Output is correct
11 Correct 1 ms 2648 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 6 ms 2908 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 25 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 15 ms 2660 KB Output is correct
27 Correct 50 ms 2908 KB Output is correct
28 Correct 10 ms 2908 KB Output is correct
29 Correct 69 ms 2904 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 39 ms 2908 KB Output is correct
32 Correct 69 ms 2908 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 2 ms 2908 KB Output is correct
36 Correct 5 ms 2944 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 26 ms 2896 KB Output is correct
3 Correct 15 ms 2648 KB Output is correct
4 Correct 50 ms 2908 KB Output is correct
5 Correct 7 ms 3672 KB Output is correct
6 Execution timed out 2096 ms 3932 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 3160 KB Output is correct
2 Correct 352 ms 3268 KB Output is correct
3 Execution timed out 2052 ms 3928 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 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 1 ms 2652 KB Output is correct
7 Correct 1 ms 2652 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 2736 KB Output is correct
11 Correct 1 ms 2648 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 6 ms 2908 KB Output is correct
21 Correct 1 ms 2652 KB Output is correct
22 Correct 2 ms 2908 KB Output is correct
23 Correct 25 ms 2652 KB Output is correct
24 Correct 1 ms 2652 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 15 ms 2660 KB Output is correct
27 Correct 50 ms 2908 KB Output is correct
28 Correct 10 ms 2908 KB Output is correct
29 Correct 69 ms 2904 KB Output is correct
30 Correct 2 ms 2908 KB Output is correct
31 Correct 39 ms 2908 KB Output is correct
32 Correct 69 ms 2908 KB Output is correct
33 Correct 2 ms 2908 KB Output is correct
34 Correct 2 ms 2908 KB Output is correct
35 Correct 2 ms 2908 KB Output is correct
36 Correct 5 ms 2944 KB Output is correct
37 Correct 1 ms 2652 KB Output is correct
38 Correct 26 ms 2896 KB Output is correct
39 Correct 15 ms 2648 KB Output is correct
40 Correct 50 ms 2908 KB Output is correct
41 Correct 7 ms 3672 KB Output is correct
42 Execution timed out 2096 ms 3932 KB Time limit exceeded
43 Halted 0 ms 0 KB -