Submission #63539454

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int N = 20, M = 2e5 + 5;

int n, m, f[N][(1 << N) + 5], ans, num[M];
char a[N][M];

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> m >> n;
  ans = n * m;
  for (int i = 1; i <= m; ++i) {
    for (int j = 1; j <= n; ++j) {
      cin >> a[j][i];
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) {
      num[j] = (num[j] << 1) + a[i][j] - '0';
    }
  }
  for (int i = 1; i <= m; ++i) {
    f[0][num[i]]++;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = n; j; --j) {
      for (int k = 0; k < 1 << n; ++k) {
        f[j][k] += f[j - 1][k ^ (1 << i)];
      }
    }
  }
  for (int i = 0; i < 1 << n; ++i) {
    int sum = 0;
    for (int j = 0; j <= n; ++j) {
      sum += f[j][i] * min(j, n - j);
    }
    ans = min(ans, sum);
  }
  cout << ans;
  return 0;
}

Submission Info

Judge Result