Back to Submissions List

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

17196
37360
Time Limit Exceeded
42

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 無其他限制 0 / 58

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 5 0017.0 20268 16084 Accepted 100
1 1 5 0018.7 20268 17756 Accepted 100
2 1 5 0017.6 20268 16064 Accepted 100
3 2 5 0021.9 21080 16284 Accepted 100
4 2 5 0031.7 23384 17856 Accepted 100
5 2 5 0034.9 23384 17768 Accepted 100
6 2 5 0037.3 23384 17768 Accepted 100
7 2 5 0034.4 23384 17888 Accepted 100
8 3 4 5 0241.5 27000 24476 Accepted 100
9 3 4 5 0400.2 30432 27756 Accepted 100
10 3 4 5 0437.9 31700 28504 Accepted 100
11 3 4 5 0496.9 32412 29904 Accepted 100
12 3 4 5 0522.4 33072 30548 Accepted 100
13 3 4 5 0556.6 33732 31188 Accepted 100
14 3 4 5 0578.1 35096 31428 Accepted 100
15 3 4 5 0567.4 33732 31172 Accepted 100
16 3 4 5 0556.9 33732 31096 Accepted 100
17 3 4 5 0565.0 33868 31272 Accepted 100
18 4 5 0248.2 27364 24112 Accepted 100
19 4 5 0389.8 30864 27652 Accepted 100
20 4 5 0434.4 32216 28700 Accepted 100
21 4 5 0581.5 33572 29916 Accepted 100
22 4 5 0521.4 34240 30716 Accepted 100
23 4 5 0567.9 33732 31216 Accepted 100
24 4 5 0564.5 35008 31396 Accepted 100
25 4 5 0570.3 34328 31192 Accepted 100
26 4 5 0514.3 34352 30676 Accepted 100
27 4 5 0516.9 34352 30844 Accepted 100
28 4 5 0496.1 35392 31108 Accepted 100
29 5 0421.0 35360 31400 Accepted 100
30 5 0540.0 37320 32352 Accepted 100
31 5 0274.6 36444 31452 Accepted 100
32 5 1101.8 44304 37108 Time Limit Exceeded 0
33 5 0398.7 38032 32908 Accepted 100
34 5 1079.1 44240 36584 Time Limit Exceeded 0
35 5 0389.6 38624 33468 Accepted 100
36 5 0653.5 44448 37336 Accepted 100
37 5 0703.9 44440 37360 Accepted 100
38 5 1091.5 37432 31032 Time Limit Exceeded 0
Submitter:
Compiler:
c++17
Code Length:
2.05 KB
Back to Top