Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~1 範例測資 0 / 0
2 2~8 只有 3 這種運算 7 / 7
3 0~1, 9~15 $NQ \leq 10^ 6$ 0 / 10
4 2~8, 16~22 只有 13 兩種運算 0 / 13
5 23~29 只有 23 兩種運算,且保證所有的 , $m_i$ = 1 0 / 15
6 2~8, 23~36 只有 23 兩種運算 0 / 20
7 0~43 無額外限制 0 / 35

Testdata Results

Testdata no. Subtasks Time (ms) Memory (RSS, KiB) Verdict Score
0 1 3 7 0024.0 25280 Accepted 100
1 1 3 7 0024.0 25092 Accepted 100
2 2 4 6 7 0024.0 25292 Accepted 100
3 2 4 6 7 0028.0 25120 Accepted 100
4 2 4 6 7 0272.0 25184 Accepted 100
5 2 4 6 7 0272.0 25300 Accepted 100
6 2 4 6 7 0276.0 25316 Accepted 100
7 2 4 6 7 0268.0 25184 Accepted 100
8 2 4 6 7 0532.0 25144 Accepted 100
9 3 7 0024.0 25184 Wrong Answer 0
10 3 7 0028.0 25352 Wrong Answer 0
11 3 7 0028.0 25284 Wrong Answer 0
12 3 7 0036.0 25352 Wrong Answer 0
13 3 7 0032.0 25088 Wrong Answer 0
14 3 7 0228.0 25268 Accepted 100
15 3 7 0220.0 25296 Wrong Answer 0
16 4 7 0024.0 25120 Wrong Answer 0
17 4 7 0028.0 25272 Wrong Answer 0
18 4 7 0720.0 25252 Wrong Answer 0
19 4 7 0712.0 25220 Wrong Answer 0
20 4 7 0704.0 25148 Wrong Answer 0
21 4 7 0724.0 25120 Wrong Answer 0
22 4 7 0508.0 25124 Wrong Answer 0
23 5 6 7 0024.0 25180 Wrong Answer 0
24 5 6 7 0028.0 25348 Wrong Answer 0
25 5 6 7 0736.0 25120 Wrong Answer 0
26 5 6 7 0728.0 25120 Wrong Answer 0
27 5 6 7 0712.0 25300 Wrong Answer 0
28 5 6 7 0728.0 25108 Wrong Answer 0
29 5 6 7 0176.0 25108 Wrong Answer 0
30 6 7 0024.0 25140 Wrong Answer 0
31 6 7 0028.0 25144 Wrong Answer 0
32 6 7 0740.0 25096 Wrong Answer 0
33 6 7 0728.0 25124 Wrong Answer 0
34 6 7 0716.0 25124 Wrong Answer 0
35 6 7 0724.0 25268 Wrong Answer 0
36 6 7 0524.0 25292 Wrong Answer 0
37 7 0080.0 25108 Wrong Answer 0
38 7 0732.0 25284 Wrong Answer 0
39 7 0732.0 25348 Wrong Answer 0
40 7 0744.0 25208 Wrong Answer 0
41 7 0744.0 25180 Wrong Answer 0
42 7 0080.0 25184 Wrong Answer 0
43 7 0684.0 25184 Wrong Answer 0
Submitter:
Compiler:
c++14
Code Length:
2.73 KB
Back to Top