Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

3031
19720
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.9 10116 5844 Accepted 100
1 1 0008.4 10116 5852 Accepted 100
2 2 0006.8 10116 5808 Accepted 100
3 2 0007.8 10116 5752 Accepted 100
4 2 0006.4 10116 5860 Accepted 100
5 2 0006.4 10116 5860 Accepted 100
6 2 0006.4 10116 5848 Accepted 100
7 2 0006.3 10116 5812 Accepted 100
8 2 0006.0 10116 5852 Accepted 100
9 2 0006.2 10116 5944 Accepted 100
10 2 0008.6 10116 5888 Accepted 100
11 2 0006.3 10116 5892 Accepted 100
12 2 0008.0 10116 5820 Accepted 100
13 3 0127.4 22864 19292 Accepted 100
14 3 0156.1 22316 18904 Accepted 100
15 3 0130.5 22952 19712 Accepted 100
16 3 0109.7 22344 19080 Accepted 100
17 3 0063.1 15204 11080 Accepted 100
18 3 0065.5 15204 10712 Accepted 100
19 3 0062.2 15204 10852 Accepted 100
20 3 0087.1 15264 11744 Accepted 100
21 3 0089.8 15000 11580 Accepted 100
22 3 0093.0 15264 11796 Accepted 100
23 4 0106.0 22652 19172 Accepted 100
24 4 0105.9 22600 19260 Accepted 100
25 4 0111.0 22952 19628 Accepted 100
26 4 0103.3 22648 19360 Accepted 100
27 4 0106.6 22952 19612 Accepted 100
28 4 0103.2 22632 19436 Accepted 100
29 4 0103.9 22848 19408 Accepted 100
30 4 0104.1 22956 19720 Accepted 100
31 4 0106.3 22844 19440 Accepted 100
32 4 0106.4 22952 19484 Accepted 100
33 5 0112.0 22948 19624 Accepted 100
34 5 0062.9 15204 10896 Accepted 100
35 5 0085.9 15264 11688 Accepted 100
36 5 0085.7 15264 11700 Accepted 100
37 5 0087.2 15264 11792 Accepted 100
38 5 0094.2 15264 11788 Accepted 100
39 5 0096.1 15264 11644 Accepted 100
40 5 0098.4 15264 11752 Accepted 100
41 5 0087.5 15264 11656 Accepted 100
42 5 0090.9 15264 11812 Accepted 100
Submitter:
TLE
Compiler:
c++20
Code Length:
706 Bytes
Back to Top