oj.uz

Submission #1087010

# Submission time Handle Problem Language Result Execution time Memory
1087010 2024-09-12T03:38:00 Z Bananabread Council (JOI23_council) C++17
62 / 100
 721 ms 35156 KB 
#include<bits/stdc++.h>
#define ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen("03-06.inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll pref[100];
ll arr[300001];
ll ans[300001];
ll best[1<<20];
ll n,m;
ll one,two,zero;
ll super[1<<20][20];
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);
        }
        super[flip(arr[i])][0]++;
    }
    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--){
        if(i%2==0) super[i][0]+=super[i^1][0];
        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(!super[flip(mask)][0]) continue;
        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));
    }
    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 1 ms 1116 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Runtime error 4 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 1 ms 1116 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Runtime error 4 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 41 ms 4440 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 35 ms 4452 KB Output is correct
6 Correct 27 ms 3920 KB Output is correct
7 Correct 37 ms 4444 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 1 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 512 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 41 ms 4440 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 35 ms 4452 KB Output is correct
6 Correct 27 ms 3920 KB Output is correct
7 Correct 37 ms 4444 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 1 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 121 ms 9296 KB Output is correct
21 Correct 116 ms 8788 KB Output is correct
22 Correct 109 ms 8684 KB Output is correct
23 Correct 118 ms 9732 KB Output is correct
24 Correct 105 ms 9300 KB Output is correct
25 Correct 122 ms 9356 KB Output is correct
26 Correct 135 ms 9296 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 464 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 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 1 ms 604 KB Output is correct
45 Correct 1 ms 600 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 41 ms 4440 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 35 ms 4452 KB Output is correct
6 Correct 27 ms 3920 KB Output is correct
7 Correct 37 ms 4444 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 1 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 121 ms 9296 KB Output is correct
21 Correct 116 ms 8788 KB Output is correct
22 Correct 109 ms 8684 KB Output is correct
23 Correct 118 ms 9732 KB Output is correct
24 Correct 105 ms 9300 KB Output is correct
25 Correct 122 ms 9356 KB Output is correct
26 Correct 135 ms 9296 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 464 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 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 1 ms 604 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 174 ms 14244 KB Output is correct
48 Correct 167 ms 12372 KB Output is correct
49 Correct 153 ms 12280 KB Output is correct
50 Correct 159 ms 14420 KB Output is correct
51 Correct 149 ms 14160 KB Output is correct
52 Correct 174 ms 14180 KB Output is correct
53 Correct 186 ms 14580 KB Output is correct
54 Correct 4 ms 2904 KB Output is correct
55 Correct 3 ms 2968 KB Output is correct
56 Correct 3 ms 3108 KB Output is correct
57 Correct 3 ms 2908 KB Output is correct
58 Correct 3 ms 2908 KB Output is correct

Subtask #6
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 41 ms 4440 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 25 ms 3924 KB Output is correct
5 Correct 35 ms 4452 KB Output is correct
6 Correct 27 ms 3920 KB Output is correct
7 Correct 37 ms 4444 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 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 1 ms 460 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 432 KB Output is correct
20 Correct 121 ms 9296 KB Output is correct
21 Correct 116 ms 8788 KB Output is correct
22 Correct 109 ms 8684 KB Output is correct
23 Correct 118 ms 9732 KB Output is correct
24 Correct 105 ms 9300 KB Output is correct
25 Correct 122 ms 9356 KB Output is correct
26 Correct 135 ms 9296 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 464 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 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 1 ms 604 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 2 ms 1116 KB Output is correct
47 Correct 174 ms 14244 KB Output is correct
48 Correct 167 ms 12372 KB Output is correct
49 Correct 153 ms 12280 KB Output is correct
50 Correct 159 ms 14420 KB Output is correct
51 Correct 149 ms 14160 KB Output is correct
52 Correct 174 ms 14180 KB Output is correct
53 Correct 186 ms 14580 KB Output is correct
54 Correct 4 ms 2904 KB Output is correct
55 Correct 3 ms 2968 KB Output is correct
56 Correct 3 ms 3108 KB Output is correct
57 Correct 3 ms 2908 KB Output is correct
58 Correct 3 ms 2908 KB Output is correct
59 Correct 203 ms 23696 KB Output is correct
60 Correct 510 ms 26936 KB Output is correct
61 Correct 559 ms 27476 KB Output is correct
62 Correct 590 ms 27472 KB Output is correct
63 Correct 231 ms 23452 KB Output is correct
64 Correct 274 ms 34896 KB Output is correct
65 Correct 288 ms 34900 KB Output is correct
66 Correct 207 ms 34128 KB Output is correct
67 Correct 193 ms 33872 KB Output is correct
68 Correct 259 ms 34900 KB Output is correct
69 Correct 721 ms 35156 KB Output is correct
70 Correct 23 ms 21084 KB Output is correct
71 Correct 20 ms 20984 KB Output is correct
72 Correct 19 ms 21080 KB Output is correct
73 Correct 19 ms 21080 KB Output is correct
74 Correct 19 ms 21084 KB Output is correct
75 Correct 37 ms 22096 KB Output is correct

Subtask #7
0 / 22.0

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