제출 #1223621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1223621		ByeWorld	Council (JOI23_council)	C++20	0 / 100	4094 ms	27432 KiB

council

#include <bits/stdc++.h>
// #pragma GCC optimize("O3")
// #define int long long
#define ll long long
#define se second
#define fi first
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define POP __builtin_popcount
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
const int MAXN = 3e5+10;
const int MAXA = 2e6+10;
const int SQRT = 450;
const int INF = 1e9;
const int MOD = 1e9+7;
const int LOG = 20;
int sum(int a, int b){ a%=MOD; b%=MOD; return (a+MOD+b)%MOD; }
void chsum(int &a, int b){ a%=MOD; b%=MOD; a = (a+MOD+b)%MOD; }
int mul(int a, int b){ return (a*b)%MOD; }
int expo(int a, int b){
	if(b==0) return 1;
	int te = expo(a, b/2); te = mul(te,te);
	return (b%2 ? mul(te,a) : te);
}
void chmul(int &a, int b){ a = (a*b)%MOD; }
void chmn(auto &a, auto b){ a = min(a, b); }
void chmx(auto &a, auto b){ a = max(a, b); }

int n, m, a[MAXN][23], cnt[23];
int dp[MAXA];

void solve(int p){

	set <int> s;
	for(int i=1; i<=n; i++){
		if(i==p) continue;
		int te = 0;
		for(int j=0; j<m; j++) te += (a[i][j]<<j); 
		s.insert(((1<<m)-1) ^ te);
	}
	for(int i=0; i<(1<<m); i++) dp[i] = INF;
	dp[0] = 0;
	for(auto in : s){
		// if(p==3)cout << in << " in\n";
		for(int j=in; j>0; j=in&(j-1)) dp[j] = 0;
	}
	for(int i=1; i<(1<<m); i++){
		for(int j=i; j>0; j=i&(j-1)) 
			chmn(dp[i], dp[j]+POP(i^j));
		chmn(dp[i], dp[0]+POP(i));
	}
}
signed main(){
	// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1; i<=n; i++)
		for(int j=0; j<m; j++) cin>>a[i][j];


	int need = n/2;

	for(int i=1; i<=n; i++){
		for(int j=0; j<m; j++) cnt[j] += a[i][j];
	}
	for(int i=1; i<=n; i++){
		for(int j=0; j<m; j++) cnt[j] -= a[i][j];
			solve(i);

		int imp = 0, aman = 0;
		for(int j=0; j<m; j++){
			if(cnt[j] == need){
				imp += (1<<j);
				// if(i==3) cout << j <<  "j\n";
			} else if(cnt[j] > need) aman++;
		}

		cout << aman+POP(imp)-dp[imp] << '\n';

		for(int j=0; j<m; j++) cnt[j] += a[i][j];
	}
}

• Subtask 1: 0 / 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