oj.uz

Submission #995305

# Submission time Handle Problem Language Result Execution time Memory
995305 2024-06-08T19:30:53 Z PagodePaiva Trains (BOI24_trains) C++17
21 / 100
 2000 ms 2908 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = 1e5+10;
const int B = 600;
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 2904 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 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 2508 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 0 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 0 ms 2652 KB Output is correct
13 Correct 0 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 0 ms 2652 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 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 2508 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 0 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 0 ms 2652 KB Output is correct
13 Correct 0 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 0 ms 2652 KB Output is correct
20 Correct 22 ms 2696 KB Output is correct
21 Correct 5 ms 2652 KB Output is correct
22 Correct 16 ms 2704 KB Output is correct
23 Correct 74 ms 2652 KB Output is correct
24 Correct 6 ms 2652 KB Output is correct
25 Correct 18 ms 2652 KB Output is correct
26 Correct 43 ms 2680 KB Output is correct
27 Correct 144 ms 2652 KB Output is correct
28 Correct 34 ms 2652 KB Output is correct
29 Correct 194 ms 2648 KB Output is correct
30 Correct 15 ms 2648 KB Output is correct
31 Correct 103 ms 2652 KB Output is correct
32 Correct 193 ms 2648 KB Output is correct
33 Correct 15 ms 2652 KB Output is correct
34 Correct 15 ms 2652 KB Output is correct
35 Correct 14 ms 2652 KB Output is correct
36 Correct 23 ms 2700 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 75 ms 2672 KB Output is correct
3 Correct 43 ms 2652 KB Output is correct
4 Correct 143 ms 2652 KB Output is correct
5 Correct 104 ms 2904 KB Output is correct
6 Execution timed out 2044 ms 2904 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1271 ms 2648 KB Output is correct
2 Correct 888 ms 2648 KB Output is correct
3 Execution timed out 2059 ms 2908 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 2904 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 0 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 2508 KB Output is correct
9 Correct 0 ms 2652 KB Output is correct
10 Correct 0 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 0 ms 2652 KB Output is correct
13 Correct 0 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2648 KB Output is correct
17 Correct 0 ms 2652 KB Output is correct
18 Correct 1 ms 2904 KB Output is correct
19 Correct 0 ms 2652 KB Output is correct
20 Correct 22 ms 2696 KB Output is correct
21 Correct 5 ms 2652 KB Output is correct
22 Correct 16 ms 2704 KB Output is correct
23 Correct 74 ms 2652 KB Output is correct
24 Correct 6 ms 2652 KB Output is correct
25 Correct 18 ms 2652 KB Output is correct
26 Correct 43 ms 2680 KB Output is correct
27 Correct 144 ms 2652 KB Output is correct
28 Correct 34 ms 2652 KB Output is correct
29 Correct 194 ms 2648 KB Output is correct
30 Correct 15 ms 2648 KB Output is correct
31 Correct 103 ms 2652 KB Output is correct
32 Correct 193 ms 2648 KB Output is correct
33 Correct 15 ms 2652 KB Output is correct
34 Correct 15 ms 2652 KB Output is correct
35 Correct 14 ms 2652 KB Output is correct
36 Correct 23 ms 2700 KB Output is correct
37 Correct 1 ms 2648 KB Output is correct
38 Correct 75 ms 2672 KB Output is correct
39 Correct 43 ms 2652 KB Output is correct
40 Correct 143 ms 2652 KB Output is correct
41 Correct 104 ms 2904 KB Output is correct
42 Execution timed out 2044 ms 2904 KB Time limit exceeded
43 Halted 0 ms 0 KB -