Results of submission #292732

Back to Submissions List View Old Results

Problem

Total Time (ms)

Max Memory (RSS, KiB)

Verdict

Score

2195. C. 粉刷護欄
4396
20700
Wrong Answer
0

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\}$ 0 / 22
2 0~19 $n\leq 100$ 0 / 33
3 0~39 無額外限制 0 / 45

Testdata Results

Testdata no. Subtasks Time (ms) Memory (VSS, KiB) Memory (RSS, KiB) Verdict Score
0 1 2 3 0002.6 14012 3704 Accepted 100
1 1 2 3 0002.5 14012 3700 Accepted 100
2 1 2 3 0002.7 14012 3592 Accepted 100
3 1 2 3 0002.5 14012 3564 Accepted 100
4 1 2 3 0002.6 14012 3564 Accepted 100
5 1 2 3 0002.8 14012 3596 Accepted 100
6 1 2 3 0002.4 14012 3572 Accepted 100
7 1 2 3 0002.5 14012 3596 Wrong Answer 0
8 1 2 3 0002.6 14012 3644 Wrong Answer 0
9 1 2 3 0002.4 14012 3640 Accepted 100
10 2 3 0002.4 14012 3568 Accepted 100
11 2 3 0002.4 14012 3600 Accepted 100
12 2 3 0002.6 14012 3600 Accepted 100
13 2 3 0002.5 14012 3652 Accepted 100
14 2 3 0002.5 14012 3592 Accepted 100
15 2 3 0002.5 14012 3584 Accepted 100
16 2 3 0002.4 14012 3504 Accepted 100
17 2 3 0002.5 14012 3652 Accepted 100
18 2 3 0002.4 14012 3644 Accepted 100
19 2 3 0002.5 14012 3580 Wrong Answer 0
20 3 0185.3 22988 15984 Accepted 100
21 3 0042.8 16784 7432 Accepted 100
22 3 0033.5 16124 6608 Accepted 100
23 3 0040.7 16652 7216 Accepted 100
24 3 0049.0 17312 8096 Accepted 100
25 3 0216.4 24044 17508 Accepted 100
26 3 0240.3 24840 18432 Accepted 100
27 3 0259.5 24968 18772 Accepted 100
28 3 0244.4 24440 17980 Accepted 100
29 3 0273.2 25232 19120 Accepted 100
30 3 0290.5 25628 19632 Accepted 100
31 3 0235.9 24176 17560 Accepted 100
32 3 0276.3 25364 19248 Accepted 100
33 3 0274.8 25100 18836 Accepted 100
34 3 0297.8 25892 20044 Accepted 100
35 3 0296.2 25760 19772 Accepted 100
36 3 0248.5 24308 17820 Accepted 100
37 3 0253.1 24572 18012 Accepted 100
38 3 0314.1 26420 20700 Accepted 100
39 3 0273.6 24968 18728 Accepted 100
Submitter:
089487
Compiler:
c++14
Code Length:
1.85 KB
Back to Top