#include<bits/stdc++.h> using namespace std; // define #define execute cerr << " Time: " << fixed << setprecision(6) << (1.0 * clock() / CLOCKS_PER_SEC) << "s\n"; #define ll long long #define ii pair <int , int> #define iii pair <int , ii> #define se second #define fi first #define all(v) (v).begin() , (v).end() #define Unique(v) sort(all(v)) , v.resize(unique(all(v)) - v.begin()) #define bit(x,i) (((x) >> (i)) & 1LL) #define flip(x,i) ((x) ^ (1LL << (i))) #define ms(d,x) memset(d , x , sizeof(d)) #define exist __exist #define ends __ends #define visit visited #define left __left #define right __right #define prev __prev #define next __next #define sitingfake 1 #define orz 1 //constant const long long mod = 1e9 + 7; const long long linf = 4557430888798830399LL; const long long nlinf = -4485090715960753727LL; const int LOG = 20; const int inf = 1061109567; const int ninf = -1044266559; const int dx[] = {0 , -1 , 0 , 1}; const int dy[] = {-1 , 0 , 1 , 0}; template<typename T> bool maximize(T &a, const T &b) { if(a < b) {a = b; return 1;} return 0; } template<typename T> bool minimize(T &a, const T &b) { if(a > b) {a = b; return 1;} return 0; } void Plus(ll & a ,ll b) { b %= mod; a += b; if(a < 0) a += mod; a %= mod; return; } void Mul(ll & a, ll b) { (a *= (b % mod)) %= mod; return; } //code const int maxn = 3e5 + 7; int n , m; int a[maxn][21]; int sum[22]; int val[maxn]; struct SOS { ii Max1 , Max2; SOS () { Max1 = ii(-1 , -1) , Max2 = ii(-1 , -1); } }dp[1 << 20]; ii f[1 << 20]; void solve(void) { cin >> n >> m; for(int i = 1; i <= n; i++) { for(int j = 0; j < m; j++) { cin >> a[i][j]; sum[j] += a[i][j]; } } for(int i = 1; i <= n; i++) { for(int j = 0; j < m; j++) { if(!a[i][j]) val[i] |= (1 << j); } if(f[val[i]].fi != 0) f[val[i]].se = i; else f[val[i]].fi = i; } for(int b = 0; b < m; b++) { for(int mask = (1 << m) - 1; mask >= 0; mask--) { if(!bit(mask , b)) { ii tmp = f[mask ^ (1 << b)]; if(tmp.fi == 0) continue; if(f[mask].fi != 0 && f[mask].se != 0) continue; if(f[mask].fi == 0) { f[mask] = tmp; } else { if(tmp.fi != f[mask].fi) f[mask].se = tmp.fi; else f[mask].se = tmp.se; } } } } for(int mask = 0; mask < (1 << m); mask++) { if(f[mask].fi) dp[mask].Max1 = {__builtin_popcount(mask) , f[mask].fi}; if(f[mask].se) dp[mask].Max2 = {__builtin_popcount(mask) , f[mask].se}; } for(int b = 0; b < 20; b++) { for(int mask = 0; mask < (1 << m); mask++) { if(bit(mask , b)) { SOS tmp = dp[mask ^ (1 << b)]; if(tmp.Max1.fi > dp[mask].Max1.fi) { if(tmp.Max1.se == dp[mask].Max1.se) { dp[mask].Max1 = tmp.Max1; dp[mask].Max2 = max(dp[mask].Max2 , tmp.Max2); } else { dp[mask].Max2 = max(dp[mask].Max1 , tmp.Max2); dp[mask].Max1 = tmp.Max1; } } else { if(tmp.Max1.fi > dp[mask].Max2.fi && tmp.Max1.se != dp[mask].Max1.se) { dp[mask].Max2 = tmp.Max1; } else { dp[mask].Max2 = max(dp[mask].Max2 , tmp.Max2); } } } } } for(int i = 1; i <= n; i++) { int mask = 0 , ans = 0; for(int j = 0; j < m; j++) { int val = sum[j] - a[i][j]; if(val > n / 2) ans++; else if(val == n / 2) { mask |= (1 << j); } } if(dp[mask].Max1.se != i && dp[mask].Max1.fi != -1) { ans += dp[mask].Max1.fi; } else if(dp[mask].Max2.se != -1) { ans += dp[mask].Max2.fi; } cout << ans << "\n"; } } /** **/ signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "" if(fopen(task".inp","r")) { freopen(task".inp","r",stdin); freopen(task".out","w",stdout); } int tc = 1; // cin >> tc; while(tc--) solve(); // execute; }

council.cpp: In function 'int main()':
council.cpp:207:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  207 |        freopen(task".inp","r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
council.cpp:208:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  208 |        freopen(task".out","w",stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~