답안 #1002016

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002016	2024-06-19T09:15:33 Z	LOLOLO	Trains (BOI24_trains)	C++17	100 / 100	138 ms	132180 KB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e5 + 10;
const int L = sqrt(N) + 10;
ll d[N], x[N];
int dp[N], mod = 1e9 + 7;
int f[N][L + 1];

ll solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> d[i] >> x[i];

    for (int i = n; i >= 1; i--) {
        if (d[i] <= L) {
            if (d[i] && x[i]) {
                ll st = i + d[i];
                ll en = i + (x[i] + 1) * d[i];
                if (en <= n) {
                    dp[i] = f[st][d[i]] - f[en][d[i]];  
                } else {
                    dp[i] = f[st][d[i]];
                }
            }
        } else {
            for (int j = 1; j <= x[i] && j * d[i] + i <= n; j++)
                dp[i] = (dp[i] + dp[j * d[i] + i]) % mod;
        }

        dp[i]++;

        while (dp[i] < 0)
            dp[i] += mod;

        for (int j = 1; j <= L; j++) {
            f[i][j] = dp[i];
            if (i + j <= n)
                f[i][j] = (dp[i] + f[i + j][j]) % mod;
        }
    }

    return dp[1];
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
 
    int t = 1;
    //cin >> t;
 
    while (t--) {
        cout << solve() << '\n';
    }
 
    return 0;
}

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct

Subtask #2
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	10 ms	11096 KB	Output is correct
21	Correct	5 ms	4184 KB	Output is correct
22	Correct	15 ms	13404 KB	Output is correct
23	Correct	8 ms	8860 KB	Output is correct
24	Correct	5 ms	5720 KB	Output is correct
25	Correct	13 ms	12172 KB	Output is correct
26	Correct	6 ms	6236 KB	Output is correct
27	Correct	11 ms	11612 KB	Output is correct
28	Correct	13 ms	13388 KB	Output is correct
29	Correct	12 ms	13376 KB	Output is correct
30	Correct	13 ms	13400 KB	Output is correct
31	Correct	12 ms	13404 KB	Output is correct
32	Correct	11 ms	13528 KB	Output is correct
33	Correct	11 ms	13404 KB	Output is correct
34	Correct	13 ms	13400 KB	Output is correct
35	Correct	11 ms	13400 KB	Output is correct
36	Correct	14 ms	13404 KB	Output is correct

Subtask #3
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	8 ms	8932 KB	Output is correct
3	Correct	5 ms	6236 KB	Output is correct
4	Correct	9 ms	11584 KB	Output is correct
5	Correct	74 ms	101092 KB	Output is correct
6	Correct	104 ms	131236 KB	Output is correct
7	Correct	106 ms	131152 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	11 ms	13596 KB	Output is correct
12	Correct	107 ms	131588 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	12 ms	13404 KB	Output is correct
15	Correct	117 ms	131500 KB	Output is correct

Subtask #4
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	63576 KB	Output is correct
2	Correct	46 ms	52816 KB	Output is correct
3	Correct	118 ms	131416 KB	Output is correct
4	Correct	82 ms	94296 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	12 ms	13552 KB	Output is correct
8	Correct	110 ms	131408 KB	Output is correct

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	464 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	604 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	10 ms	11096 KB	Output is correct
21	Correct	5 ms	4184 KB	Output is correct
22	Correct	15 ms	13404 KB	Output is correct
23	Correct	8 ms	8860 KB	Output is correct
24	Correct	5 ms	5720 KB	Output is correct
25	Correct	13 ms	12172 KB	Output is correct
26	Correct	6 ms	6236 KB	Output is correct
27	Correct	11 ms	11612 KB	Output is correct
28	Correct	13 ms	13388 KB	Output is correct
29	Correct	12 ms	13376 KB	Output is correct
30	Correct	13 ms	13400 KB	Output is correct
31	Correct	12 ms	13404 KB	Output is correct
32	Correct	11 ms	13528 KB	Output is correct
33	Correct	11 ms	13404 KB	Output is correct
34	Correct	13 ms	13400 KB	Output is correct
35	Correct	11 ms	13400 KB	Output is correct
36	Correct	14 ms	13404 KB	Output is correct
37	Correct	0 ms	344 KB	Output is correct
38	Correct	8 ms	8932 KB	Output is correct
39	Correct	5 ms	6236 KB	Output is correct
40	Correct	9 ms	11584 KB	Output is correct
41	Correct	74 ms	101092 KB	Output is correct
42	Correct	104 ms	131236 KB	Output is correct
43	Correct	106 ms	131152 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	11 ms	13596 KB	Output is correct
48	Correct	107 ms	131588 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	12 ms	13404 KB	Output is correct
51	Correct	117 ms	131500 KB	Output is correct
52	Correct	54 ms	63576 KB	Output is correct
53	Correct	46 ms	52816 KB	Output is correct
54	Correct	118 ms	131416 KB	Output is correct
55	Correct	82 ms	94296 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	12 ms	13552 KB	Output is correct
59	Correct	110 ms	131408 KB	Output is correct
60	Correct	86 ms	109648 KB	Output is correct
61	Correct	105 ms	131268 KB	Output is correct
62	Correct	116 ms	130900 KB	Output is correct
63	Correct	112 ms	131228 KB	Output is correct
64	Correct	114 ms	132180 KB	Output is correct
65	Correct	138 ms	131664 KB	Output is correct
66	Correct	117 ms	131356 KB	Output is correct
67	Correct	120 ms	131716 KB	Output is correct
68	Correct	113 ms	131412 KB	Output is correct
69	Correct	118 ms	130896 KB	Output is correct
70	Correct	116 ms	131528 KB	Output is correct
71	Correct	108 ms	131192 KB	Output is correct
72	Correct	106 ms	131156 KB	Output is correct

답안 #1002016

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 13.0 / 13.0

Subtask #3 16.0 / 16.0

Subtask #4 34.0 / 34.0

Subtask #5 29.0 / 29.0

Subtask #1
8.0 / 8.0

Subtask #2
13.0 / 13.0

Subtask #3
16.0 / 16.0

Subtask #4
34.0 / 34.0

Subtask #5
29.0 / 29.0