oj.uz

Submission #1086844

# Submission time Handle Problem Language Result Execution time Memory
1086844 2024-09-11T15:00:28 Z Bananabread Council (JOI23_council) C++17
6 / 100
 162 ms 8032 KB 
#include<bits/stdc++.h>
#define ll int
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen("03-05.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];
void sub2(){
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            ans[i]=max(ans[i],__builtin_popcount((two | (one & ~arr[i]) | (~arr[j] &(one | (zero & ~arr[i]))))));
            ans[j]=max(ans[j],__builtin_popcount((two | (one & ~arr[j]) | (~arr[i] &(one | (zero & ~arr[j]))))));
        }
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<ntr;
    }
}
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){
        sub2();
        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++){
//        for(int nextmask = mask; nextmask ; nextmask=(nextmask-1)&mask){
//            if(super[nextmask]>1){
//                if(__builtin_popcount(mask&nextmask)>=candi[mask][0][0]){
//                    candi[mask][1]=candi[mask][0];
//                    candi[mask][0]={__builtin_popcount(mask&nextmask),nextmask};
//                }
//                else if(__builtin_popcount(mask&nextmask)>candi[mask][1][0]){
//                    candi[mask][1][1]=max(candi[mask][1][1],nextmask);
//                }
//            }
//        }
//    }
    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){
            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 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 49 ms 3312 KB Output is correct
3 Correct 35 ms 3408 KB Output is correct
4 Correct 25 ms 2644 KB Output is correct
5 Correct 35 ms 3160 KB Output is correct
6 Correct 29 ms 2652 KB Output is correct
7 Correct 36 ms 3312 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 23 ms 348 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 49 ms 3312 KB Output is correct
3 Correct 35 ms 3408 KB Output is correct
4 Correct 25 ms 2644 KB Output is correct
5 Correct 35 ms 3160 KB Output is correct
6 Correct 29 ms 2652 KB Output is correct
7 Correct 36 ms 3312 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 23 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 162 ms 8032 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 49 ms 3312 KB Output is correct
3 Correct 35 ms 3408 KB Output is correct
4 Correct 25 ms 2644 KB Output is correct
5 Correct 35 ms 3160 KB Output is correct
6 Correct 29 ms 2652 KB Output is correct
7 Correct 36 ms 3312 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 23 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 162 ms 8032 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 49 ms 3312 KB Output is correct
3 Correct 35 ms 3408 KB Output is correct
4 Correct 25 ms 2644 KB Output is correct
5 Correct 35 ms 3160 KB Output is correct
6 Correct 29 ms 2652 KB Output is correct
7 Correct 36 ms 3312 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct
14 Correct 0 ms 464 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 460 KB Output is correct
17 Correct 23 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Incorrect 162 ms 8032 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -