oj.uz

Submission #995322

# Submission time Handle Problem Language Result Execution time Memory
995322 2024-06-08T19:45:40 Z PagodePaiva Trains (BOI24_trains) C++17
42 / 100
 139 ms 2560 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int N = 1e5+10;
const int B = 500;
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(comp < 2*B){
        for(int i = 1;pos+d[pos]*i <= n and 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 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1436 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1436 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 22 ms 1372 KB Output is correct
21 Correct 5 ms 1484 KB Output is correct
22 Correct 15 ms 1372 KB Output is correct
23 Incorrect 11 ms 1372 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Incorrect 11 ms 1372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 1984 KB Output is correct
2 Correct 64 ms 1884 KB Output is correct
3 Correct 139 ms 2392 KB Output is correct
4 Correct 99 ms 2136 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 16 ms 1560 KB Output is correct
8 Correct 137 ms 2560 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1372 KB Output is correct
8 Correct 1 ms 1372 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 1 ms 1372 KB Output is correct
13 Correct 1 ms 1372 KB Output is correct
14 Correct 1 ms 1372 KB Output is correct
15 Correct 1 ms 1436 KB Output is correct
16 Correct 1 ms 1372 KB Output is correct
17 Correct 1 ms 1372 KB Output is correct
18 Correct 1 ms 1372 KB Output is correct
19 Correct 1 ms 1372 KB Output is correct
20 Correct 22 ms 1372 KB Output is correct
21 Correct 5 ms 1484 KB Output is correct
22 Correct 15 ms 1372 KB Output is correct
23 Incorrect 11 ms 1372 KB Output isn't correct
24 Halted 0 ms 0 KB -