Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

4246
19764
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.1 9176 5988 Accepted 100
1 1 0005.2 9176 5852 Accepted 100
2 2 0005.4 9176 5988 Accepted 100
3 2 0005.3 9176 6004 Accepted 100
4 2 0005.3 9176 5984 Accepted 100
5 2 0005.2 9176 5916 Accepted 100
6 2 0005.2 9176 6052 Accepted 100
7 2 0005.3 9176 5960 Accepted 100
8 2 0005.3 9176 5964 Accepted 100
9 2 0005.3 9176 5856 Accepted 100
10 2 0005.2 9176 5968 Accepted 100
11 2 0005.3 9176 5924 Accepted 100
12 2 0005.2 9176 6040 Accepted 100
13 3 0149.1 22060 19660 Accepted 100
14 3 0142.3 21508 19028 Accepted 100
15 3 0154.2 22144 19764 Accepted 100
16 3 0144.5 21532 19084 Accepted 100
17 3 0118.0 14420 11080 Accepted 100
18 3 0120.3 14288 10888 Accepted 100
19 3 0121.0 14288 10784 Accepted 100
20 3 0130.6 14324 11816 Accepted 100
21 3 0124.4 14060 11576 Accepted 100
22 3 0137.6 14324 11824 Accepted 100
23 4 0146.6 21844 19236 Accepted 100
24 4 0149.3 21792 19428 Accepted 100
25 4 0155.4 22140 19684 Accepted 100
26 4 0150.1 21840 19424 Accepted 100
27 4 0153.9 22148 19712 Accepted 100
28 4 0146.5 21824 19372 Accepted 100
29 4 0149.6 21912 19652 Accepted 100
30 4 0153.6 22144 19712 Accepted 100
31 4 0150.1 21904 19568 Accepted 100
32 4 0149.0 22148 19764 Accepted 100
33 5 0158.3 22140 19736 Accepted 100
34 5 0119.4 14420 11152 Accepted 100
35 5 0131.6 14324 11756 Accepted 100
36 5 0127.5 14324 11944 Accepted 100
37 5 0131.7 14324 11880 Accepted 100
38 5 0130.5 14324 11880 Accepted 100
39 5 0132.7 14324 11880 Accepted 100
40 5 0131.4 14324 11800 Accepted 100
41 5 0129.7 14324 11900 Accepted 100
42 5 0138.4 14324 11948 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
752 Bytes
Back to Top