Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2447
15796
Wrong Answer
10

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$ 的租借站數量恰有一個 0 / 11
4 23~32 所有租借站位於一條直線上,如範例 2 0 / 17
5 33~42 無額外限制。 0 / 62

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 0005.4 8944 5908 Accepted 100
1 1 0005.8 8944 5924 Accepted 100
2 2 0005.9 8944 5976 Accepted 100
3 2 0006.1 8944 5876 Accepted 100
4 2 0005.5 8944 5924 Accepted 100
5 2 0005.7 8944 5916 Accepted 100
6 2 0005.9 8944 5844 Accepted 100
7 2 0006.9 8944 5920 Accepted 100
8 2 0005.8 8944 5984 Accepted 100
9 2 0005.5 8944 5740 Accepted 100
10 2 0005.9 8944 5924 Accepted 100
11 2 0005.6 8944 5976 Accepted 100
12 2 0005.5 8944 5968 Accepted 100
13 3 0085.1 18036 15568 Wrong Answer 0
14 3 0083.0 17684 15244 Wrong Answer 0
15 3 0090.2 18104 15692 Wrong Answer 0
16 3 0087.1 17696 15244 Wrong Answer 0
17 3 0057.9 13024 9860 Accepted 100
18 3 0065.0 13024 9720 Accepted 100
19 3 0056.3 13024 9644 Accepted 100
20 3 0072.3 12640 10056 Accepted 100
21 3 0069.0 12508 9928 Accepted 100
22 3 0073.1 12640 10108 Accepted 100
23 4 0091.7 17976 15528 Wrong Answer 0
24 4 0085.1 17928 15464 Wrong Answer 0
25 4 0087.1 18104 15796 Wrong Answer 0
26 4 0092.8 17964 15444 Wrong Answer 0
27 4 0082.0 18104 15692 Wrong Answer 0
28 4 0084.4 17952 15460 Wrong Answer 0
29 4 0083.8 18024 15508 Wrong Answer 0
30 4 0087.8 18108 15676 Wrong Answer 0
31 4 0084.5 18016 15540 Wrong Answer 0
32 4 0088.9 18108 15696 Wrong Answer 0
33 5 0099.1 18104 15660 Wrong Answer 0
34 5 0061.7 13024 9900 Accepted 100
35 5 0077.3 12640 10100 Accepted 100
36 5 0080.1 12640 10092 Accepted 100
37 5 0071.6 12640 10096 Accepted 100
38 5 0072.3 12640 10036 Accepted 100
39 5 0075.5 12640 9992 Accepted 100
40 5 0070.0 12640 9868 Accepted 100
41 5 0076.8 12640 10028 Accepted 100
42 5 0079.8 12640 10096 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
663 Bytes
Back to Top