Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

4211
16392
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 9272 5400 Accepted 100
1 1 0005.3 9272 5468 Accepted 100
2 2 0005.5 9272 5436 Accepted 100
3 2 0005.2 9272 5480 Accepted 100
4 2 0005.4 9272 5380 Accepted 100
5 2 0005.3 9272 5436 Accepted 100
6 2 0005.3 9272 5356 Accepted 100
7 2 0005.2 9272 5352 Accepted 100
8 2 0005.1 9272 5380 Accepted 100
9 2 0005.3 9272 5300 Accepted 100
10 2 0005.3 9272 5312 Accepted 100
11 2 0005.2 9272 5416 Accepted 100
12 2 0005.1 9272 5388 Accepted 100
13 3 0147.4 19064 16268 Accepted 100
14 3 0147.3 18632 15856 Accepted 100
15 3 0146.2 19112 16348 Accepted 100
16 3 0137.2 18640 15872 Accepted 100
17 3 0120.3 14516 11072 Accepted 100
18 3 0120.3 14384 11068 Accepted 100
19 3 0118.2 14384 11060 Accepted 100
20 3 0135.3 14420 11664 Accepted 100
21 3 0127.3 14156 11416 Accepted 100
22 3 0139.5 14420 11672 Accepted 100
23 4 0144.7 18884 16136 Accepted 100
24 4 0143.2 18856 16120 Accepted 100
25 4 0148.2 19116 16348 Accepted 100
26 4 0145.3 18880 16012 Accepted 100
27 4 0148.5 19116 16392 Accepted 100
28 4 0146.7 18872 16052 Accepted 100
29 4 0143.8 18924 16012 Accepted 100
30 4 0149.6 19112 16320 Accepted 100
31 4 0147.4 18920 16060 Accepted 100
32 4 0151.1 19116 16348 Accepted 100
33 5 0144.7 19116 16312 Accepted 100
34 5 0119.9 14516 11056 Accepted 100
35 5 0133.0 14420 11596 Accepted 100
36 5 0132.1 14420 11640 Accepted 100
37 5 0131.0 14420 11688 Accepted 100
38 5 0132.3 14420 11688 Accepted 100
39 5 0132.5 14420 11684 Accepted 100
40 5 0133.7 14420 11564 Accepted 100
41 5 0136.5 14420 11636 Accepted 100
42 5 0139.0 14420 11680 Accepted 100
Submitter:
Compiler:
c++14
Code Length:
720 Bytes
Back to Top