oj.uz

Submission #995312

# Submission time Handle Problem Language Result Execution time Memory
995312 2024-06-08T19:35:58 Z PagodePaiva Trains (BOI24_trains) C++17
21 / 100
 2000 ms 1880 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int N = 1e5+10;
const int B = sqrt(N);
int n;
int d[N], x[N], dp[N];
int pref[B][B];
const int mod = 1e9+7;

void calc(int pos){
    if(d[pos] == 0) return;
    int comp = x[pos];
    comp = min(comp, (n-pos)/d[pos]);
    //cout << pos << ' ' << comp << ' ';
    if(pos+comp*d[pos] <= n){
        for(int i = 1;i <= comp;i++){
            dp[pos] += dp[pos+d[pos]*i];
            dp[pos] %= mod;
        }
        return;
    }
    else{
        dp[pos] += pref[d[pos]][pos % d[pos]];
        dp[pos] %= mod;
        return;
    }
}

void upd(int pos){
    for(int i = 1;i < B;i++){
        pref[i][pos % i] += dp[pos];
        pref[i][pos % i] %= mod;
    }
    return;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> d[i] >> x[i];
    }
    for(int i = 1;i <= n;i++){
        dp[i] = 1;
    }
    for(int i = n;i >= 1;i--){
        calc(i);
        upd(i);
    }
    cout << dp[1] << '\n';
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 0 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 684 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 0 ms 860 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 856 KB Output is correct
2 Correct 0 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 684 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 0 ms 860 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 17 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 10 ms 860 KB Output is correct
23 Correct 70 ms 860 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 12 ms 964 KB Output is correct
26 Correct 41 ms 860 KB Output is correct
27 Correct 139 ms 856 KB Output is correct
28 Correct 28 ms 856 KB Output is correct
29 Correct 189 ms 952 KB Output is correct
30 Correct 9 ms 860 KB Output is correct
31 Correct 100 ms 952 KB Output is correct
32 Correct 187 ms 860 KB Output is correct
33 Correct 10 ms 860 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 9 ms 976 KB Output is correct
36 Correct 19 ms 956 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 70 ms 860 KB Output is correct
3 Correct 40 ms 856 KB Output is correct
4 Correct 137 ms 936 KB Output is correct
5 Correct 63 ms 1748 KB Output is correct
6 Execution timed out 2023 ms 1880 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1247 ms 1400 KB Output is correct
2 Correct 878 ms 1308 KB Output is correct
3 Execution timed out 2037 ms 1880 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 856 KB Output is correct
2 Correct 0 ms 856 KB Output is correct
3 Correct 1 ms 860 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 860 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 684 KB Output is correct
9 Correct 1 ms 856 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 0 ms 860 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 1 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 17 ms 860 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 10 ms 860 KB Output is correct
23 Correct 70 ms 860 KB Output is correct
24 Correct 4 ms 856 KB Output is correct
25 Correct 12 ms 964 KB Output is correct
26 Correct 41 ms 860 KB Output is correct
27 Correct 139 ms 856 KB Output is correct
28 Correct 28 ms 856 KB Output is correct
29 Correct 189 ms 952 KB Output is correct
30 Correct 9 ms 860 KB Output is correct
31 Correct 100 ms 952 KB Output is correct
32 Correct 187 ms 860 KB Output is correct
33 Correct 10 ms 860 KB Output is correct
34 Correct 8 ms 860 KB Output is correct
35 Correct 9 ms 976 KB Output is correct
36 Correct 19 ms 956 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 70 ms 860 KB Output is correct
39 Correct 40 ms 856 KB Output is correct
40 Correct 137 ms 936 KB Output is correct
41 Correct 63 ms 1748 KB Output is correct
42 Execution timed out 2023 ms 1880 KB Time limit exceeded
43 Halted 0 ms 0 KB -