Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

3999
14084
Wrong Answer
10

Subtask Results

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

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 0002.6 6920 3740 Accepted 100
1 1 0002.4 6920 3676 Accepted 100
2 2 0002.5 6920 3564 Accepted 100
3 2 0002.6 6920 3520 Accepted 100
4 2 0002.5 6920 3624 Accepted 100
5 2 0002.4 6920 3672 Accepted 100
6 2 0002.6 6920 3680 Accepted 100
7 2 0002.5 6920 3580 Accepted 100
8 2 0002.5 6920 3688 Accepted 100
9 2 0002.5 6920 3616 Accepted 100
10 2 0002.5 6920 3688 Accepted 100
11 2 0002.5 6920 3564 Accepted 100
12 2 0002.4 6920 3668 Accepted 100
13 3 0136.7 16916 13804 Wrong Answer 0
14 3 0133.4 16532 13544 Wrong Answer 0
15 3 0142.3 16996 14064 Wrong Answer 0
16 3 0130.8 16552 13576 Wrong Answer 0
17 3 0117.0 13496 10028 Accepted 100
18 3 0116.5 13344 10032 Accepted 100
19 3 0118.6 13340 9888 Accepted 100
20 3 0129.2 12960 9940 Accepted 100
21 3 0122.1 12732 9540 Accepted 100
22 3 0130.8 12960 9944 Accepted 100
23 4 0132.4 16716 13720 Wrong Answer 0
24 4 0138.1 16668 13444 Wrong Answer 0
25 4 0140.0 16996 14020 Wrong Answer 0
26 4 0139.2 16708 13800 Wrong Answer 0
27 4 0143.9 16996 14084 Wrong Answer 0
28 4 0139.4 16692 13792 Wrong Answer 0
29 4 0135.1 16776 13704 Wrong Answer 0
30 4 0143.4 16992 13684 Wrong Answer 0
31 4 0142.5 16768 13780 Wrong Answer 0
32 4 0145.3 16992 14024 Wrong Answer 0
33 5 0146.7 16992 13680 Wrong Answer 0
34 5 0119.4 13496 9968 Accepted 100
35 5 0126.7 12960 9836 Accepted 100
36 5 0128.0 12960 9896 Accepted 100
37 5 0127.0 12960 9844 Accepted 100
38 5 0128.5 12960 9948 Accepted 100
39 5 0129.4 12960 9940 Accepted 100
40 5 0127.1 12960 9952 Accepted 100
41 5 0127.5 12960 9800 Accepted 100
42 5 0129.3 12960 9900 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
693 Bytes
Back to Top