Submission #1086972

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1086972	2024-09-12T00:46:30 Z	Bananabread	Council (JOI23_council)	C++17	Compilation error	0 ms	0 KB

council

#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];
bool ison(ll x,ll i){
    return (x>>i)&1;
}
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;
        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;
    }
}
#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];
bool ison(ll x,ll i){
    return (x>>i)&1;
}
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;
        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;
    }
}

Compilation message

council.cpp:92:4: error: redefinition of 'int pref [100]'
   92 | ll pref[100];
      |    ^~~~
council.cpp:8:4: note: 'int pref [100]' previously declared here
    8 | ll pref[100];
      |    ^~~~
council.cpp:93:4: error: redefinition of 'int arr [300001]'
   93 | ll arr[300001];
      |    ^~~
council.cpp:9:4: note: 'int arr [300001]' previously declared here
    9 | ll arr[300001];
      |    ^~~
council.cpp:94:4: error: redefinition of 'int ans [300001]'
   94 | ll ans[300001];
      |    ^~~
council.cpp:10:4: note: 'int ans [300001]' previously declared here
   10 | ll ans[300001];
      |    ^~~
council.cpp:95:4: error: redefinition of 'int cnt [131072]'
   95 | ll cnt[1<<17];
      |    ^~~
council.cpp:11:4: note: 'int cnt [131072]' previously declared here
   11 | ll cnt[1<<17];
      |    ^~~
council.cpp:96:4: error: redefinition of 'int best [131072]'
   96 | ll best[1<<17];
      |    ^~~~
council.cpp:12:4: note: 'int best [131072]' previously declared here
   12 | ll best[1<<17];
      |    ^~~~
council.cpp:97:4: error: redefinition of 'int n'
   97 | ll n,m;
      |    ^
council.cpp:13:4: note: 'int n' previously declared here
   13 | ll n,m;
      |    ^
council.cpp:97:6: error: redefinition of 'int m'
   97 | ll n,m;
      |      ^
council.cpp:13:6: note: 'int m' previously declared here
   13 | ll n,m;
      |      ^
council.cpp:98:4: error: redefinition of 'int one'
   98 | ll one,two,zero;
      |    ^~~
council.cpp:14:4: note: 'int one' previously declared here
   14 | ll one,two,zero;
      |    ^~~
council.cpp:98:8: error: redefinition of 'int two'
   98 | ll one,two,zero;
      |        ^~~
council.cpp:14:8: note: 'int two' previously declared here
   14 | ll one,two,zero;
      |        ^~~
council.cpp:98:12: error: redefinition of 'int zero'
   98 | ll one,two,zero;
      |            ^~~~
council.cpp:14:12: note: 'int zero' previously declared here
   14 | ll one,two,zero;
      |            ^~~~
council.cpp:99:4: error: redefinition of 'int super [131072]'
   99 | ll super[1<<17];
      |    ^~~~~
council.cpp:15:4: note: 'int super [131072]' previously declared here
   15 | ll super[1<<17];
      |    ^~~~~
council.cpp:100:6: error: redefinition of 'bool ison(int, int)'
  100 | bool ison(ll x,ll i){
      |      ^~~~
council.cpp:16:6: note: 'bool ison(int, int)' previously defined here
   16 | bool ison(ll x,ll i){
      |      ^~~~
council.cpp:103:4: error: redefinition of 'int cntc'
  103 | ll cntc=0;
      |    ^~~~
council.cpp:19:4: note: 'int cntc' previously defined here
   19 | ll cntc=0;
      |    ^~~~
council.cpp:104:5: error: redefinition of 'int main()'
  104 | int main(){
      |     ^~~~
council.cpp:20:5: note: 'int main()' previously defined here
   20 | int main(){
      |     ^~~~