제출 #739640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
739640		sidon	Council (JOI23_council)	C++17	78 / 100	4093 ms	22432 KiB

council

#include <bits/stdc++.h>
using namespace std;

const int B = 10;

array<int, 2> s[1<<B][1<<B][2];
int popcount[1<<B];

signed main() {
	cin.tie(0)->sync_with_stdio(0);

	for(int i = 0; i < (1<<B); ++i)
		popcount[i] = __builtin_popcount(i);
	
	int N, M; cin >> N >> M;
	int A[N] {}, c[M] {};

	for(int i = 0; i < N; ++i) {
		for(int j = 0; j < M; ++j) {
			int v; cin >> v;
			A[i] |= v << j;
			c[j] += v;
		}
		int x = A[i] >> B;

		for(int j = 0; j < (1<<B); ++j) {
			int v = popcount[j] - popcount[A[i] & j];
			if(v > s[x][j][0][0]) s[x][j][0] = {v, i};
			if(v > s[x][j][1][0]) swap(s[x][j][0], s[x][j][1]);
		}
	}

	for(int i = 0; i < N; ++i) {
		int ans {}, ext {}, x {};
		for(int j = 0; j < M; ++j) {
			int cur = c[j] - bool(A[i] & (1<<j));
			if(cur == N / 2) x |= 1<<j;
			if(cur  > N / 2) ++ext;
		}

		for(int j = 0; j < (1<<B); ++j)
			ans = max(ans, popcount[(x >> B)] - popcount[(x >> B) & j] + s[j][x & ((1<<B) - 1)][s[j][x & ((1<<B) - 1)][1][1] != i][0]);

		cout << ans + ext << '\n';
	}
}

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