Results of submission #326152

Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2283. 調分
2542
7012
Wrong Answer
0

Subtask Results

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

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 5 0002.5 9168 3720 Accepted 100
1 1 5 0002.5 9168 3832 Wrong Answer 0
2 1 5 0002.6 9168 3836 Accepted 100
3 2 5 0009.1 9168 4640 Accepted 100
4 2 5 0022.4 9168 6132 Accepted 100
5 2 5 0025.9 9168 6716 Wrong Answer 0
6 2 5 0028.6 9168 6840 Accepted 100
7 2 5 0026.3 9168 7012 Wrong Answer 0
8 3 4 5 0046.8 9168 4892 Wrong Answer 0
9 3 4 5 0094.4 9168 5592 Wrong Answer 0
10 3 4 5 0076.0 9168 5608 Wrong Answer 0
11 3 4 5 0124.1 9168 5928 Wrong Answer 0
12 3 4 5 0092.9 9168 6228 Wrong Answer 0
13 3 4 5 0105.7 9168 6172 Wrong Answer 0
14 3 4 5 0100.0 9168 6212 Wrong Answer 0
15 3 4 5 0102.9 9168 6064 Wrong Answer 0
16 3 4 5 0100.8 9168 6132 Wrong Answer 0
17 3 4 5 0098.7 9168 6072 Wrong Answer 0
18 4 5 0044.1 9168 4448 Wrong Answer 0
19 4 5 0070.7 9168 5152 Wrong Answer 0
20 4 5 0081.2 9168 5320 Wrong Answer 0
21 4 5 0084.6 9168 5356 Wrong Answer 0
22 4 5 0086.1 9168 5472 Wrong Answer 0
23 4 5 0099.6 9168 6340 Wrong Answer 0
24 4 5 0096.1 9168 5940 Wrong Answer 0
25 4 5 0093.2 9168 5856 Wrong Answer 0
26 4 5 0084.5 9168 5008 Wrong Answer 0
27 4 5 0084.0 9168 5176 Wrong Answer 0
28 4 5 0076.0 9168 4900 Wrong Answer 0
29 5 0072.4 9168 5684 Wrong Answer 0
30 5 0064.9 9168 5712 Wrong Answer 0
31 5 0052.4 9168 5940 Wrong Answer 0
32 5 0054.1 9168 6016 Wrong Answer 0
33 5 0056.0 9168 6124 Wrong Answer 0
34 5 0054.1 9168 6220 Wrong Answer 0
35 5 0069.3 9168 6200 Wrong Answer 0
36 5 0054.3 9168 6068 Wrong Answer 0
37 5 0055.5 9168 6344 Wrong Answer 0
38 5 0047.1 9168 6616 Wrong Answer 0
Submitter:
patrickH
Compiler:
c++17
Code Length:
1.15 KB
Back to Top