제출 #1137141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137141		SulA	Trains (BOI24_trains)	C++20	21 / 100	2096 ms	1604 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define bitcount __builtin_popcountll
#define all(a) (a).begin(), (a).end()
using namespace std;
using namespace __gnu_pbds;
template<typename T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int MOD = 1e9+7;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    int n; cin>>n;
    int jump[n], lim[n];
    for (int i = 0; i < n; cin>> jump[i] >> lim[i++]);
    int dp[n]{};
    for (int i = n-1; i >= 0; i--) {
        dp[i] = 1;
        if (jump[i] == 0) continue;
        for (int j = 1; j <= lim[i] && i + j*jump[i] < n; j++) {
            dp[i] += dp[i + j*jump[i]];
            if (dp[i] >= MOD) dp[i] -= MOD;
        }
    }
    cout<<dp[0];
}

• Subtask 1: 8 / 8
• Subtask 2: 13 / 13
• Subtask 3: 0 / 16
• Subtask 4: 0 / 34
• Subtask 5: 0 / 29