Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2213
19328
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 3572 Accepted 100
1 1 0002.5 6208 3500 Accepted 100
2 2 0002.6 6208 3580 Accepted 100
3 2 0002.6 6208 3532 Accepted 100
4 2 0002.6 6208 3668 Accepted 100
5 2 0002.7 6208 3520 Accepted 100
6 2 0002.8 6208 3660 Accepted 100
7 2 0002.7 6208 3460 Accepted 100
8 2 0002.6 6208 3596 Accepted 100
9 2 0002.7 6208 3584 Accepted 100
10 2 0002.9 6208 3532 Accepted 100
11 2 0002.6 6208 3536 Accepted 100
12 2 0002.7 6208 3516 Accepted 100
13 3 0077.1 21876 19028 Accepted 100
14 3 0081.5 21280 18500 Accepted 100
15 3 0082.0 22012 19252 Accepted 100
16 3 0081.1 21316 18432 Accepted 100
17 3 0055.8 13792 10664 Accepted 100
18 3 0056.8 13736 10428 Accepted 100
19 3 0057.2 13720 10408 Accepted 100
20 3 0067.5 13304 10312 Accepted 100
21 3 0060.5 13028 10060 Accepted 100
22 3 0067.0 13300 10216 Accepted 100
23 4 0081.2 21736 18808 Accepted 100
24 4 0080.5 21652 18764 Accepted 100
25 4 0084.5 22016 19296 Accepted 100
26 4 0084.6 21724 18748 Accepted 100
27 4 0083.4 22008 19284 Accepted 100
28 4 0082.1 21704 18692 Accepted 100
29 4 0079.9 21852 18956 Accepted 100
30 4 0081.7 22012 19292 Accepted 100
31 4 0080.8 21840 18996 Accepted 100
32 4 0084.0 22016 19300 Accepted 100
33 5 0080.6 22012 19328 Accepted 100
34 5 0054.8 13784 10692 Accepted 100
35 5 0067.3 13300 10216 Accepted 100
36 5 0067.9 13304 10316 Accepted 100
37 5 0068.5 13304 10248 Accepted 100
38 5 0065.9 13300 10204 Accepted 100
39 5 0066.6 13300 10204 Accepted 100
40 5 0068.7 13296 10204 Accepted 100
41 5 0063.1 13300 10332 Accepted 100
42 5 0066.7 13300 10324 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
923 Bytes
Back to Top