Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

4127
15492
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 9176 5928 Accepted 100
1 1 0005.1 9176 5976 Accepted 100
2 2 0005.3 9176 5936 Accepted 100
3 2 0005.3 9176 5956 Accepted 100
4 2 0005.3 9176 5964 Accepted 100
5 2 0005.2 9176 5960 Accepted 100
6 2 0005.1 9176 5908 Accepted 100
7 2 0005.3 9176 5904 Accepted 100
8 2 0005.6 9176 5852 Accepted 100
9 2 0005.4 9176 5964 Accepted 100
10 2 0005.3 9176 5768 Accepted 100
11 2 0005.3 9176 5980 Accepted 100
12 2 0005.1 9176 5972 Accepted 100
13 3 0139.0 17768 15368 Accepted 100
14 3 0143.6 17376 14748 Accepted 100
15 3 0146.9 17804 15424 Accepted 100
16 3 0139.4 17388 14948 Accepted 100
17 3 0119.2 14420 11168 Accepted 100
18 3 0120.7 14288 10864 Accepted 100
19 3 0118.2 14288 10916 Accepted 100
20 3 0130.6 14324 11812 Accepted 100
21 3 0122.7 14060 11708 Accepted 100
22 3 0131.8 14324 11740 Accepted 100
23 4 0138.0 17600 15132 Accepted 100
24 4 0139.9 17580 15120 Accepted 100
25 4 0144.5 17804 15492 Accepted 100
26 4 0140.7 17596 15200 Accepted 100
27 4 0142.5 17804 15292 Accepted 100
28 4 0143.5 17588 15204 Accepted 100
29 4 0138.5 17628 15212 Accepted 100
30 4 0147.7 17800 15404 Accepted 100
31 4 0151.4 17624 15316 Accepted 100
32 4 0142.4 17808 15492 Accepted 100
33 5 0147.2 17800 15488 Accepted 100
34 5 0119.6 14420 11080 Accepted 100
35 5 0129.0 14324 11820 Accepted 100
36 5 0131.0 14324 11852 Accepted 100
37 5 0131.4 14324 11752 Accepted 100
38 5 0132.1 14324 11856 Accepted 100
39 5 0128.6 14324 11860 Accepted 100
40 5 0130.7 14324 11800 Accepted 100
41 5 0136.0 14324 11860 Accepted 100
42 5 0131.9 14324 11812 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
828 Bytes
Back to Top