제출 #989132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
989132		AlphaMale06	Council (JOI23_council)	C++17	78 / 100	4037 ms	14164 KiB

council

#include <bits/stdc++.h>

using namespace std;

const int N = 300001;
const int M = 20;
int a[N];
int sum[M], ans[N], mn[N], masks[N];

int dp[1<<10][1<<10], ppcnt[1<<10][1<<10];

void smin(int & x, int y){
    if(x>y)x=y;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i=0; i< n; i++){
        for(int j=0; j< m; j++){
            int x;
            cin >> x;
            a[i]+=x<<j;
            sum[j]+=x;
        }
    }
    for(int i=0; i< n; i++)mn[i]=1e9;
    for(int i=0; i< n; i++){
        for(int j=0; j< m; j++)sum[j]-=(a[i] & (1<<j))>>j;
        for(int j=0; j< m; j++){
            if(sum[j]>=n/2)ans[i]++;
            if(sum[j]==n/2)masks[i]+=1<<j;
        }
        for(int j=0; j< m; j++)sum[j]+=(a[i] & (1<<j))>>j;
    }
    for(int i=0; i< (1<<M); ++i){
        int f = i>>10;
        int s = i%1024;
        dp[f][s]=1e9;
        ppcnt[f][s]=__builtin_popcount(f & s);
    }
    for(int i=0; i< n-1; ++i){
        int x = a[i];
        int f = x>>10;
        int s = x%1024;
        for(int j = 0; j<(1<<max(0, m-10)); ++j){
            smin(dp[j][s], ppcnt[j][f]);
        }
        x = masks[i+1];
        f = x>>10;
        s = x%1024;
        for(int j=0; j<(1<<10); ++j){
            smin(mn[i+1], dp[f][j]+ppcnt[s][j]);
        }
    }
    for(int i=0; i< (1<<M); ++i){
        int f = i>>10;
        int s = i%1024;
        dp[f][s]=1e9;
    }
    for(int i=n-1; i>0; i--){
        int x = a[i];
        int f = x>>10;
        int s = x%1024;
        for(int j = 0; j<(1<<max(0, m-10)); ++j){
            smin(dp[j][s], ppcnt[j][f]);
        }
        x = masks[i-1];
        f = x>>10;
        s = x%1024;
        for(int j=0; j<(1<<10); ++j){
            smin(mn[i-1], dp[f][j]+ppcnt[s][j]);
        }
    }
    for(int i=0; i< n; i++){
        cout << ans[i]-mn[i] << '\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