제출 #877566

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
877566		LucaIlie	Council (JOI23_council)	C++17	16 / 100	4026 ms	2896 KiB

council

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 3e5;
const int MAX_M = 200;

int vote[MAX_N], pro[MAX_M];

int main() {
    int n, m;

    cin >> n >> m;
    for ( int i = 0; i < n; i++ ) {
        for ( int b = 0; b < m; b++ ) {
            int x;
            cin >> x;
            vote[i] += (x << b);
            pro[b] += x;
        }
    }

    for ( int i = 0; i < n; i++ ) {
        int maxAp = 0;
        for ( int j = 0; j < n; j++ ) {
            if ( i == j )
                continue;
            int ap = 0;
            for ( int b = 0; b < m; b++ ) {
                if ( pro[b] - ((vote[i] >> b) & 1) - ((vote[j] >> b) & 1) >= n / 2 )
                    ap++;
            }
            maxAp = max( maxAp, ap );
        }
        cout << maxAp << "\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