Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

8156
107056
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~2 範例測資 0 / 0
2 3~11 保證樹是一條路徑 21 / 21
3 12~22 $d_i = i + 1, 1\leq i\leq N - 1, d_N = 1$ 34 / 34
4 3~41 無特別限制 45 / 45

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 0005.5 87664 12904 Accepted 100
1 1 0007.0 87664 12900 Accepted 100
2 1 0006.3 87664 13044 Accepted 100
3 2 4 0006.2 87664 13056 Accepted 100
4 2 4 0006.3 87664 13124 Accepted 100
5 2 4 0006.4 87664 13084 Accepted 100
6 2 4 0008.4 87664 13372 Accepted 100
7 2 4 0030.8 88648 17760 Accepted 100
8 2 4 0515.2 99396 58636 Accepted 100
9 2 4 1129.2 114364 107056 Accepted 100
10 2 4 1225.7 109892 103340 Accepted 100
11 2 4 1179.0 111720 105072 Accepted 100
12 3 4 0006.6 87664 13060 Accepted 100
13 3 4 0006.2 87664 12964 Accepted 100
14 3 4 0006.3 87664 12912 Accepted 100
15 3 4 0006.0 87664 13140 Accepted 100
16 3 4 0006.2 87664 13056 Accepted 100
17 3 4 0006.2 87664 13224 Accepted 100
18 3 4 0006.4 87664 13012 Accepted 100
19 3 4 0009.8 87796 14032 Accepted 100
20 3 4 0041.7 89528 21616 Accepted 100
21 3 4 0238.2 96036 54692 Accepted 100
22 3 4 0379.0 105180 97728 Accepted 100
23 4 0006.1 87664 12912 Accepted 100
24 4 0006.5 87664 13136 Accepted 100
25 4 0006.1 87664 12904 Accepted 100
26 4 0006.8 87664 13372 Accepted 100
27 4 0008.0 87664 13324 Accepted 100
28 4 0021.0 88484 17480 Accepted 100
29 4 0026.9 88500 17268 Accepted 100
30 4 0244.7 96036 54884 Accepted 100
31 4 0410.8 104156 97460 Accepted 100
32 4 0618.8 103216 96544 Accepted 100
33 4 0544.9 104364 97068 Accepted 100
34 4 0006.8 87664 13004 Accepted 100
35 4 0006.3 87664 13060 Accepted 100
36 4 0007.4 87664 13400 Accepted 100
37 4 0014.5 88060 15400 Accepted 100
38 4 0106.2 92020 38000 Accepted 100
39 4 0421.4 99808 87156 Accepted 100
40 4 0499.1 99808 87204 Accepted 100
41 4 0355.1 100600 87892 Accepted 100
Submitter:
Compiler:
c++20
Code Length:
4.49 KB
Back to Top