Submission #1173468

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173468		thelegendary08	Council (JOI23_council)	C++17	25 / 100	4096 ms	49280 KiB

council

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,m);
	vvi v(n, vi(m));
	f0r(i,n){
		f0r(j,m)cin>>v[i][j];
	}
	vi w(m);
	f0r(i,m){
		int cnt = 0;
		f0r(j,n)cnt += v[j][i];
		w[i] = cnt;
	}
	vi cnt(16384);
	vi nums;
	f0r(i,n){
		int num = 0;
		f0r(j,m){
			num += (1 << j) * v[i][j];
		}
		cnt[num]++;
		nums.pb(num);
	}
	// vout(nums);
	// vout(cnt);
	
	vi ans(16384);
	f0r(i, 16384){
		if(cnt[i] > 0){
			vi cur(m);
			f0r(j,m)cur[j] = w[j];
			f0r(j, m){
				if((1<<j) & i){
					cur[j]--;
				}
			}
			int curans = 0;
			
			f0r(j, 16384){
				int ct = 0;
				if(j == i){
					if(cnt[j] >= 2){
						f0r(k,m){
							if((1<<k) & j){
								cur[k]--;
							}
						}
						f0r(k,m){
							if(cur[k] >= n/2)ct++;
						}
						ans[i] = max(ans[i], ct);
						f0r(k,m){
							if((1<<k) & j){
								cur[k]++;
							}
						}
						
					}
				}
				else{
					if(cnt[j] >= 1){
						f0r(k,m){
							if((1<<k) & j){
								cur[k]--;
							}
						}
						f0r(k,m){
							if(cur[k] >= n/2)ct++;
						}
						ans[i] = max(ans[i], ct);
						f0r(k,m){
							if((1<<k) & j){
								cur[k]++;
							}
						}
					}
				}
			}
		
		}
		
	}
	
	
	f0r(i,n){
		out(ans[nums[i]]);
	}
	
}

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