oj.uz

답안 #1084762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084762 2024-09-06T23:23:50 Z zxcigan Trains (BOI24_trains) C++17
100 / 100
 207 ms 11088 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));
    multiset<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];
            if (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
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 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 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 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 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 15 ms 1628 KB Output is correct
21 Correct 5 ms 1372 KB Output is correct
22 Correct 17 ms 1628 KB Output is correct
23 Correct 12 ms 1624 KB Output is correct
24 Correct 7 ms 1468 KB Output is correct
25 Correct 19 ms 2088 KB Output is correct
26 Correct 10 ms 1628 KB Output is correct
27 Correct 16 ms 2004 KB Output is correct
28 Correct 21 ms 2140 KB Output is correct
29 Correct 18 ms 2124 KB Output is correct
30 Correct 16 ms 1372 KB Output is correct
31 Correct 18 ms 1760 KB Output is correct
32 Correct 20 ms 2140 KB Output is correct
33 Correct 18 ms 1676 KB Output is correct
34 Correct 16 ms 1372 KB Output is correct
35 Correct 15 ms 1368 KB Output is correct
36 Correct 20 ms 2140 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1112 KB Output is correct
2 Correct 12 ms 1740 KB Output is correct
3 Correct 9 ms 1584 KB Output is correct
4 Correct 16 ms 1884 KB Output is correct
5 Correct 117 ms 1872 KB Output is correct
6 Correct 170 ms 9808 KB Output is correct
7 Correct 181 ms 8964 KB Output is correct
8 Correct 1 ms 1112 KB Output is correct
9 Correct 0 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 17 ms 2084 KB Output is correct
12 Correct 179 ms 9816 KB Output is correct
13 Correct 1 ms 1112 KB Output is correct
14 Correct 20 ms 2104 KB Output is correct
15 Correct 207 ms 9808 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 5460 KB Output is correct
2 Correct 74 ms 4564 KB Output is correct
3 Correct 180 ms 10240 KB Output is correct
4 Correct 131 ms 8272 KB Output is correct
5 Correct 1 ms 1112 KB Output is correct
6 Correct 1 ms 1116 KB Output is correct
7 Correct 19 ms 2100 KB Output is correct
8 Correct 176 ms 10616 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 0 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 1112 KB Output is correct
6 Correct 0 ms 1116 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 1 ms 1116 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Correct 1 ms 1372 KB Output is correct
11 Correct 1 ms 1116 KB Output is correct
12 Correct 1 ms 1112 KB Output is correct
13 Correct 2 ms 1112 KB Output is correct
14 Correct 1 ms 1116 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 1 ms 1116 KB Output is correct
17 Correct 1 ms 1116 KB Output is correct
18 Correct 1 ms 1116 KB Output is correct
19 Correct 1 ms 1116 KB Output is correct
20 Correct 15 ms 1628 KB Output is correct
21 Correct 5 ms 1372 KB Output is correct
22 Correct 17 ms 1628 KB Output is correct
23 Correct 12 ms 1624 KB Output is correct
24 Correct 7 ms 1468 KB Output is correct
25 Correct 19 ms 2088 KB Output is correct
26 Correct 10 ms 1628 KB Output is correct
27 Correct 16 ms 2004 KB Output is correct
28 Correct 21 ms 2140 KB Output is correct
29 Correct 18 ms 2124 KB Output is correct
30 Correct 16 ms 1372 KB Output is correct
31 Correct 18 ms 1760 KB Output is correct
32 Correct 20 ms 2140 KB Output is correct
33 Correct 18 ms 1676 KB Output is correct
34 Correct 16 ms 1372 KB Output is correct
35 Correct 15 ms 1368 KB Output is correct
36 Correct 20 ms 2140 KB Output is correct
37 Correct 1 ms 1112 KB Output is correct
38 Correct 12 ms 1740 KB Output is correct
39 Correct 9 ms 1584 KB Output is correct
40 Correct 16 ms 1884 KB Output is correct
41 Correct 117 ms 1872 KB Output is correct
42 Correct 170 ms 9808 KB Output is correct
43 Correct 181 ms 8964 KB Output is correct
44 Correct 1 ms 1112 KB Output is correct
45 Correct 0 ms 1116 KB Output is correct
46 Correct 1 ms 1116 KB Output is correct
47 Correct 17 ms 2084 KB Output is correct
48 Correct 179 ms 9816 KB Output is correct
49 Correct 1 ms 1112 KB Output is correct
50 Correct 20 ms 2104 KB Output is correct
51 Correct 207 ms 9808 KB Output is correct
52 Correct 87 ms 5460 KB Output is correct
53 Correct 74 ms 4564 KB Output is correct
54 Correct 180 ms 10240 KB Output is correct
55 Correct 131 ms 8272 KB Output is correct
56 Correct 1 ms 1112 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 19 ms 2100 KB Output is correct
59 Correct 176 ms 10616 KB Output is correct
60 Correct 180 ms 9300 KB Output is correct
61 Correct 192 ms 10832 KB Output is correct
62 Correct 172 ms 2956 KB Output is correct
63 Correct 196 ms 10832 KB Output is correct
64 Correct 152 ms 3920 KB Output is correct
65 Correct 176 ms 5972 KB Output is correct
66 Correct 178 ms 11088 KB Output is correct
67 Correct 153 ms 3668 KB Output is correct
68 Correct 177 ms 6992 KB Output is correct
69 Correct 185 ms 4568 KB Output is correct
70 Correct 153 ms 3160 KB Output is correct
71 Correct 150 ms 2896 KB Output is correct
72 Correct 204 ms 10576 KB Output is correct