oj.uz

Submission #1005636

# Submission time Handle Problem Language Result Execution time Memory
1005636 2024-06-22T16:47:46 Z TrinhKhanhDung Trains (BOI24_trains) C++14
100 / 100
 77 ms 253176 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)
#define int ll

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1e5 + 10;

int N;
int d[MAX], t[MAX];

void input(){
    cin >> N;
    for(int i=1; i<=N; i++){
        cin >> d[i] >> t[i];
    }
}

namespace subtask2{
    int f[MAX];

    void solve(){
        f[1] = 1;
        for(int i=1; i<=N; i++) if(f[i] && d[i]){
            for(int j=1; j<=t[i]; j++){
                if(i + 1LL * d[i] * j > N) break;
                add(f[i + d[i] * j], f[i]);
            }
        }

        int ans = 0;
        for(int i=1; i<=N; i++){
            add(ans, f[i]);
        }
        cout << ans << '\n';
    }
}

namespace subtask3{
    bool check(){
        for(int i=1; i<=N; i++){
            if(d[i] != 1) return false;
        }
        return true;
    }

    int f[MAX];

    void solve(){
        f[1] = 1;
        for(int i=1; i<=N; i++){
            add(f[i], f[i - 1]);
            int p = min(1LL * N, i + 1LL * d[i] * t[i]);
            add(f[i + 1], 1);
            sub(f[p + 1], 1);
        }

        int ans = 0;
        for(int i=1; i<=N; i++){
            add(ans, f[i]);
        }
        cout << ans << '\n';
    }
}

namespace subtask5{
    const int S = sqrt(MAX + 10);

    int f[MAX], g[MAX][S];

    void solve(){
        for(int i=N; i>=1; i--){
            if(d[i] < S){
                if(d[i] && t[i]){
                    ll st = i + d[i];
                    ll en = i + d[i] * (t[i] + 1);
                    if(st <= N){
                        if(en <= N)
                            add(f[i], (g[st][d[i]] - g[en][d[i]] + MOD) % MOD);
                        else
                            add(f[i], g[st][d[i]]);
                    }
                }
            }
            else if(d[i]){
                for(int j=1; j<=t[i] && i + 1LL * j * d[i] <= N; j++){
                    add(f[i], f[i + 1LL * j * d[i]]);
                }
            }
            f[i]++;

            for(int j=1; j<S; j++){
                g[i][j] = f[i];
                if(i + j <=N ) add(g[i][j], g[i + j][j]);
            }
//            cout << f[i] << ' ';
        }

        cout << f[1];
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("netw.inp", "r", stdin);
//    freopen("netw.out", "w", stdout);

    input();

    return subtask5::solve(), 0;

    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2516 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2488 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 5 ms 23388 KB Output is correct
21 Correct 2 ms 10844 KB Output is correct
22 Correct 6 ms 27480 KB Output is correct
23 Correct 4 ms 19036 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 9 ms 25460 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 6 ms 25308 KB Output is correct
28 Correct 6 ms 27348 KB Output is correct
29 Correct 6 ms 27580 KB Output is correct
30 Correct 6 ms 27484 KB Output is correct
31 Correct 6 ms 27484 KB Output is correct
32 Correct 6 ms 27484 KB Output is correct
33 Correct 6 ms 27484 KB Output is correct
34 Correct 8 ms 27564 KB Output is correct
35 Correct 7 ms 27484 KB Output is correct
36 Correct 6 ms 27304 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 4 ms 19084 KB Output is correct
3 Correct 3 ms 14940 KB Output is correct
4 Correct 5 ms 25204 KB Output is correct
5 Correct 43 ms 196688 KB Output is correct
6 Correct 58 ms 251280 KB Output is correct
7 Correct 63 ms 251212 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 6 ms 27228 KB Output is correct
12 Correct 68 ms 251344 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 6 ms 27228 KB Output is correct
15 Correct 59 ms 251164 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 122196 KB Output is correct
2 Correct 24 ms 103764 KB Output is correct
3 Correct 61 ms 251296 KB Output is correct
4 Correct 48 ms 182248 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 6 ms 27484 KB Output is correct
8 Correct 60 ms 252592 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2516 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2488 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 5 ms 23388 KB Output is correct
21 Correct 2 ms 10844 KB Output is correct
22 Correct 6 ms 27480 KB Output is correct
23 Correct 4 ms 19036 KB Output is correct
24 Correct 3 ms 12892 KB Output is correct
25 Correct 9 ms 25460 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 6 ms 25308 KB Output is correct
28 Correct 6 ms 27348 KB Output is correct
29 Correct 6 ms 27580 KB Output is correct
30 Correct 6 ms 27484 KB Output is correct
31 Correct 6 ms 27484 KB Output is correct
32 Correct 6 ms 27484 KB Output is correct
33 Correct 6 ms 27484 KB Output is correct
34 Correct 8 ms 27564 KB Output is correct
35 Correct 7 ms 27484 KB Output is correct
36 Correct 6 ms 27304 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 4 ms 19084 KB Output is correct
39 Correct 3 ms 14940 KB Output is correct
40 Correct 5 ms 25204 KB Output is correct
41 Correct 43 ms 196688 KB Output is correct
42 Correct 58 ms 251280 KB Output is correct
43 Correct 63 ms 251212 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 6 ms 27228 KB Output is correct
48 Correct 68 ms 251344 KB Output is correct
49 Correct 0 ms 2396 KB Output is correct
50 Correct 6 ms 27228 KB Output is correct
51 Correct 59 ms 251164 KB Output is correct
52 Correct 31 ms 122196 KB Output is correct
53 Correct 24 ms 103764 KB Output is correct
54 Correct 61 ms 251296 KB Output is correct
55 Correct 48 ms 182248 KB Output is correct
56 Correct 1 ms 2392 KB Output is correct
57 Correct 1 ms 2396 KB Output is correct
58 Correct 6 ms 27484 KB Output is correct
59 Correct 60 ms 252592 KB Output is correct
60 Correct 70 ms 212076 KB Output is correct
61 Correct 62 ms 252244 KB Output is correct
62 Correct 59 ms 251812 KB Output is correct
63 Correct 55 ms 252240 KB Output is correct
64 Correct 66 ms 253176 KB Output is correct
65 Correct 77 ms 252608 KB Output is correct
66 Correct 58 ms 252360 KB Output is correct
67 Correct 62 ms 252804 KB Output is correct
68 Correct 63 ms 252332 KB Output is correct
69 Correct 64 ms 251984 KB Output is correct
70 Correct 60 ms 252372 KB Output is correct
71 Correct 55 ms 252172 KB Output is correct
72 Correct 57 ms 252500 KB Output is correct