Results of submission #291689

Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2195. C. 粉刷護欄
7297
30060
Accepted
100

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$ 33 / 33
3 0~39 無額外限制 45 / 45

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 3 0007.7 10900 8244 Accepted 100
1 1 2 3 0007.9 10900 8200 Accepted 100
2 1 2 3 0008.0 10900 8204 Accepted 100
3 1 2 3 0007.8 10900 8348 Accepted 100
4 1 2 3 0007.7 10900 8256 Accepted 100
5 1 2 3 0007.9 10900 8240 Accepted 100
6 1 2 3 0007.9 10900 8204 Accepted 100
7 1 2 3 0007.9 10900 8220 Accepted 100
8 1 2 3 0007.7 10900 8200 Accepted 100
9 1 2 3 0007.8 10900 8188 Accepted 100
10 2 3 0007.9 10900 8264 Accepted 100
11 2 3 0007.8 10900 8216 Accepted 100
12 2 3 0008.0 10900 8348 Accepted 100
13 2 3 0008.0 10900 8240 Accepted 100
14 2 3 0008.0 10900 8252 Accepted 100
15 2 3 0008.0 10900 8196 Accepted 100
16 2 3 0008.0 10900 8260 Accepted 100
17 2 3 0008.1 10900 8220 Accepted 100
18 2 3 0008.1 10900 8248 Accepted 100
19 2 3 0007.9 10900 8092 Accepted 100
20 3 0338.0 26968 24088 Accepted 100
21 3 0080.5 15916 12940 Accepted 100
22 3 0061.0 14884 11832 Accepted 100
23 3 0073.3 15628 12580 Accepted 100
24 3 0094.9 16792 13748 Accepted 100
25 3 0346.7 29032 25864 Accepted 100
26 3 0409.6 30220 27188 Accepted 100
27 3 0401.9 30652 27436 Accepted 100
28 3 0379.2 29632 26668 Accepted 100
29 3 0406.6 31108 28004 Accepted 100
30 3 0485.1 31840 28780 Accepted 100
31 3 0393.2 29176 26004 Accepted 100
32 3 0439.2 31240 28276 Accepted 100
33 3 0450.1 30940 28040 Accepted 100
34 3 0491.5 32272 29232 Accepted 100
35 3 0491.3 31984 29100 Accepted 100
36 3 0399.4 29476 26420 Accepted 100
37 3 0414.4 29908 26880 Accepted 100
38 3 0538.8 33160 30060 Accepted 100
39 3 0445.0 30652 27640 Accepted 100
Submitter:
Astrayt
Compiler:
c++14
Code Length:
2.36 KB
Back to Top