Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2432
19752
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.2 9332 5920 Accepted 100
1 1 0005.2 9332 5872 Accepted 100
2 2 0005.3 9332 5892 Accepted 100
3 2 0005.3 9332 5928 Accepted 100
4 2 0005.3 9332 5940 Accepted 100
5 2 0005.2 9332 5932 Accepted 100
6 2 0005.1 9332 5876 Accepted 100
7 2 0005.3 9332 5928 Accepted 100
8 2 0005.2 9332 5928 Accepted 100
9 2 0005.2 9332 5868 Accepted 100
10 2 0005.2 9332 5876 Accepted 100
11 2 0005.2 9332 5932 Accepted 100
12 2 0005.2 9332 5916 Accepted 100
13 3 0091.6 22080 19512 Accepted 100
14 3 0090.3 21536 19044 Accepted 100
15 3 0094.3 22164 19744 Accepted 100
16 3 0085.9 21556 18972 Accepted 100
17 3 0054.8 14420 11136 Accepted 100
18 3 0056.0 14420 10720 Accepted 100
19 3 0055.5 14420 10864 Accepted 100
20 3 0070.5 14480 11768 Accepted 100
21 3 0070.4 14216 11540 Accepted 100
22 3 0077.4 14480 11776 Accepted 100
23 4 0089.7 21868 19436 Accepted 100
24 4 0086.0 21816 19380 Accepted 100
25 4 0091.4 22168 19684 Accepted 100
26 4 0091.9 21856 19428 Accepted 100
27 4 0086.5 22168 19752 Accepted 100
28 4 0090.5 21844 19352 Accepted 100
29 4 0091.0 22072 19480 Accepted 100
30 4 0091.1 22172 19752 Accepted 100
31 4 0091.6 22060 19520 Accepted 100
32 4 0089.2 22164 19612 Accepted 100
33 5 0090.4 22164 19540 Accepted 100
34 5 0056.9 14420 10972 Accepted 100
35 5 0068.3 14480 11828 Accepted 100
36 5 0071.1 14480 11784 Accepted 100
37 5 0071.6 14480 11760 Accepted 100
38 5 0073.6 14480 11824 Accepted 100
39 5 0071.3 14480 11788 Accepted 100
40 5 0072.6 14480 11780 Accepted 100
41 5 0072.2 14480 11628 Accepted 100
42 5 0071.1 14480 11836 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
1021 Bytes
Back to Top