Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

4716
5332
Time Limit Exceeded
20

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~3 範例測資 0 / 0
2 4~17 $N \le 10$ 9 / 9
3 18~23 $A_i$ 一定是質數,且若一種數字有出現,它會出現恰 $2$ 或 $3$ 次 11 / 11
4 4~17, 24~36 $N \le 100$ 0 / 31
5 0~47 無額外限制 0 / 49

Testdata Results

Testdata no. Subtasks Time (ms) Memory (RSS, KiB) Verdict Score
0 1 5 0000.0 3288 Accepted 100
1 1 5 0000.0 3268 Accepted 100
2 1 5 0000.0 3344 Accepted 100
3 1 5 0000.0 3396 Accepted 100
4 2 4 5 0000.0 3472 Accepted 100
5 2 4 5 0000.0 3356 Accepted 100
6 2 4 5 0000.0 3456 Accepted 100
7 2 4 5 0000.0 3336 Accepted 100
8 2 4 5 0000.0 3276 Accepted 100
9 2 4 5 0000.0 3288 Accepted 100
10 2 4 5 0000.0 3456 Accepted 100
11 2 4 5 0000.0 3324 Accepted 100
12 2 4 5 0000.0 3460 Accepted 100
13 2 4 5 0000.0 3388 Accepted 100
14 2 4 5 0000.0 3336 Accepted 100
15 2 4 5 0000.0 3448 Accepted 100
16 2 4 5 0000.0 3420 Accepted 100
17 2 4 5 0000.0 3388 Accepted 100
18 3 5 0052.0 5088 Accepted 100
19 3 5 0064.0 5288 Accepted 100
20 3 5 0072.0 5296 Accepted 100
21 3 5 0064.0 5136 Accepted 100
22 3 5 0060.0 5180 Accepted 100
23 3 5 0080.0 5312 Accepted 100
24 4 5 0020.0 3684 Wrong Answer 0
25 4 5 0012.0 3528 Wrong Answer 0
26 4 5 0000.0 3488 Accepted 100
27 4 5 0004.0 3712 Accepted 100
28 4 5 0004.0 3648 Accepted 100
29 4 5 0004.0 3708 Accepted 100
30 4 5 0004.0 3672 Accepted 100
31 4 5 0004.0 3704 Accepted 100
32 4 5 0004.0 3664 Accepted 100
33 4 5 0000.0 3652 Accepted 100
34 4 5 0000.0 3580 Accepted 100
35 4 5 0004.0 3652 Accepted 100
36 4 5 0004.0 3708 Accepted 100
37 5 1980.0 4848 Time Limit Exceeded 0
38 5 1680.0 5248 Time Limit Exceeded 0
39 5 0044.0 5168 Accepted 100
40 5 0052.0 5156 Accepted 100
41 5 0048.0 5020 Accepted 100
42 5 0072.0 5216 Accepted 100
43 5 0076.0 5184 Accepted 100
44 5 0048.0 5224 Wrong Answer 0
45 5 0036.0 5012 Wrong Answer 0
46 5 0084.0 5300 Accepted 100
47 5 0140.0 5332 Accepted 100
Submitter:
Compiler:
c++17
Code Length:
2.62 KB
Back to Top