Submission #1233599

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233599		Ariadna	Trains (BOI24_trains)	C++20	8 / 100	2094 ms	1024 KiB

Main

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int mod = 1e9+7, N = 1e5;
ll dp[N];

int main() {
    int n;
    cin >> n;
    vector<int> d(n), x(n);
    for (int i = 0; i < n; ++i) cin >> d[i] >> x[i];
    dp[0] = 1;
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j) {
            if (!d[j]) continue;
            if ((i-j)%d[j] == 0 && (i-j)/d[j] <= x[j]) dp[i]+=dp[j]; 
            dp[i] %= mod;
        }
    }
    ll tot = 0;
    for (int i = 0; i < n; ++i) tot += dp[i];
    cout << tot << endl;

    return 0;
}

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