Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

1993
13060
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.4 6200 3620 Accepted 100
1 1 0002.6 6200 3576 Accepted 100
2 2 0002.6 6200 3560 Accepted 100
3 2 0002.8 6200 3560 Accepted 100
4 2 0002.5 6200 3636 Accepted 100
5 2 0002.4 6200 3484 Accepted 100
6 2 0002.5 6200 3572 Accepted 100
7 2 0002.6 6200 3492 Accepted 100
8 2 0002.4 6200 3492 Accepted 100
9 2 0002.4 6200 3556 Accepted 100
10 2 0002.5 6200 3628 Accepted 100
11 2 0002.4 6200 3492 Accepted 100
12 2 0002.5 6200 3624 Accepted 100
13 3 0068.3 15596 12696 Wrong Answer 0
14 3 0067.5 15232 12488 Wrong Answer 0
15 3 0073.6 15664 12936 Wrong Answer 0
16 3 0069.4 15244 12492 Wrong Answer 0
17 3 0051.4 13016 9912 Accepted 100
18 3 0052.5 12992 9672 Accepted 100
19 3 0050.9 12988 9664 Accepted 100
20 3 0063.4 12632 9532 Accepted 100
21 3 0058.6 12388 9308 Accepted 100
22 3 0064.8 12632 9524 Accepted 100
23 4 0068.1 15532 12760 Wrong Answer 0
24 4 0069.3 15484 12704 Wrong Answer 0
25 4 0074.0 15664 12964 Wrong Answer 0
26 4 0075.0 15520 12752 Wrong Answer 0
27 4 0073.8 15664 12956 Wrong Answer 0
28 4 0069.9 15508 12704 Wrong Answer 0
29 4 0069.1 15588 12752 Wrong Answer 0
30 4 0070.6 15668 13012 Wrong Answer 0
31 4 0069.1 15580 12664 Wrong Answer 0
32 4 0068.2 15668 12972 Wrong Answer 0
33 5 0073.1 15668 13060 Wrong Answer 0
34 5 0051.0 13016 10020 Accepted 100
35 5 0062.8 12632 9600 Accepted 100
36 5 0064.3 12632 9504 Accepted 100
37 5 0064.3 12632 9628 Accepted 100
38 5 0066.1 12632 9456 Accepted 100
39 5 0066.1 12632 9572 Accepted 100
40 5 0062.5 12632 9576 Accepted 100
41 5 0061.9 12632 9432 Accepted 100
42 5 0061.1 12632 9504 Accepted 100
Submitter:
Compiler:
c++20
Code Length:
967 Bytes
Back to Top