oj.uz

Submission #995324

# Submission time Handle Problem Language Result Execution time Memory
995324 2024-06-08T19:53:05 Z PagodePaiva Trains (BOI24_trains) C++17
0 / 100
 7 ms 1116 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int N = 1e5+10;
const int B = 500;
int n;
int dp[N], d[N], x[N];
int pref[N];

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--){
        dp[i] += pref[min(n, i+x[i])];
        pref[i] = pref[i+1] + dp[i];
    }
    cout << dp[1] << '\n';
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -