Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

4016
30724
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~1 範例測資。 0 / 0
2 2~12 n100 10 / 10
3 13~22 自行車數量超過 k 的租借站數量恰有一個 11 / 11
4 23~32 所有租借站位於一條直線上,如範例 2 17 / 17
5 33~42 無額外限制。 62 / 62

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 0019.8 29648 15204 Accepted 100
1 1 0019.5 29648 15260 Accepted 100
2 2 0020.8 29648 15140 Accepted 100
3 2 0020.1 29648 15256 Accepted 100
4 2 0020.1 29648 15248 Accepted 100
5 2 0020.2 29648 15232 Accepted 100
6 2 0019.0 29648 15260 Accepted 100
7 2 0019.9 29648 15272 Accepted 100
8 2 0020.2 29648 15048 Accepted 100
9 2 0019.3 29648 15248 Accepted 100
10 2 0020.0 29648 15264 Accepted 100
11 2 0020.2 29648 15140 Accepted 100
12 2 0018.8 29648 15248 Accepted 100
13 3 0136.2 42400 30428 Accepted 100
14 3 0136.7 41856 29864 Accepted 100
15 3 0129.8 42488 30592 Accepted 100
16 3 0138.3 41876 29944 Accepted 100
17 3 0082.7 34736 21888 Accepted 100
18 3 0085.3 34736 21760 Accepted 100
19 3 0086.6 34736 21792 Accepted 100
20 3 0108.6 34796 22708 Accepted 100
21 3 0105.7 34532 22368 Accepted 100
22 3 0110.9 34796 22664 Accepted 100
23 4 0191.8 42184 30240 Accepted 100
24 4 0128.0 42132 30132 Accepted 100
25 4 0142.0 42484 30552 Accepted 100
26 4 0154.3 42172 30356 Accepted 100
27 4 0138.8 42488 30588 Accepted 100
28 4 0149.6 42164 30056 Accepted 100
29 4 0139.1 42380 30392 Accepted 100
30 4 0142.5 42480 30652 Accepted 100
31 4 0146.5 42372 30320 Accepted 100
32 4 0146.2 42484 30724 Accepted 100
33 5 0151.5 42484 30636 Accepted 100
34 5 0090.1 34736 21876 Accepted 100
35 5 0121.6 34796 22716 Accepted 100
36 5 0114.2 34796 22672 Accepted 100
37 5 0114.9 34796 22728 Accepted 100
38 5 0110.5 34796 22716 Accepted 100
39 5 0115.3 34796 22676 Accepted 100
40 5 0112.5 34796 22732 Accepted 100
41 5 0120.3 34796 22684 Accepted 100
42 5 0108.0 34796 22712 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
725 Bytes
Back to Top