Back to Submissions List View New Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

0
3480
Memory Limit Exceeded
22

Subtask Results

Subtask no. Testdata Range Constraints Score
1 0~9 $n\leq 10, \{a_1,a_2,\dots,a_n\}=\{b_1,b_2,\dots,b_n\}=\{0,1,2\dots,n-1\}$ 22 / 22
2 0~19 $n\leq 100$ 0 / 33
3 0~39 無額外限制 0 / 45

Testdata Results

Testdata no. Subtasks Time (ms) Memory (RSS, KiB) Verdict Score
0 1 2 3 0000.0 3356 Accepted 100
1 1 2 3 0000.0 3268 Accepted 100
2 1 2 3 0000.0 3480 Accepted 100
3 1 2 3 0000.0 3284 Accepted 100
4 1 2 3 0000.0 3284 Accepted 100
5 1 2 3 0000.0 3220 Accepted 100
6 1 2 3 0000.0 3460 Accepted 100
7 1 2 3 0000.0 3436 Accepted 100
8 1 2 3 0000.0 3376 Accepted 100
9 1 2 3 0000.0 3280 Accepted 100
10 2 3 0000.0 2984 Memory Limit Exceeded 0
11 2 3 0000.0 2912 Memory Limit Exceeded 0
12 2 3 0000.0 3024 Memory Limit Exceeded 0
13 2 3 0000.0 2928 Memory Limit Exceeded 0
14 2 3 0000.0 2960 Memory Limit Exceeded 0
15 2 3 0000.0 2920 Memory Limit Exceeded 0
16 2 3 0000.0 3028 Memory Limit Exceeded 0
17 2 3 0000.0 2908 Memory Limit Exceeded 0
18 2 3 0000.0 3088 Memory Limit Exceeded 0
19 2 3 0000.0 2904 Memory Limit Exceeded 0
20 3 0000.0 3016 Memory Limit Exceeded 0
21 3 0000.0 2992 Memory Limit Exceeded 0
22 3 0000.0 2944 Memory Limit Exceeded 0
23 3 0000.0 3004 Memory Limit Exceeded 0
24 3 0000.0 2976 Memory Limit Exceeded 0
25 3 0000.0 2948 Memory Limit Exceeded 0
26 3 0000.0 2948 Memory Limit Exceeded 0
27 3 0000.0 3108 Memory Limit Exceeded 0
28 3 0000.0 3076 Memory Limit Exceeded 0
29 3 0000.0 2972 Memory Limit Exceeded 0
30 3 0000.0 3032 Memory Limit Exceeded 0
31 3 0000.0 3040 Memory Limit Exceeded 0
32 3 0000.0 3096 Memory Limit Exceeded 0
33 3 0000.0 2976 Memory Limit Exceeded 0
34 3 0000.0 2952 Memory Limit Exceeded 0
35 3 0000.0 2952 Memory Limit Exceeded 0
36 3 0000.0 3000 Memory Limit Exceeded 0
37 3 0000.0 3100 Memory Limit Exceeded 0
38 3 0000.0 2960 Memory Limit Exceeded 0
39 3 0000.0 2944 Memory Limit Exceeded 0
Submitter:
Compiler:
c++14
Code Length:
1.12 KB
Back to Top