This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 arrmask[300001];
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);
}
arrmask[i]=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++){
cout<<best[arrmask[i]]<<ntr;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |