35pts只错#11#14求条

#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int N = 1010;
int a[N], vis[N], c[2], mp[N][N], n;
void dfs(int p)
{
  c[vis[p]] ++;
  for (int i = 1; i <= n; i ++)
  {
    if (mp[i][p])
    {
      if (vis[i] == vis[p])
      {
        cout << -1 << endl;
        exit(0);
      }
      if (vis[i] == -1)
      {
        vis[i] = 1 - vis[p];
        dfs(i);
      }
    }
  }
}
signed main()
{
  cin.tie(0)->sync_with_stdio(0);
  int h, w;
  cin >> n >> h >> w;
  for (int k = 1; k <= n; k ++)
  {
    for (int i = 0; i < h; i ++)
      for (int j = 0; j < w; j ++)
      {
        int x;
        cin >> x;
        a[k] |= x << i * w + j;
      }
    //a[k] = ~a[k] & (1ll << h * w) - 1;
  }
  for (int i = 1; i <= n; i ++)
  {
    for (int j = 1; j < i; j ++)
    {
      if (__builtin_popcount(a[i] & a[j]) >= (min(__builtin_popcount(a[i]), __builtin_popcount(a[j])) + 1) / 2)
        mp[i][j] = mp[j][i] = 0;
      else
        mp[i][j] = mp[j][i] = 1;
    }
  }
  memset(vis, -1, sizeof(vis));
  int ans = 0;
  for (int i = 1; i <= n; i ++)
  {
    if (vis[i] == -1)
    {
      c[0] = 0, c[1] = 0;
      vis[i] = 0;
      dfs(i);
      ans += max(c[0], c[1]);
    }
  }
  cout << ans << endl;
  return 0;
}