Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2511
20588
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 10112 5976 Accepted 100
1 1 0005.2 10112 5916 Accepted 100
2 2 0005.1 10112 5928 Accepted 100
3 2 0005.3 10112 5996 Accepted 100
4 2 0005.0 10112 6052 Accepted 100
5 2 0005.3 10112 5916 Accepted 100
6 2 0005.1 10112 5988 Accepted 100
7 2 0005.2 10112 5960 Accepted 100
8 2 0005.1 10112 5820 Accepted 100
9 2 0005.3 10112 5932 Accepted 100
10 2 0005.2 10112 5928 Accepted 100
11 2 0005.2 10112 5916 Accepted 100
12 2 0005.0 10112 5748 Accepted 100
13 3 0087.7 22860 20344 Accepted 100
14 3 0088.7 22320 19956 Accepted 100
15 3 0096.3 22948 20416 Accepted 100
16 3 0098.6 22332 19972 Accepted 100
17 3 0058.5 15200 11988 Accepted 100
18 3 0059.9 15200 11552 Accepted 100
19 3 0057.0 15200 11608 Accepted 100
20 3 0074.1 15260 12584 Accepted 100
21 3 0064.7 14996 12356 Accepted 100
22 3 0086.1 15260 12668 Accepted 100
23 4 0091.3 22648 20264 Accepted 100
24 4 0089.2 22596 20192 Accepted 100
25 4 0095.3 22948 20588 Accepted 100
26 4 0089.5 22636 20312 Accepted 100
27 4 0092.0 22948 20580 Accepted 100
28 4 0091.4 22624 20200 Accepted 100
29 4 0095.4 22848 20364 Accepted 100
30 4 0091.2 22952 20528 Accepted 100
31 4 0085.9 22840 20336 Accepted 100
32 4 0086.6 22948 20508 Accepted 100
33 5 0099.1 22948 20512 Accepted 100
34 5 0059.3 15200 11856 Accepted 100
35 5 0080.8 15260 12428 Accepted 100
36 5 0076.1 15260 12572 Accepted 100
37 5 0070.5 15260 12604 Accepted 100
38 5 0068.6 15260 12660 Accepted 100
39 5 0078.5 15260 12428 Accepted 100
40 5 0081.6 15260 12664 Accepted 100
41 5 0075.7 15260 12668 Accepted 100
42 5 0074.0 15260 12664 Accepted 100
Submitter:
pcc
Compiler:
c++17
Code Length:
742 Bytes
Back to Top