제출 #1033549

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033549		sp69t	Trains (BOI24_trains)	C++14	21 / 100	2097 ms	2908 KiB

Main

#include<bits/stdc++.h>
#define endl "\n"
#define rs resize
#define pb push_back
#define gcd __gcd 
const int mod = 1e9 + 7;
using namespace std;
void solve() {
    int n; cin >> n;
    vector<int> d(n), x(n);
    for (int i = 0; i < n; ++i) cin >> d[i] >> x[i];
    vector<int> v(n + 1, 0);
    v[1] = 1;
    for (int i = 1; i <= n; ++i) {
        if (d[i - 1] > 0 && x[i - 1] > 0) {
            int d_i = d[i - 1];
            int x_i = x[i - 1];
            for (int t = 1; t <= min(x_i, (n / d_i) + 2); ++t) {
                int city = i + t * d_i;
                if (city <= n) v[city] = (v[city] + v[i]) % mod;
                else break;
            }
        }
    }
    int res = 0;
    for (int i = 1; i <= n; ++i) res = (res + v[i]) % mod;
    cout << res;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    // int t; cin >> t;
    // while (t--) 
        solve();
    return 0;
}

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