Results of submission #370373

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2283. 調分
10382
37008
Accepted
100

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~2 範例測資 0 / 0
2 3~7 $m = 1$ 6 / 6
3 8~17 $m = n - 1, \forall 1 \leq i \leq m, k_i = 2$ 16 / 16
4 8~28 $\forall 1 \leq i \leq m, k_i = 2$ 20 / 20
5 0~38 無其他限制 58 / 58

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 5 0002.5 6212 3556 Accepted 100
1 1 5 0002.7 6212 3596 Accepted 100
2 1 5 0002.8 6212 3636 Accepted 100
3 2 5 0022.5 12456 8696 Accepted 100
4 2 5 0064.6 27936 21264 Accepted 100
5 2 5 0071.7 29720 23172 Accepted 100
6 2 5 0090.5 31068 25016 Accepted 100
7 2 5 0074.8 30216 23588 Accepted 100
8 3 4 5 0174.4 22496 19624 Accepted 100
9 3 4 5 0290.8 30656 27432 Accepted 100
10 3 4 5 0326.0 32948 29820 Accepted 100
11 3 4 5 0351.8 35552 32740 Accepted 100
12 3 4 5 0373.8 37100 34052 Accepted 100
13 3 4 5 0395.6 38804 35788 Accepted 100
14 3 4 5 0419.6 40172 36640 Accepted 100
15 3 4 5 0435.7 38804 35624 Accepted 100
16 3 4 5 0494.7 38808 35760 Accepted 100
17 3 4 5 0403.4 38816 35624 Accepted 100
18 4 5 0166.7 21428 18296 Accepted 100
19 4 5 0295.0 30048 26804 Accepted 100
20 4 5 0328.6 32336 28748 Accepted 100
21 4 5 0365.2 35332 31648 Accepted 100
22 4 5 0390.2 36980 33468 Accepted 100
23 4 5 0396.9 38804 35660 Accepted 100
24 4 5 0420.1 39520 35844 Accepted 100
25 4 5 0419.8 38584 35380 Accepted 100
26 4 5 0362.7 36588 33056 Accepted 100
27 4 5 0380.0 36592 33064 Accepted 100
28 4 5 0181.0 39000 34360 Accepted 100
29 5 0348.5 36236 32164 Accepted 100
30 5 0249.8 36248 30860 Accepted 100
31 5 0250.9 35184 30064 Accepted 100
32 5 0260.6 44120 35732 Accepted 100
33 5 0257.8 38196 33152 Accepted 100
34 5 0249.2 44124 35188 Accepted 100
35 5 0361.9 40076 35000 Accepted 100
36 5 0281.2 44460 37008 Accepted 100
37 5 0277.2 44468 36860 Accepted 100
38 5 0140.6 36520 28380 Accepted 100
Submitter:
番薯
Compiler:
c++17
Code Length:
1.58 KB
Back to Top