Results of submission #319113

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2248. C. 共享自行車
690
13060
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 0001.3 6608 1240 Accepted 100
1 1 0001.3 6608 1236 Accepted 100
2 2 0001.3 6608 1320 Accepted 100
3 2 0001.3 6608 1272 Accepted 100
4 2 0001.3 6608 1216 Accepted 100
5 2 0001.3 6608 1260 Accepted 100
6 2 0001.3 6608 1260 Accepted 100
7 2 0001.3 6608 1264 Accepted 100
8 2 0001.3 6608 1316 Accepted 100
9 2 0001.3 6608 1216 Accepted 100
10 2 0001.3 6608 1316 Accepted 100
11 2 0001.3 6608 1332 Accepted 100
12 2 0001.3 6608 1192 Accepted 100
13 3 0027.9 14208 12868 Accepted 100
14 3 0027.6 13928 12480 Accepted 100
15 3 0032.6 14300 13060 Accepted 100
16 3 0030.2 13948 12508 Accepted 100
17 3 0011.4 6608 4388 Accepted 100
18 3 0011.9 6608 4428 Accepted 100
19 3 0011.2 6608 4408 Accepted 100
20 3 0015.3 6608 5152 Accepted 100
21 3 0015.3 6608 5024 Accepted 100
22 3 0015.9 6608 5196 Accepted 100
23 4 0030.8 14128 12748 Accepted 100
24 4 0029.4 14080 12776 Accepted 100
25 4 0032.3 14296 12976 Accepted 100
26 4 0031.0 14120 12724 Accepted 100
27 4 0031.3 14292 12972 Accepted 100
28 4 0029.8 14108 12756 Accepted 100
29 4 0030.5 14196 12884 Accepted 100
30 4 0030.6 14296 12960 Accepted 100
31 4 0029.4 14188 12828 Accepted 100
32 4 0029.7 14292 13060 Accepted 100
33 5 0029.7 14296 13012 Accepted 100
34 5 0011.7 6608 4424 Accepted 100
35 5 0016.0 6608 5196 Accepted 100
36 5 0016.0 6608 5168 Accepted 100
37 5 0016.0 6608 5168 Accepted 100
38 5 0015.8 6608 5248 Accepted 100
39 5 0015.8 6608 5200 Accepted 100
40 5 0015.6 6608 5256 Accepted 100
41 5 0015.7 6608 5156 Accepted 100
42 5 0016.6 6608 5252 Accepted 100
Submitter:
Caido
Compiler:
c++17
Code Length:
1.57 KB
Back to Top