Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

108
3636
Wrong Answer
0

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~1 範例測資。 0 / 0
2 2~12 $n \le 100$ 0 / 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 6204 3456 Wrong Answer 0
1 1 0002.4 6204 3548 Accepted 100
2 2 0002.7 6204 3628 Wrong Answer 0
3 2 0002.5 6204 3632 Wrong Answer 0
4 2 0002.6 6204 3592 Wrong Answer 0
5 2 0002.5 6204 3460 Wrong Answer 0
6 2 0002.5 6204 3564 Wrong Answer 0
7 2 0002.4 6204 3568 Wrong Answer 0
8 2 0002.5 6204 3632 Wrong Answer 0
9 2 0002.5 6204 3636 Wrong Answer 0
10 2 0002.4 6204 3464 Wrong Answer 0
11 2 0002.4 6204 3636 Wrong Answer 0
12 2 0002.4 6204 3456 Accepted 100
13 3 0002.6 6204 3636 Wrong Answer 0
14 3 0002.4 6204 3464 Wrong Answer 0
15 3 0002.7 6204 3588 Wrong Answer 0
16 3 0002.5 6204 3560 Wrong Answer 0
17 3 0002.6 6204 3552 Wrong Answer 0
18 3 0002.6 6204 3524 Wrong Answer 0
19 3 0002.6 6204 3560 Wrong Answer 0
20 3 0002.6 6204 3564 Wrong Answer 0
21 3 0002.4 6204 3460 Wrong Answer 0
22 3 0002.5 6204 3588 Wrong Answer 0
23 4 0002.4 6204 3632 Wrong Answer 0
24 4 0002.6 6204 3588 Wrong Answer 0
25 4 0002.5 6204 3636 Wrong Answer 0
26 4 0002.5 6204 3632 Wrong Answer 0
27 4 0002.4 6204 3628 Wrong Answer 0
28 4 0002.6 6204 3416 Wrong Answer 0
29 4 0002.5 6204 3632 Wrong Answer 0
30 4 0002.4 6204 3456 Wrong Answer 0
31 4 0002.4 6204 3632 Wrong Answer 0
32 4 0002.5 6204 3556 Wrong Answer 0
33 5 0002.5 6204 3584 Wrong Answer 0
34 5 0002.5 6204 3568 Wrong Answer 0
35 5 0002.6 6204 3636 Wrong Answer 0
36 5 0002.6 6204 3636 Wrong Answer 0
37 5 0002.4 6204 3552 Wrong Answer 0
38 5 0002.4 6204 3568 Wrong Answer 0
39 5 0002.5 6204 3524 Wrong Answer 0
40 5 0002.5 6204 3636 Wrong Answer 0
41 5 0002.6 6204 3524 Wrong Answer 0
42 5 0002.4 6204 3524 Wrong Answer 0
Submitter:
Compiler:
c++14
Code Length:
801 Bytes
Back to Top