제출 #993193

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
993193	2024-06-05 12:30:42	onbert	Council (JOI23_council)	C++17	100 / 100	2001 ms	101208 KiB

council

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
bool cmp (int a, int b) {
    int A = 0, B = 0;
    for (int i=0;i<20;i++) if (a & (1<<i)) A++;
    for (int i=0;i<20;i++) if (b & (1<<i)) B++;
    return A < B;
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, m;
    cin >> n >> m;
    int N = (1<<m);
    pair<int,int> mn[N][2];
    int sum[m], a[n+1][m];
    for (int i=0;i<m;i++) sum[i] = 0;
    for (int i=0;i<N;i++) {
        mn[i][0] = {-1, 0}, mn[i][1] = {-1, 0};
        for (int j=0;j<m;j++) if (i & (1<<j)) mn[i][0].second++, mn[i][1].second++;
    }
    for (int i=1;i<=n;i++) {
        int cur = 0;
        for (int j=0;j<m;j++) {
            cin >> a[i][j];
            cur += (!a[i][j]) * (1<<j);
            sum[j] += a[i][j];
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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: 22 / 22