Submission #1086995

# Submission time Handle Problem Language Result Execution time Memory
1086995 2024-09-12T02:36:03 Z Bananabread Council (JOI23_council) C++17
22 / 100
130 ms 6748 KB
#include<bits/stdc++.h>
#define ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen("01-05.inp","r",stdin); //freopen(taskname".out","w",stdout);
using namespace std;
ll pref[100];
ll arr[300001];
ll ans[300001];
ll cnt[1<<20];
ll best[1<<20];
ll n,m;
ll one,two,zero;
ll super[1<<20][20];
bool ison(ll x,ll i){
    return (x>>i)&1;
}
ll flip(ll x){
    return ((1<<m)-1)&~x;
}
void sub2(){
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            ans[i]=max(ans[i],(ll)__builtin_popcount((two | (one & ~arr[i]) | (~arr[j] &(one | (zero & ~arr[i]))))));
            ans[j]=max(ans[j],(ll)__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=(1<<m);i>=0;i--){
        super[i][0]=cnt[i];
        if(i&1==0) super[i][0]+=cnt[i^1];
        for(int j=1;j<20;j++){
            super[i][j]+=super[i][j-1];
            if(i&(1<<j)==0) super[i][j]+=super[i^(1<<j)][j-1];
        }
    }
    //cout<<ntr;
    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);
        }
       // cout<<optmask<<ntr;
        for(int nextmask=optmask;nextmask;nextmask=(nextmask-1)&optmask){
            if(super[nextmask][19]>((nextmask&mask)==0))
                best[mask]=max(best[mask],(ll)__builtin_popcount(ONE|(ZERO&nextmask)));
        }
//        cout<<ntr<<ntr;
        best[mask]=max(best[mask],(ll)__builtin_popcount(ONE));
        cnt[mask]++;
    }
    for(int i=1;i<=n;i++){
        cout<<best[arr[i]]<<ntr;
    }
}

Compilation message

council.cpp: In function 'int main()':
council.cpp:58:15: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   58 |         if(i&1==0) super[i][0]+=cnt[i^1];
      |              ~^~~
council.cpp:61:24: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   61 |             if(i&(1<<j)==0) super[i][j]+=super[i^(1<<j)][j-1];
      |                  ~~~~~~^~~
# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 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 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 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 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 25 ms 344 KB Output is correct
52 Correct 25 ms 348 KB Output is correct
53 Correct 31 ms 6748 KB Output is correct
54 Correct 29 ms 6744 KB Output is correct
55 Correct 23 ms 348 KB Output is correct
56 Correct 28 ms 1372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 34 ms 3404 KB Output is correct
3 Correct 43 ms 4076 KB Output is correct
4 Correct 25 ms 3920 KB Output is correct
5 Correct 40 ms 4036 KB Output is correct
6 Correct 27 ms 3892 KB Output is correct
7 Correct 35 ms 4176 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 24 ms 552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 34 ms 3404 KB Output is correct
3 Correct 43 ms 4076 KB Output is correct
4 Correct 25 ms 3920 KB Output is correct
5 Correct 40 ms 4036 KB Output is correct
6 Correct 27 ms 3892 KB Output is correct
7 Correct 35 ms 4176 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 24 ms 552 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 130 ms 6456 KB Output is correct
21 Incorrect 116 ms 6236 KB Output isn't correct
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 34 ms 3404 KB Output is correct
3 Correct 43 ms 4076 KB Output is correct
4 Correct 25 ms 3920 KB Output is correct
5 Correct 40 ms 4036 KB Output is correct
6 Correct 27 ms 3892 KB Output is correct
7 Correct 35 ms 4176 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 24 ms 552 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 130 ms 6456 KB Output is correct
21 Incorrect 116 ms 6236 KB Output isn't correct
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 34 ms 3404 KB Output is correct
3 Correct 43 ms 4076 KB Output is correct
4 Correct 25 ms 3920 KB Output is correct
5 Correct 40 ms 4036 KB Output is correct
6 Correct 27 ms 3892 KB Output is correct
7 Correct 35 ms 4176 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 468 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 24 ms 552 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 130 ms 6456 KB Output is correct
21 Incorrect 116 ms 6236 KB Output isn't correct
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 1372 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 1368 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 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 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 25 ms 344 KB Output is correct
52 Correct 25 ms 348 KB Output is correct
53 Correct 31 ms 6748 KB Output is correct
54 Correct 29 ms 6744 KB Output is correct
55 Correct 23 ms 348 KB Output is correct
56 Correct 28 ms 1372 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 34 ms 3404 KB Output is correct
59 Correct 43 ms 4076 KB Output is correct
60 Correct 25 ms 3920 KB Output is correct
61 Correct 40 ms 4036 KB Output is correct
62 Correct 27 ms 3892 KB Output is correct
63 Correct 35 ms 4176 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 468 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 600 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 24 ms 552 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 130 ms 6456 KB Output is correct
77 Incorrect 116 ms 6236 KB Output isn't correct
78 Halted 0 ms 0 KB -