oj.uz

답안 #1084750

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084750 2024-09-06T23:02:28 Z zxcigan Trains (BOI24_trains) C++17
34 / 100
 179 ms 9940 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int long long
const int N = 2e5;
const int mod = 1e9 + 7;
const int B = 335;
int dp[N];
int32_t main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    dp[1] = 1;
    int s = 0;
    vector<vector<int>> add (B + 1, vector<int> (B + 1, 0));
    set<array<int,4>> st;
    for (int i = 1; i <= n; ++i) {
        int x, d;
        cin >> d >> x;
        for (int j = 1; j < B; ++j) {
            (dp[i] += add[j][i % j]) %= mod;
        }
        if (x && d) {
            if (d >= B) {
                for (int j = 1; j <= x; ++j) {
                    if (i + d * j > n) break;
                    (dp[i + d * j] += dp[i]) %= mod;
                }
            } else {
                (add[d][i % d] += dp[i]) %= mod;
                st.insert ({i + x * d, d, i % d, dp[i]});
            }
        }
        while ((int)st.size() && (*st.begin())[0] == i) {
            array<int,4> v = (*st.begin());
            add[v[1]][v[2]] -= v[3];
            while (add[v[1]][v[2]] < 0) add[v[1]][v[2]] += mod;
            st.erase (st.begin());
        }
        (s += dp[i]) %= mod;
    }
    cout << s << '\n';
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Incorrect 1 ms 1116 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Incorrect 1 ms 1116 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 11 ms 1628 KB Output is correct
3 Correct 8 ms 1628 KB Output is correct
4 Correct 15 ms 1976 KB Output is correct
5 Incorrect 118 ms 1872 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 5272 KB Output is correct
2 Correct 70 ms 4688 KB Output is correct
3 Correct 173 ms 9940 KB Output is correct
4 Correct 128 ms 7292 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 17 ms 2132 KB Output is correct
8 Correct 179 ms 9812 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 1 ms 1116 KB Output is correct
4 Correct 1 ms 1116 KB Output is correct
5 Correct 1 ms 1116 KB Output is correct
6 Incorrect 1 ms 1116 KB Output isn't correct
7 Halted 0 ms 0 KB -