Submission #1002240

# Submission time Handle Problem Language Result Execution time Memory
1002240 2024-06-19T11:18:57 Z Valters07 Trains (BOI24_trains) C++17
100 / 100
159 ms 127060 KB
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#define fio ios_base::sync_with_stdio(0);cin.tie(0);
#define en cin.close();return 0;
#define ll long long
#define fi first
#define se second
using namespace std;
const int N = 1e5+5;
const int SQ = sqrt(N)+2;
const int mod = 1e9+7;
int pf[N][SQ], dp[N];
int sum(int a, int b)
{
    a+=b;
    if(a>=mod)
        a-=mod;
    if(a<0)
        a+=mod;
    return a;
}
int mul(int a, int b)
{
    return 1ll*a*b%mod;
}
int main()
{
    fio
//    ifstream cin("in.in");
    int n;
    cin >> n;
    int sq = sqrt(n), res = 0;
    dp[1]=1;
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<=sq;j++)
        {
            if(i-j>=0)
                pf[i][j]=sum(pf[i][j],pf[i-j][j]);
            dp[i]=sum(dp[i],pf[i][j]);
        }
        res=sum(res,dp[i]);
        int d, x;
        cin >> d >> x;
        if(!d)
            continue;
        if(d>sq)
        {
            for(int j = 1;j<=x&&i+j*d<=n;j++)
                dp[i+j*d]=sum(dp[i+j*d],dp[i]);
        }
        else
        {
            if(i+d<=n)
                pf[i+d][d]=sum(pf[i+d][d],dp[i]);
            if(i+1ll*(x+1)*d<=n)
                pf[i+(x+1)*d][d]=sum(pf[i+(x+1)*d][d],-dp[i]);
        }
    }
    cout << res;
    return 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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
# 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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 7 ms 10844 KB Output is correct
21 Correct 3 ms 4188 KB Output is correct
22 Correct 12 ms 12892 KB Output is correct
23 Correct 5 ms 8792 KB Output is correct
24 Correct 2 ms 5468 KB Output is correct
25 Correct 8 ms 11612 KB Output is correct
26 Correct 3 ms 5980 KB Output is correct
27 Correct 6 ms 11100 KB Output is correct
28 Correct 7 ms 12892 KB Output is correct
29 Correct 7 ms 12892 KB Output is correct
30 Correct 7 ms 12884 KB Output is correct
31 Correct 7 ms 12888 KB Output is correct
32 Correct 7 ms 12892 KB Output is correct
33 Correct 9 ms 12812 KB Output is correct
34 Correct 8 ms 12944 KB Output is correct
35 Correct 7 ms 12968 KB Output is correct
36 Correct 10 ms 12892 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 5 ms 8536 KB Output is correct
3 Correct 3 ms 5980 KB Output is correct
4 Correct 7 ms 11120 KB Output is correct
5 Correct 81 ms 97108 KB Output is correct
6 Correct 110 ms 126036 KB Output is correct
7 Correct 93 ms 125960 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 7 ms 13024 KB Output is correct
12 Correct 91 ms 126420 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 7 ms 12892 KB Output is correct
15 Correct 92 ms 126216 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 43 ms 61012 KB Output is correct
2 Correct 33 ms 50772 KB Output is correct
3 Correct 110 ms 126340 KB Output is correct
4 Correct 60 ms 90708 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 7 ms 13068 KB Output is correct
8 Correct 94 ms 126548 KB Output is correct
# 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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 7 ms 10844 KB Output is correct
21 Correct 3 ms 4188 KB Output is correct
22 Correct 12 ms 12892 KB Output is correct
23 Correct 5 ms 8792 KB Output is correct
24 Correct 2 ms 5468 KB Output is correct
25 Correct 8 ms 11612 KB Output is correct
26 Correct 3 ms 5980 KB Output is correct
27 Correct 6 ms 11100 KB Output is correct
28 Correct 7 ms 12892 KB Output is correct
29 Correct 7 ms 12892 KB Output is correct
30 Correct 7 ms 12884 KB Output is correct
31 Correct 7 ms 12888 KB Output is correct
32 Correct 7 ms 12892 KB Output is correct
33 Correct 9 ms 12812 KB Output is correct
34 Correct 8 ms 12944 KB Output is correct
35 Correct 7 ms 12968 KB Output is correct
36 Correct 10 ms 12892 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 5 ms 8536 KB Output is correct
39 Correct 3 ms 5980 KB Output is correct
40 Correct 7 ms 11120 KB Output is correct
41 Correct 81 ms 97108 KB Output is correct
42 Correct 110 ms 126036 KB Output is correct
43 Correct 93 ms 125960 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 7 ms 13024 KB Output is correct
48 Correct 91 ms 126420 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 7 ms 12892 KB Output is correct
51 Correct 92 ms 126216 KB Output is correct
52 Correct 43 ms 61012 KB Output is correct
53 Correct 33 ms 50772 KB Output is correct
54 Correct 110 ms 126340 KB Output is correct
55 Correct 60 ms 90708 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 7 ms 13068 KB Output is correct
59 Correct 94 ms 126548 KB Output is correct
60 Correct 84 ms 105300 KB Output is correct
61 Correct 86 ms 126212 KB Output is correct
62 Correct 107 ms 125720 KB Output is correct
63 Correct 101 ms 126128 KB Output is correct
64 Correct 89 ms 127060 KB Output is correct
65 Correct 150 ms 126544 KB Output is correct
66 Correct 95 ms 126292 KB Output is correct
67 Correct 93 ms 126800 KB Output is correct
68 Correct 90 ms 126292 KB Output is correct
69 Correct 143 ms 125864 KB Output is correct
70 Correct 89 ms 126292 KB Output is correct
71 Correct 93 ms 125996 KB Output is correct
72 Correct 159 ms 126036 KB Output is correct