Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Problem A:
Bit String Reordering

You have to reorder a given bit string as specified. The only operation allowed is swapping adjacent bit pairs. Please write a program that calculates the minimum number of swaps required.

The initial bit string is simply represented by a sequence of bits, while the target is specified by a run-length code. The run-length code of a bit string is a sequence of the lengths of maximal consecutive sequences of zeros or ones in the bit string. For example, the run-length code of "011100" is "1 3 2". Note that there are two different bit strings with the same run-length code, one starting with zero and the other starting with one. The target is either of these two.

In Sample Input 1, bit string "100101" should be reordered so that its run-length code is "1 3 2", which means either "100011" or "011100". At least four swaps are required to obtain "011100". On the other hand, only one swap is required to make "100011". Thus, in this example, 1 is the answer.

Input

The input consists of a single test case. The test case is formatted as follows.

$N$ $M$

$b_1$ $b_2$ . . . $b_N$

$p_1$ $p_2$ . . . $p_M$

The first line contains two integers $N$ ($1 \leq N \leq 15$) and $M$ ($1 \leq M \leq N$). The second line
specifies the initial bit string by $N$ integers. Each integer $b_i$ is either 0 or 1. The third line contains the run-length code, consisting of $M$ integers. Integers $p_1$ through $p_M$ represent the lengths of consecutive sequences of zeros or ones in the bit string, from left to right. Here, $1 \leq p_j$ for $1 \leq j \leq M$ and $\sum^{M}_{j=1} p_j = N$ hold. It is guaranteed that the initial bit string can be reordered into a bit string with its run-length code $p_1, . . . , p_M$.

Output

Output the minimum number of swaps required

Sample Input 1

6 3
1 0 0 1 0 1
1 3 2

Sample Output 1

1

Sample Input 2

7 2
1 1 1 0 0 0 0
4 3

Sample Output 2

12

Sample Input 3

15 14
1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
1 1 1 1 1 1 1 1 1 1 1 1 1 2

Sample Output 3

7

Sample Input 4

1 1
0
1

Sample Output 4

0

Solution in Ruby (judge verdict: Accepted)

### constant

INF = 1 << 30

### main

n, m = gets.split.map(&:to_i)

bs = gets.split.map(&:to_i)
st = bs.join.to_i(2)
#puts st

rls = gets.split.map(&:to_i)

b = 0
bits = 0
k = n - 1
for i in (0...m)
  for j in (0...rls[i])
    bits |= 1 << k if b == 1
    k -= 1
  end
  b ^= 1
end

gl0 = bits
gl1 = ((1 << n) - 1) ^ bits
#p [gl0, gl1]

swaps = []
mask = 3
for i in (1...n)
  swaps << mask
  mask <<= 1
end
#p swaps.map{|b| b.to_s(2)}

dists = Array.new(1 << n){INF}
dists[st] = 0

q = [st]

while ! q.empty?
  u = q.shift
  break if u == gl0 || u == gl1

  for mask in swaps
    um = u & mask
    next if um == 0 || um == mask
    v = u ^ mask
    if dists[v] >= INF
      dists[v] = dists[u] + 1
      q << v
    end
  end
end

puts [dists[gl0], dists[gl1]].min