Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2180
16020
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 0005.3 8784 6212 Accepted 100
1 1 0005.3 8784 6212 Accepted 100
2 2 0005.4 8784 6168 Accepted 100
3 2 0005.3 8784 5984 Accepted 100
4 2 0005.3 8784 6216 Accepted 100
5 2 0005.3 8784 6024 Accepted 100
6 2 0005.2 8784 6004 Accepted 100
7 2 0005.3 8784 6048 Accepted 100
8 2 0005.3 8784 6136 Accepted 100
9 2 0005.2 8784 6088 Accepted 100
10 2 0005.3 8784 6140 Accepted 100
11 2 0005.4 8784 5980 Accepted 100
12 2 0005.3 8784 6132 Accepted 100
13 3 0076.4 18012 15712 Accepted 100
14 3 0071.9 17652 15388 Accepted 100
15 3 0073.9 18076 15796 Accepted 100
16 3 0069.6 17668 15540 Accepted 100
17 3 0052.8 13016 10036 Accepted 100
18 3 0054.7 12884 10100 Accepted 100
19 3 0056.8 12884 9728 Accepted 100
20 3 0068.4 12480 10132 Accepted 100
21 3 0065.6 12348 10212 Accepted 100
22 3 0066.2 12480 10272 Accepted 100
23 4 0079.4 17812 15720 Accepted 100
24 4 0078.3 17772 15520 Accepted 100
25 4 0080.9 18076 15968 Accepted 100
26 4 0081.9 17800 15796 Accepted 100
27 4 0077.9 18080 15924 Accepted 100
28 4 0074.6 17792 15784 Accepted 100
29 4 0076.0 17868 15900 Accepted 100
30 4 0079.4 18076 15944 Accepted 100
31 4 0078.0 17856 15816 Accepted 100
32 4 0082.3 18076 15896 Accepted 100
33 5 0078.9 18080 16020 Accepted 100
34 5 0055.6 13016 9968 Accepted 100
35 5 0067.1 12480 10204 Accepted 100
36 5 0067.8 12480 10336 Accepted 100
37 5 0065.4 12480 10336 Accepted 100
38 5 0065.7 12480 10384 Accepted 100
39 5 0066.3 12480 10264 Accepted 100
40 5 0066.3 12480 10104 Accepted 100
41 5 0066.1 12480 10360 Accepted 100
42 5 0067.1 12480 10272 Accepted 100
Submitter:
n0
Compiler:
c++14
Code Length:
750 Bytes
Back to Top