Submission #889655

#	Time	Username	Problem	Language	Result	Execution time	Memory
889655		vjudge1	Council (JOI23_council)	C++17	8 / 100	113 ms	39768 KiB

council

#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define bc back()
#define ar array
#define vll vector<ll> 
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <class _T>
bool chmin(_T &x, const _T &y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag=false;
    if (x<y){
        x=y;flag|=true;
    }
    return flag;
}
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=2e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
ll a[N][23];
ll b[N];
ll mp[N];
void solve(){
	ll i,j,q;
	ll n,m;
	cin>>n>>m;
	ll cnt[m+5],sum=0;
	memset(cnt,0ll,sizeof(cnt));
	for(i=1;i<=n;i++){
		for(j=1;j<=m;j++){
			cin>>a[i][j];
			if(a[i][j]){
				cnt[j]++;
				b[i]+=(1ll<<(j-1));
			}
		}
		mp[b[i]]++;
	}
	for(j=1;j<=m;j++)if(cnt[j]>=n/2)sum++;
	ll ans[n+5];
	memset(ans,0ll,sizeof(ans));
	if(n<=3000){
		for(i=1;i<=n;i++){
			for(j=i+1;j<=n;j++){
				ll x=sum;
				for(q=1;q<=m;q++){
					ll c=0;
					if(a[i][q])c++;
					if(a[j][q])c++;
					if(cnt[q]>=n/2 && cnt[q]-c<n/2)x--;
				}
				chmax(ans[i],x);
				chmax(ans[j],x);
			}
		}
		for(i=1;i<=n;i++){
			cout<<ans[i]<<endl;
		}
		return;
	}
	for(i=1;i<=n;i++){
		ll f=0,c=0;
		for(j=1;j<=m;j++){
			if(a[i][j] && cnt[j]-1==n/2)f+=(1ll<<(j-1));
			else if(!a[i][j] && cnt[j]==n/2)f+=(1ll<<(j-1));
			if(a[i][j] && cnt[j]-1>=n/2)c++;
			else if(!a[i][j] && cnt[j]>=n/2)c++;
		}
		mp[b[i]]--;
		ll mn=25;
		for(ll mask=0;mask<(1ll<<m);mask++){
			if(mp[mask]==0)continue;
			mn=min(mn,(ll)__builtin_popcount(mask&f));
		}
		mp[b[i]]++;
		cout<<c-mn<<endl;
	}
}
signed main(){
	start();
    ll t=1;
	//cin>>t;
    while(t--) solve();
    return 0;
}
/*
1
6
5 4 3 2 1 0





*/

Compilation message (stderr)

council.cpp: In function 'void fre(std::string)':
council.cpp:42:27: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                    ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:42:64: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 | void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 0 / 8
• Subtask 3: 0 / 6
• Subtask 4: 0 / 19
• Subtask 5: 0 / 15
• Subtask 6: 0 / 22
• Subtask 7: 0 / 22