oj.uz

Submission #1086969

# Submission time Handle Problem Language Result Execution time Memory
1086969 2024-09-12T00:43:21 Z Bananabread Council (JOI23_council) C++17
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
#define ll int
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen("06-02.inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll pref[100];
ll arr[300001];
ll ans[300001];
ll cnt[1<<17];
ll best[1<<17];
ll n,m;
ll one,two,zero;
ll super[1<<17];
array<array<ll,2>,2> candi[1<<17];
bool ison(ll x,ll i){
    return (x&(1<<i))>0;
}
ll cntc=0;
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=0;j<m;j++){
            ll x;
            cin>>x;
            pref[j]+=x;
            arr[i]+=(x<<j);
        }
        cnt[arr[i]]++;
    }
    for(int i=0;i<m;i++){
        if(pref[i]>=n/2+2) two|=(1<<i);
        if(pref[i]==n/2+1) one|=(1<<i);
        if(pref[i]==n/2)  zero|=(1<<i);
    }
    if(n<=3000){
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                ll cnt=0;
                for(int u=0;u<m;u++){
                    ll c=pref[u]-ison(arr[i],u)-ison(arr[j],u);
                    if(c>=n/2) cnt++;
                }
//                ans[i]=max(ans[i],cnt);
//                ans[j]=max(ans[j],cnt);
            }
        }
        for(int i=1;i<=n;i++){
            cout<<ans[i]<<ntr;
        }
        return 0;
    }
    for(int i=0;i<(1<<m);i++){
        if(!cnt[i]) continue;
        candi[i][0]={-1,-1};
        candi[i][1]={-1,-1};
        ll mask=(((1<<m)-1) & ~i);
        for (int nextmask = mask; nextmask ; nextmask=(nextmask-1)&mask){
            super[nextmask]+=cnt[i];
        }
    }
    for(int mask=0;mask<(1<<m);mask++){
        if(!cnt[mask]) continue;
        cnt[mask]--;
        ll ONE=(two | ( one & ~mask ));
        ll ZERO=( one | ( zero & ~mask ));
       // cout<<ONE<<' '<<ZERO<<ntr;
        ll optmask=0;
        for(int i=0;i<m;i++){
            if(ONE&(1<<i)) continue;
            if(ZERO&(1<<i)) optmask|=(1<<i);
        }
        for(int nextmask=optmask;nextmask;nextmask=(nextmask-1)&optmask){
            if(super[nextmask]>1)
                best[mask]=max(best[mask],__builtin_popcount(ONE|(ZERO&nextmask)));
        }
        //cout<<ntr<<ntr;
        best[mask]=max(best[mask],__builtin_popcount(ONE));
        cnt[mask]++;
    }
    for(int i=1;i<=n;i++){
        cout<<best[arr[i]]<<ntr;
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -