Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2255
16432
Accepted
100

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$ 的租借站數量恰有一個 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 0002.6 6208 3564 Accepted 100
1 1 0002.6 6208 3524 Accepted 100
2 2 0002.6 6208 3564 Accepted 100
3 2 0002.7 6208 3440 Accepted 100
4 2 0002.6 6208 3540 Accepted 100
5 2 0002.7 6208 3668 Accepted 100
6 2 0002.7 6208 3456 Accepted 100
7 2 0002.6 6208 3520 Accepted 100
8 2 0002.6 6208 3544 Accepted 100
9 2 0002.6 6208 3540 Accepted 100
10 2 0002.6 6208 3608 Accepted 100
11 2 0002.6 6208 3528 Accepted 100
12 2 0002.6 6208 3520 Accepted 100
13 3 0076.0 19164 16312 Accepted 100
14 3 0074.8 18664 15776 Accepted 100
15 3 0080.3 19280 16432 Accepted 100
16 3 0077.8 18696 15820 Accepted 100
17 3 0054.9 14196 10964 Accepted 100
18 3 0055.4 14164 11104 Accepted 100
19 3 0054.4 14152 10668 Accepted 100
20 3 0066.7 13812 10884 Accepted 100
21 3 0062.3 13520 10612 Accepted 100
22 3 0073.9 13812 10772 Accepted 100
23 4 0084.4 19060 16056 Accepted 100
24 4 0078.0 18992 16044 Accepted 100
25 4 0082.4 19276 16320 Accepted 100
26 4 0083.9 19044 16064 Accepted 100
27 4 0082.2 19276 16296 Accepted 100
28 4 0085.6 19028 16040 Accepted 100
29 4 0084.6 19148 16296 Accepted 100
30 4 0083.8 19280 16428 Accepted 100
31 4 0084.1 19144 16400 Accepted 100
32 4 0085.7 19280 16280 Accepted 100
33 5 0085.3 19276 16312 Accepted 100
34 5 0055.9 14192 11116 Accepted 100
35 5 0071.1 13812 10884 Accepted 100
36 5 0069.4 13812 10784 Accepted 100
37 5 0067.9 13812 10884 Accepted 100
38 5 0068.5 13812 10788 Accepted 100
39 5 0068.7 13808 10768 Accepted 100
40 5 0070.7 13808 10768 Accepted 100
41 5 0074.9 13812 10784 Accepted 100
42 5 0077.0 13812 10816 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
892 Bytes
Back to Top