oj.uz

Submission #995307

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

using namespace std;

const int N = 1e5+10;
const int B = 400;
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 1 ms 860 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 0 ms 860 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 0 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 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 1 ms 860 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 0 ms 860 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 0 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 ms 860 KB Output is correct
20 Correct 20 ms 1112 KB Output is correct
21 Correct 4 ms 1116 KB Output is correct
22 Correct 17 ms 1116 KB Output is correct
23 Correct 74 ms 1148 KB Output is correct
24 Correct 6 ms 1116 KB Output is correct
25 Correct 16 ms 1204 KB Output is correct
26 Correct 44 ms 1124 KB Output is correct
27 Correct 141 ms 1112 KB Output is correct
28 Correct 32 ms 1112 KB Output is correct
29 Correct 191 ms 1196 KB Output is correct
30 Correct 17 ms 1116 KB Output is correct
31 Correct 101 ms 1116 KB Output is correct
32 Correct 191 ms 1192 KB Output is correct
33 Correct 13 ms 1112 KB Output is correct
34 Correct 12 ms 1116 KB Output is correct
35 Correct 12 ms 1116 KB Output is correct
36 Correct 21 ms 1116 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 860 KB Output is correct
2 Correct 72 ms 1116 KB Output is correct
3 Correct 42 ms 1116 KB Output is correct
4 Correct 141 ms 1176 KB Output is correct
5 Correct 95 ms 1880 KB Output is correct
6 Execution timed out 2049 ms 2140 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1266 ms 1628 KB Output is correct
2 Correct 888 ms 1548 KB Output is correct
3 Execution timed out 2099 ms 2136 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 1 ms 860 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 0 ms 860 KB Output is correct
5 Correct 1 ms 856 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 0 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 0 ms 860 KB Output is correct
13 Correct 0 ms 860 KB Output is correct
14 Correct 0 ms 860 KB Output is correct
15 Correct 1 ms 860 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 0 ms 860 KB Output is correct
18 Correct 1 ms 860 KB Output is correct
19 Correct 0 ms 860 KB Output is correct
20 Correct 20 ms 1112 KB Output is correct
21 Correct 4 ms 1116 KB Output is correct
22 Correct 17 ms 1116 KB Output is correct
23 Correct 74 ms 1148 KB Output is correct
24 Correct 6 ms 1116 KB Output is correct
25 Correct 16 ms 1204 KB Output is correct
26 Correct 44 ms 1124 KB Output is correct
27 Correct 141 ms 1112 KB Output is correct
28 Correct 32 ms 1112 KB Output is correct
29 Correct 191 ms 1196 KB Output is correct
30 Correct 17 ms 1116 KB Output is correct
31 Correct 101 ms 1116 KB Output is correct
32 Correct 191 ms 1192 KB Output is correct
33 Correct 13 ms 1112 KB Output is correct
34 Correct 12 ms 1116 KB Output is correct
35 Correct 12 ms 1116 KB Output is correct
36 Correct 21 ms 1116 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 72 ms 1116 KB Output is correct
39 Correct 42 ms 1116 KB Output is correct
40 Correct 141 ms 1176 KB Output is correct
41 Correct 95 ms 1880 KB Output is correct
42 Execution timed out 2049 ms 2140 KB Time limit exceeded
43 Halted 0 ms 0 KB -