Submission #889678

#	Time	Username	Problem	Language	Result	Execution time	Memory
889678		vjudge1	Council (JOI23_council)	C++17	22 / 100	4080 ms	30948 KiB

council

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
#define pii pair<int,int>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define f first
#define s second
#define pii pair<int,int>
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update> ordered_set;
const int mod= 1e9 +7;
const int N=1e5*4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){
	int n,m,k;
	
	cin>>n>>m;
	int arr[n+1][m+1];
	vector<int>vis(m+1);
	map<int,int>mp;
	for(int i = 1;i<=n;i++){
		int sum = 0;
		for(int j = 1;j<=m;j++){
			cin>>arr[i][j];
			if(arr[i][j]){
				vis[j]+=1;
				sum += (1<<(j-1));
			}
		}
		mp[sum]++;
	}
	if(n<=3000){
		for(int i = 1;i<=n;i++){
			int mx = 0;
			vector<int>vis1(m+1);
			for(int j = 1;j<=m;j++){
				if(arr[i][j])
					vis1[j]++;
			}
			
			for(int j = 1;j<=n;j++){
				if(j==i)continue;
				vector<int>vis2(m+1);
				int cnt = 0 ;
				for(int k = 1;k<=m;k++){
					if(arr[j][k])vis2[k]++;
				}
				for(int k = 1;k<=m;k++){
					if((vis[k]-vis1[k]-vis2[k])>((n-2)/2))cnt++;
					//cout<<vis[k]-vis1[k]-vis2[k]<<" ";
				}
				//cout<<"\n";
				umax(mx,cnt);
			}
			cout<<mx<<"\n";
		}
	}
	else{
		if(m>=11){
			cout<<-1<<endl;
			return;
		}
		
		for(int i = 1;i<=n;i++){
			int sum = 0,val;
			for(int j = 1;j<=m;j++)
				if(arr[i][j]){
					vis[j]--;
					val += (1<<(j-1));
				}
			mp[val]--;
			int mx = 0;
			for(int mask = 0;mask<(1<<m);mask++){
				if(mp[mask]<=0)continue;
				int cnt = 0;
				for(int j = 0;j<m;j++)
					if(((mask>>j)&1)==1)vis[j+1]--;
				
				for(int j = 1;j<=m;j++)
					if(vis[j]>((n-2)/2))cnt++;
				umax(mx,cnt);
				//---------
				for(int j = 0;j<m;j++)
					if(((mask>>j)&1)==1)vis[j+1]++;
			}
			cout<<mx<<"\n";
			mp[val]++;
			for(int j = 1;j<=m;j++)
				if(arr[i][j])
					vis[j]++;
		}
		
		
	}








}

 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int cnt=0;
	int tt=1;//cin>>tt;
	while(tt--)solve();

}

Compilation message (stderr)

council.cpp: In function 'void solve()':
council.cpp:85:8: warning: unused variable 'sum' [-Wunused-variable]
   85 |    int sum = 0,val;
      |        ^~~
council.cpp:35:10: warning: unused variable 'k' [-Wunused-variable]
   35 |  int n,m,k;
      |          ^
council.cpp: In function 'int main()':
council.cpp:130:6: warning: unused variable 'cnt' [-Wunused-variable]
  130 |  int cnt=0;
      |      ^~~

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