Submission #1086071

#	Time	Username	Problem	Language	Result	Execution time	Memory
1086071		Bananabread	Council (JOI23_council)	C++17	16 / 100	84 ms	50460 KiB

council

#include<bits/stdc++.h>
#define ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname ""
#define frep freopen(taskname".inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll pref[300001];
ll arr[300001][21];
ll ans[300001];
ll n,m;
void sub2(){
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            ll cnt=0;
            for(int u=1;u<=m;u++){
                ll c=pref[u]-arr[i][u]-arr[j][u];
                if(c>n/2-1) cnt++;
            }
            ans[i]=max(ans[i],cnt);
            ans[j]=max(ans[j],cnt);
        }
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<ntr;
    }
}
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    //frep;
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>arr[i][j];
        }
    }
    for(int j=1;j<=m;j++){
        for(int i=1;i<=n;i++){
            pref[j]+=arr[i][j];
        }
    }
    if(n<=3000){
        sub2();
        return 0;
    }
    ll cnt[1<<m]={};
    vector<array<int,2>> s[1<<m];
    ll best[1<<m]={};
    for(int i=1;i<=n;i++){
        ll mask=0;
        for(int j=1;j<=m;j++){
            mask<<=1;
            mask+=arr[i][j];
        }
        cnt[mask]++;
    }
    for(int m1=0;m1<(1<<m);m1++){
        if(!cnt[m1]) continue;
        for(int m2=0;m2<(1<<m);m2++){
            if(!cnt[m2]||(cnt[m1]==1&&m1==m2)) continue;
            ll cnt=0;
            //cout<<m1<<' '<<m2<<ntr;
            for(int i=0;i<m;i++){
                ll neg=((m1&(1<<i))>0)+((m2&(1<<i))>0);
                if(pref[i+1]-neg>n/2-1) cnt++;
            }
            //cout<<cnt<<ntr;
            best[m1]=max(best[m1],cnt);
        }
    }
    for(int i=1;i<=n;i++){
        ll mask=0;
        for(int j=1;j<=m;j++){
            mask<<=1;
            mask+=arr[i][j];
        }
        cout<<best[mask]<<ntr;
    }
}

• 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