oj.uz

답안 #1088578

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1088578 2024-09-14T15:44:31 Z Bananabread Council (JOI23_council) C++17
40 / 100
 4000 ms 14420 KB 
#include<bits/stdc++.h>
#define ll long long
#define ntr "\n"
#define mod (ll)(1e9+7)
#define taskname "temp"
#define frep freopen(taskname".inp","r",stdin); freopen(taskname".out","w",stdout);
using namespace std;
ll pref[100];
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];
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=0;i<(1<<m);i++){
        if(!cnt[i]) continue;
        ll mask=flip(i);
        for (int nextmask = mask; nextmask ; nextmask=(nextmask-1)&mask){
            super[nextmask]+=cnt[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;
       // cout<<optmask<<ntr;
        for(int nextmask=ZERO;nextmask;nextmask=(nextmask-1)&ZERO){
            if(super[nextmask]>((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;
    }
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 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 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 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 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 33 ms 4372 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 26 ms 3792 KB Output is correct
5 Correct 35 ms 4436 KB Output is correct
6 Correct 25 ms 3920 KB Output is correct
7 Correct 37 ms 4432 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 464 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 372 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 14 ms 348 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 33 ms 4372 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 26 ms 3792 KB Output is correct
5 Correct 35 ms 4436 KB Output is correct
6 Correct 25 ms 3920 KB Output is correct
7 Correct 37 ms 4432 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 464 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 372 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 14 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 126 ms 9044 KB Output is correct
21 Correct 112 ms 8632 KB Output is correct
22 Correct 118 ms 8528 KB Output is correct
23 Correct 114 ms 9548 KB Output is correct
24 Correct 110 ms 9040 KB Output is correct
25 Correct 132 ms 9040 KB Output is correct
26 Correct 129 ms 9244 KB Output is correct
27 Correct 0 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 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 0 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 0 ms 348 KB Output is correct
42 Correct 0 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 2 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 33 ms 4372 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 26 ms 3792 KB Output is correct
5 Correct 35 ms 4436 KB Output is correct
6 Correct 25 ms 3920 KB Output is correct
7 Correct 37 ms 4432 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 464 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 372 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 14 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 126 ms 9044 KB Output is correct
21 Correct 112 ms 8632 KB Output is correct
22 Correct 118 ms 8528 KB Output is correct
23 Correct 114 ms 9548 KB Output is correct
24 Correct 110 ms 9040 KB Output is correct
25 Correct 132 ms 9040 KB Output is correct
26 Correct 129 ms 9244 KB Output is correct
27 Correct 0 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 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 0 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 0 ms 348 KB Output is correct
42 Correct 0 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 2 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 175 ms 11980 KB Output is correct
48 Correct 186 ms 11020 KB Output is correct
49 Correct 164 ms 11348 KB Output is correct
50 Correct 159 ms 11856 KB Output is correct
51 Correct 174 ms 11532 KB Output is correct
52 Correct 178 ms 11860 KB Output is correct
53 Correct 311 ms 12112 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 33 ms 4372 KB Output is correct
3 Correct 32 ms 4432 KB Output is correct
4 Correct 26 ms 3792 KB Output is correct
5 Correct 35 ms 4436 KB Output is correct
6 Correct 25 ms 3920 KB Output is correct
7 Correct 37 ms 4432 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 464 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 372 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 14 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 126 ms 9044 KB Output is correct
21 Correct 112 ms 8632 KB Output is correct
22 Correct 118 ms 8528 KB Output is correct
23 Correct 114 ms 9548 KB Output is correct
24 Correct 110 ms 9040 KB Output is correct
25 Correct 132 ms 9040 KB Output is correct
26 Correct 129 ms 9244 KB Output is correct
27 Correct 0 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 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 464 KB Output is correct
34 Correct 0 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 0 ms 348 KB Output is correct
42 Correct 0 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 2 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 175 ms 11980 KB Output is correct
48 Correct 186 ms 11020 KB Output is correct
49 Correct 164 ms 11348 KB Output is correct
50 Correct 159 ms 11856 KB Output is correct
51 Correct 174 ms 11532 KB Output is correct
52 Correct 178 ms 11860 KB Output is correct
53 Correct 311 ms 12112 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 200 ms 14420 KB Output is correct
60 Execution timed out 4035 ms 7044 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 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 Runtime error 1 ms 604 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -