Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

4283
18220
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 5856 Accepted 100
1 1 0005.0 9176 5760 Accepted 100
2 2 0005.2 9176 5844 Accepted 100
3 2 0005.2 9176 5964 Accepted 100
4 2 0005.2 9176 5988 Accepted 100
5 2 0005.2 9176 5856 Accepted 100
6 2 0005.3 9176 5908 Accepted 100
7 2 0005.3 9176 5736 Accepted 100
8 2 0005.4 9176 5772 Accepted 100
9 2 0005.2 9176 5968 Accepted 100
10 2 0005.2 9176 5844 Accepted 100
11 2 0005.2 9176 5968 Accepted 100
12 2 0005.1 9176 5916 Accepted 100
13 3 0143.4 20512 18108 Accepted 100
14 3 0142.9 20024 17684 Accepted 100
15 3 0147.2 20580 18184 Accepted 100
16 3 0142.0 20040 17444 Accepted 100
17 3 0119.2 14420 11016 Accepted 100
18 3 0121.0 14288 11240 Accepted 100
19 3 0118.5 14288 10872 Accepted 100
20 3 0201.3 14324 11864 Accepted 100
21 3 0125.1 14060 11428 Accepted 100
22 3 0129.7 14324 11672 Accepted 100
23 4 0147.7 20316 17888 Accepted 100
24 4 0144.4 20280 17860 Accepted 100
25 4 0151.3 20576 18048 Accepted 100
26 4 0141.5 20312 17776 Accepted 100
27 4 0149.6 20588 17992 Accepted 100
28 4 0144.9 20300 17908 Accepted 100
29 4 0145.9 20368 17908 Accepted 100
30 4 0151.8 20580 18188 Accepted 100
31 4 0150.6 20360 18092 Accepted 100
32 4 0147.8 20584 18180 Accepted 100
33 5 0148.9 20584 18220 Accepted 100
34 5 0129.9 14420 11156 Accepted 100
35 5 0130.3 14324 11948 Accepted 100
36 5 0132.7 14324 11884 Accepted 100
37 5 0132.4 14324 11820 Accepted 100
38 5 0133.8 14324 11752 Accepted 100
39 5 0133.7 14324 11852 Accepted 100
40 5 0135.0 14324 11732 Accepted 100
41 5 0134.1 14324 11668 Accepted 100
42 5 0138.7 14324 11808 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
704 Bytes
Back to Top