제출 #919866

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
919866		OAleksa	Council (JOI23_council)	C++14	16 / 100	4070 ms	4076 KiB

council

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = 3e5 + 69;
int a[N], cnt[N], n, m;
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> m;
  	for (int i = 1;i <= n;i++) {
  		for (int j = 0;j < m;j++) {
  			int x;
  			cin >> x;
  			if (x > 0) {
  				a[i] += (1 << j);
  				cnt[j]++;
  			}
  		}
  	}
  	for (int i = 1;i <= n;i++) {
  		int ans = 0;
  		for (int j = 1;j <= n;j++) {
  			if (i == j)
  				continue; 
  			int t = 0;
  			for (int k = 0;k < m;k++) {
  				int c = 0;
  				if (a[i] & (1 << k))
  					++c;
  				if (a[j] & (1 << k))
  					++c;
  				if (cnt[k] - c >= n / 2)
  					++t;
  			}
  			ans = max(ans, t);
  		}
  		cout << ans << '\n';
  	}
  }
  return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 0 / 6
• Subtask 4: 0 / 19
• Subtask 5: 0 / 15
• Subtask 6: 0 / 22
• Subtask 7: 0 / 22