oj.uz

Submission #1002144

# Submission time Handle Problem Language Result Execution time Memory
1002144 2024-06-19T10:24:54 Z Khanhcsp2 Trains (BOI24_trains) C++14
100 / 100
 320 ms 404560 KB 
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e5+11;
int n, d[N], x[N], dp[N], pfs[N][511];
void sol()
{
    cin >> n;
    for(int i=1; i<=n; i++) cin >> d[i] >> x[i];
    for(int i=n; i>=1; i--)
    {
        dp[i]=1;
        if(d[i]>=500) for(int j=1; j<=x[i] && i+j*d[i]<=n; j++) dp[i]=(dp[i]+dp[i+j*d[i]])%mod;
        else if(d[i])
        {
            if(i+d[i]<=n) dp[i]=(dp[i]+pfs[i+d[i]][d[i]])%mod;
            if(i+d[i]*(x[i]+1)<=n) dp[i]=(dp[i]-pfs[i+d[i]*(x[i]+1)][d[i]])%mod;
        }
        for(int j=1;j<500;j++)
        {
            pfs[i][j]=dp[i];
            if(i+j<=n) pfs[i][j]=(pfs[i][j]+pfs[i+j][j])%mod;
        }
    }
    cout << (dp[1]+mod)%mod;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}

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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 26 ms 33764 KB Output is correct
21 Correct 9 ms 12380 KB Output is correct
22 Correct 27 ms 40580 KB Output is correct
23 Correct 21 ms 26440 KB Output is correct
24 Correct 12 ms 16772 KB Output is correct
25 Correct 30 ms 36444 KB Output is correct
26 Correct 12 ms 18524 KB Output is correct
27 Correct 26 ms 34900 KB Output is correct
28 Correct 27 ms 40784 KB Output is correct
29 Correct 27 ms 40792 KB Output is correct
30 Correct 28 ms 40796 KB Output is correct
31 Correct 27 ms 40684 KB Output is correct
32 Correct 26 ms 40812 KB Output is correct
33 Correct 30 ms 40712 KB Output is correct
34 Correct 29 ms 40788 KB Output is correct
35 Correct 27 ms 40588 KB Output is correct
36 Correct 35 ms 40712 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 17 ms 26336 KB Output is correct
3 Correct 15 ms 18416 KB Output is correct
4 Correct 24 ms 34908 KB Output is correct
5 Correct 230 ms 311632 KB Output is correct
6 Correct 263 ms 403472 KB Output is correct
7 Correct 259 ms 403540 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 348 KB Output is correct
11 Correct 29 ms 40788 KB Output is correct
12 Correct 291 ms 403948 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 32 ms 40788 KB Output is correct
15 Correct 281 ms 403792 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 194724 KB Output is correct
2 Correct 109 ms 161876 KB Output is correct
3 Correct 320 ms 404040 KB Output is correct
4 Correct 193 ms 289372 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 30 ms 40748 KB Output is correct
8 Correct 282 ms 404056 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 26 ms 33764 KB Output is correct
21 Correct 9 ms 12380 KB Output is correct
22 Correct 27 ms 40580 KB Output is correct
23 Correct 21 ms 26440 KB Output is correct
24 Correct 12 ms 16772 KB Output is correct
25 Correct 30 ms 36444 KB Output is correct
26 Correct 12 ms 18524 KB Output is correct
27 Correct 26 ms 34900 KB Output is correct
28 Correct 27 ms 40784 KB Output is correct
29 Correct 27 ms 40792 KB Output is correct
30 Correct 28 ms 40796 KB Output is correct
31 Correct 27 ms 40684 KB Output is correct
32 Correct 26 ms 40812 KB Output is correct
33 Correct 30 ms 40712 KB Output is correct
34 Correct 29 ms 40788 KB Output is correct
35 Correct 27 ms 40588 KB Output is correct
36 Correct 35 ms 40712 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 17 ms 26336 KB Output is correct
39 Correct 15 ms 18416 KB Output is correct
40 Correct 24 ms 34908 KB Output is correct
41 Correct 230 ms 311632 KB Output is correct
42 Correct 263 ms 403472 KB Output is correct
43 Correct 259 ms 403540 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 29 ms 40788 KB Output is correct
48 Correct 291 ms 403948 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 32 ms 40788 KB Output is correct
51 Correct 281 ms 403792 KB Output is correct
52 Correct 155 ms 194724 KB Output is correct
53 Correct 109 ms 161876 KB Output is correct
54 Correct 320 ms 404040 KB Output is correct
55 Correct 193 ms 289372 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 30 ms 40748 KB Output is correct
59 Correct 282 ms 404056 KB Output is correct
60 Correct 251 ms 336484 KB Output is correct
61 Correct 297 ms 403684 KB Output is correct
62 Correct 276 ms 403284 KB Output is correct
63 Correct 278 ms 403576 KB Output is correct
64 Correct 308 ms 404560 KB Output is correct
65 Correct 287 ms 403904 KB Output is correct
66 Correct 277 ms 404044 KB Output is correct
67 Correct 279 ms 404128 KB Output is correct
68 Correct 280 ms 403792 KB Output is correct
69 Correct 272 ms 403508 KB Output is correct
70 Correct 284 ms 403884 KB Output is correct
71 Correct 298 ms 403792 KB Output is correct
72 Correct 264 ms 403536 KB Output is correct