oj.uz

Submission #1086625

# Submission time Handle Problem Language Result Execution time Memory
1086625 2024-09-11T07:19:13 Z Bananabread Council (JOI23_council) C++17
40 / 100
 4000 ms 59000 KB 
#include<bits/stdc++.h>
#define ll long long
#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[300001];
ll arr[300001][20];
ll ans[300001];
ll cnt[1<<17]={};
ll best[1<<17]={};
ll n,m;
ll one,two,zero;
ll super[1<<17];
void sub2(){
    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]-arr[i][u]-arr[j][u];
                if(c>n/2-1) cnt++;
            }
            ans[i]=max(ans[i],cnt);
            ans[j]=max(ans[j],cnt);
        }
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<ntr;
    }
}
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++){
        ll mask=0;
        for(int j=0;j<m;j++){
            cin>>arr[i][j];
            pref[j]+=arr[i][j];
            mask|=(arr[i][j]<<j);
        }
        cnt[mask]++;
    }
    if(n<=3000){
        sub2();
        return 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);
    }
    //cout<<two<<' '<<one<<' '<<zero<<ntr;
    for(int i=0;i<(1<<m);i++){
        if(!cnt[i]) continue;
        ll mask=(((1<<m)-1) & ~i);
        for (int nextmask = mask; nextmask ; nextmask=(nextmask-1)&mask){
            super[nextmask]+=cnt[i];
        }
    }
//    for(int i=0;i<(1<<m);i++){
//        cout<<super[i]<<' ';
//    }
//    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 cmask=(((1<<m)-1) & ~mask);
        for(int nextmask=cmask ; nextmask ; nextmask=(nextmask-1)&cmask){
            super[nextmask]--;
        }
        for(int nextmask=ZERO ; nextmask ; nextmask=(nextmask-1)&ZERO){
            //cout<<nextmask<<' ';
            if(super[nextmask]){
                best[mask]=max(best[mask],(ll)__builtin_popcount(ONE|(ZERO&nextmask)));
            }
        }
        //cout<<ntr;
        best[mask]=max(best[mask],(ll)__builtin_popcount(ONE));
        for(int nextmask=cmask ; nextmask ; nextmask=(nextmask-1)&cmask){
            super[nextmask]++;
        }
        cnt[mask]++;
    }
    for(int i=1;i<=n;i++){
        ll mask=0;
        for(int j=0;j<m;j++){
            mask+=(arr[i][j]<<j);
        }
        cout<<best[mask]<<ntr;
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 344 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 1 ms 348 KB Output is correct
9 Incorrect 2 ms 1628 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 344 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 1 ms 348 KB Output is correct
9 Incorrect 2 ms 1628 KB Output isn't correct
10 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 48 ms 48976 KB Output is correct
3 Correct 55 ms 48976 KB Output is correct
4 Correct 45 ms 48464 KB Output is correct
5 Correct 51 ms 48976 KB Output is correct
6 Correct 43 ms 48464 KB Output is correct
7 Correct 52 ms 48976 KB Output is correct
8 Correct 0 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 464 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 1008 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 48 ms 48976 KB Output is correct
3 Correct 55 ms 48976 KB Output is correct
4 Correct 45 ms 48464 KB Output is correct
5 Correct 51 ms 48976 KB Output is correct
6 Correct 43 ms 48464 KB Output is correct
7 Correct 52 ms 48976 KB Output is correct
8 Correct 0 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 464 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 1008 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 141 ms 53756 KB Output is correct
21 Correct 147 ms 53116 KB Output is correct
22 Correct 126 ms 53072 KB Output is correct
23 Correct 130 ms 54076 KB Output is correct
24 Correct 127 ms 53840 KB Output is correct
25 Correct 138 ms 53836 KB Output is correct
26 Correct 143 ms 53844 KB Output is correct
27 Correct 0 ms 344 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 344 KB Output is correct
35 Correct 0 ms 464 KB Output is correct
36 Correct 1 ms 468 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 0 ms 348 KB Output is correct
42 Correct 0 ms 360 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 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 48 ms 48976 KB Output is correct
3 Correct 55 ms 48976 KB Output is correct
4 Correct 45 ms 48464 KB Output is correct
5 Correct 51 ms 48976 KB Output is correct
6 Correct 43 ms 48464 KB Output is correct
7 Correct 52 ms 48976 KB Output is correct
8 Correct 0 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 464 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 1008 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 141 ms 53756 KB Output is correct
21 Correct 147 ms 53116 KB Output is correct
22 Correct 126 ms 53072 KB Output is correct
23 Correct 130 ms 54076 KB Output is correct
24 Correct 127 ms 53840 KB Output is correct
25 Correct 138 ms 53836 KB Output is correct
26 Correct 143 ms 53844 KB Output is correct
27 Correct 0 ms 344 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 344 KB Output is correct
35 Correct 0 ms 464 KB Output is correct
36 Correct 1 ms 468 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 0 ms 348 KB Output is correct
42 Correct 0 ms 360 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 202 ms 56372 KB Output is correct
48 Correct 172 ms 55644 KB Output is correct
49 Correct 190 ms 55816 KB Output is correct
50 Correct 168 ms 56404 KB Output is correct
51 Correct 164 ms 56272 KB Output is correct
52 Correct 190 ms 56404 KB Output is correct
53 Correct 337 ms 56660 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 344 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 1 ms 348 KB Output is correct
2 Correct 48 ms 48976 KB Output is correct
3 Correct 55 ms 48976 KB Output is correct
4 Correct 45 ms 48464 KB Output is correct
5 Correct 51 ms 48976 KB Output is correct
6 Correct 43 ms 48464 KB Output is correct
7 Correct 52 ms 48976 KB Output is correct
8 Correct 0 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 464 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 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 13 ms 1008 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 141 ms 53756 KB Output is correct
21 Correct 147 ms 53116 KB Output is correct
22 Correct 126 ms 53072 KB Output is correct
23 Correct 130 ms 54076 KB Output is correct
24 Correct 127 ms 53840 KB Output is correct
25 Correct 138 ms 53836 KB Output is correct
26 Correct 143 ms 53844 KB Output is correct
27 Correct 0 ms 344 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 344 KB Output is correct
35 Correct 0 ms 464 KB Output is correct
36 Correct 1 ms 468 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 0 ms 348 KB Output is correct
42 Correct 0 ms 360 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 202 ms 56372 KB Output is correct
48 Correct 172 ms 55644 KB Output is correct
49 Correct 190 ms 55816 KB Output is correct
50 Correct 168 ms 56404 KB Output is correct
51 Correct 164 ms 56272 KB Output is correct
52 Correct 190 ms 56404 KB Output is correct
53 Correct 337 ms 56660 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 229 ms 59000 KB Output is correct
60 Execution timed out 4030 ms 24376 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 344 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 1 ms 348 KB Output is correct
9 Incorrect 2 ms 1628 KB Output isn't correct
10 Halted 0 ms 0 KB -