oj.uz

Submission #1086989

# Submission time Handle Problem Language Result Execution time Memory
1086989 2024-09-12T02:19:50 Z Bananabread Council (JOI23_council) C++17
22 / 100
 123 ms 9296 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;
}
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=(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:60:15: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   60 |         if(i&1==0) super[i][0]+=cnt[i^1];
      |              ~^~~
council.cpp:63:24: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   63 |             if(i&(1<<j)==0) super[i][j]+=super[i^(1<<j)][j-1];
      |                  ~~~~~~^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1628 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 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 464 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 344 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 1 ms 348 KB Output is correct
41 Correct 1 ms 516 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 604 KB Output is correct
45 Correct 1 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 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1628 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 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 464 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 344 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 1 ms 348 KB Output is correct
41 Correct 1 ms 516 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 604 KB Output is correct
45 Correct 1 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 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 119 ms 600 KB Output is correct
52 Correct 119 ms 600 KB Output is correct
53 Correct 122 ms 6904 KB Output is correct
54 Correct 123 ms 6748 KB Output is correct
55 Correct 14 ms 348 KB Output is correct
56 Correct 97 ms 1616 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 36 ms 4420 KB Output is correct
3 Correct 31 ms 4468 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 41 ms 4436 KB Output is correct
6 Correct 25 ms 3928 KB Output is correct
7 Correct 35 ms 4496 KB Output is correct
8 Correct 1 ms 444 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 1 ms 348 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 464 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 15 ms 552 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 36 ms 4420 KB Output is correct
3 Correct 31 ms 4468 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 41 ms 4436 KB Output is correct
6 Correct 25 ms 3928 KB Output is correct
7 Correct 35 ms 4496 KB Output is correct
8 Correct 1 ms 444 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 1 ms 348 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 464 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 15 ms 552 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 464 KB Output is correct
20 Correct 119 ms 9296 KB Output is correct
21 Incorrect 109 ms 8680 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 36 ms 4420 KB Output is correct
3 Correct 31 ms 4468 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 41 ms 4436 KB Output is correct
6 Correct 25 ms 3928 KB Output is correct
7 Correct 35 ms 4496 KB Output is correct
8 Correct 1 ms 444 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 1 ms 348 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 464 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 15 ms 552 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 464 KB Output is correct
20 Correct 119 ms 9296 KB Output is correct
21 Incorrect 109 ms 8680 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 36 ms 4420 KB Output is correct
3 Correct 31 ms 4468 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 41 ms 4436 KB Output is correct
6 Correct 25 ms 3928 KB Output is correct
7 Correct 35 ms 4496 KB Output is correct
8 Correct 1 ms 444 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 1 ms 348 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 464 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 15 ms 552 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 464 KB Output is correct
20 Correct 119 ms 9296 KB Output is correct
21 Incorrect 109 ms 8680 KB Output isn't correct
22 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 1 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 1 ms 348 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1628 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 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 464 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 344 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 1 ms 348 KB Output is correct
41 Correct 1 ms 516 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 604 KB Output is correct
45 Correct 1 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 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 119 ms 600 KB Output is correct
52 Correct 119 ms 600 KB Output is correct
53 Correct 122 ms 6904 KB Output is correct
54 Correct 123 ms 6748 KB Output is correct
55 Correct 14 ms 348 KB Output is correct
56 Correct 97 ms 1616 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 36 ms 4420 KB Output is correct
59 Correct 31 ms 4468 KB Output is correct
60 Correct 25 ms 3924 KB Output is correct
61 Correct 41 ms 4436 KB Output is correct
62 Correct 25 ms 3928 KB Output is correct
63 Correct 35 ms 4496 KB Output is correct
64 Correct 1 ms 444 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 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 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 1 ms 464 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 15 ms 552 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 464 KB Output is correct
76 Correct 119 ms 9296 KB Output is correct
77 Incorrect 109 ms 8680 KB Output isn't correct
78 Halted 0 ms 0 KB -