CompetitiveProgramming/codeforces/100803/A.cpp at master · phonglnDEV/CompetitiveProgramming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <bits/stdc++.h>
using namespace std;
const int oo = 27081993;

int solve(vector <int> a, vector <int> b, int n)
{
  int res = 0;
  for (int i = 0; i < n; i++)
    if (a[i] != b[i])
      for (int j = i + 1; j < n; j++)
        if (a[j] == b[i])
        {
          for (int k = j; k > i; k--)
          {
            swap(a[k], a[k - 1]);
            res++;
          }
          break;
        }

  for (int i = 0; i < n; i++)
    if (a[i] != b[i])
      return oo;

  return res;
}

int main()
{
  ios::sync_with_stdio(0);
  int n, m, s[22];
  vector <int> a(22), b(22);
  cin >> n >> m;
  for (int i = 0; i < n; i++)
    cin >> a[i];

  for (int i = 0; i < m; i++)
    cin >> s[i];

  for (int i = 0, j = 0, v = 0; j < m; j++, v ^= 1)
    for (int k = 0; k < s[j]; k++)
      b[i++] = v;

  int ans = solve(a, b, n);

  for (int i = 0, j = 0, v = 1; j < m; j++, v ^= 1)
    for (int k = 0; k < s[j]; k++)
      b[i++] = v;

  ans = min(ans, solve(a, b, n));

  cout << ans << endl;
}