oj.uz

Submission #1086823

# Submission time Handle Problem Language Result Execution time Memory
1086823 2024-09-11T14:32:16 Z Bananabread Council (JOI23_council) C++17
40 / 100
 550 ms 11552 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[20];
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;
        for(auto i:candi[ZERO]){
            if(i[1]==-1) break;
           // cout<<i[1]<<' '<<(ONE|(ZERO&i[1]))<<' '<<__builtin_popcount(ONE|(ZERO&i[1]))<<ntr;
            best[mask]=max(best[mask],__builtin_popcount(ONE|(ZERO&i[1])));
        }
        //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 1 ms 344 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 464 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 1 ms 344 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 464 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 0 ms 344 KB Output is correct
2 Correct 35 ms 2900 KB Output is correct
3 Correct 36 ms 2900 KB Output is correct
4 Correct 25 ms 2640 KB Output is correct
5 Correct 37 ms 2840 KB Output is correct
6 Correct 27 ms 2648 KB Output is correct
7 Correct 35 ms 2804 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 25 ms 348 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 35 ms 2900 KB Output is correct
3 Correct 36 ms 2900 KB Output is correct
4 Correct 25 ms 2640 KB Output is correct
5 Correct 37 ms 2840 KB Output is correct
6 Correct 27 ms 2648 KB Output is correct
7 Correct 35 ms 2804 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 25 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 Correct 130 ms 5136 KB Output is correct
21 Correct 123 ms 6496 KB Output is correct
22 Correct 145 ms 6488 KB Output is correct
23 Correct 121 ms 7000 KB Output is correct
24 Correct 110 ms 6736 KB Output is correct
25 Correct 128 ms 6680 KB Output is correct
26 Correct 128 ms 6740 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 464 KB Output is correct
45 Correct 1 ms 464 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 35 ms 2900 KB Output is correct
3 Correct 36 ms 2900 KB Output is correct
4 Correct 25 ms 2640 KB Output is correct
5 Correct 37 ms 2840 KB Output is correct
6 Correct 27 ms 2648 KB Output is correct
7 Correct 35 ms 2804 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 25 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 Correct 130 ms 5136 KB Output is correct
21 Correct 123 ms 6496 KB Output is correct
22 Correct 145 ms 6488 KB Output is correct
23 Correct 121 ms 7000 KB Output is correct
24 Correct 110 ms 6736 KB Output is correct
25 Correct 128 ms 6680 KB Output is correct
26 Correct 128 ms 6740 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 464 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 190 ms 9112 KB Output is correct
48 Correct 169 ms 8584 KB Output is correct
49 Correct 175 ms 8396 KB Output is correct
50 Correct 157 ms 9044 KB Output is correct
51 Correct 170 ms 9108 KB Output is correct
52 Correct 188 ms 9156 KB Output is correct
53 Correct 191 ms 9552 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 35 ms 2900 KB Output is correct
3 Correct 36 ms 2900 KB Output is correct
4 Correct 25 ms 2640 KB Output is correct
5 Correct 37 ms 2840 KB Output is correct
6 Correct 27 ms 2648 KB Output is correct
7 Correct 35 ms 2804 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 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 25 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 Correct 130 ms 5136 KB Output is correct
21 Correct 123 ms 6496 KB Output is correct
22 Correct 145 ms 6488 KB Output is correct
23 Correct 121 ms 7000 KB Output is correct
24 Correct 110 ms 6736 KB Output is correct
25 Correct 128 ms 6680 KB Output is correct
26 Correct 128 ms 6740 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 464 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 464 KB Output is correct
45 Correct 1 ms 464 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 190 ms 9112 KB Output is correct
48 Correct 169 ms 8584 KB Output is correct
49 Correct 175 ms 8396 KB Output is correct
50 Correct 157 ms 9044 KB Output is correct
51 Correct 170 ms 9108 KB Output is correct
52 Correct 188 ms 9156 KB Output is correct
53 Correct 191 ms 9552 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 348 ms 11552 KB Output is correct
60 Incorrect 550 ms 7760 KB Output isn't correct
61 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 464 KB Output is correct
5 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -