Submission #1309756

#	Time	Username	Problem	Language	Result	Execution time	Memory
1309756		thelegendary08	Council (JOI23_council)	C++17	100 / 100	1193 ms	531092 KiB

council

#include<bits/stdc++.h>
// #include<atcoder/modint>
// #include<atcoder/convolution>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define rs resize
#define ft front()
#define bk back()
#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 r0f(i,n) for(int i = n-1; i >= 0; i--)
#define R0F(i,k,n) for(int i = n-1; i >= k; i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define SUM(v) (accumulate(all(v), 0LL))
#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 pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<endl
#define dout(a) cout<<a<<' '<<#a<<endl
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl
#define YN(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
#define yn(x); if(x){cout<<"Yes"<<'\n';}else{cout<<"No"<<'\n';}
#define p2(x) (1LL << (x))
#define pct(x) (__builtin_popcountll((x)))
#define ist(x,y) (((x) >> (y)) & 1)
template<class T, class U> bool ckmin(T& a, const U& b) { return (T)b < a ? a = (T)b, 1 : 0; } 
template<class T, class U> bool ckmax(T& a, const U& b) { return a < (T)b ? a = (T)b, 1 : 0; } 
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
// using namespace atcoder; 
// using mint = modint998244353;
// using mint = modint1000000007;
const int mxn = 5e5 + 5; 
// mint fact[mxn], inv[mxn];
// mint C(int n, int r){return fact[n] * inv[n-r] * inv[r];}
// mint snb(int n, int r){return C(n + r, n);}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	// fact[0]=1;FOR(i,1,mxn)fact[i]=fact[i-1]*i;inv[mxn-1]=fact[mxn-1].inv();r0f(i,mxn-1)inv[i]=inv[i+1]*(i+1);
	in2(n,m); vi v(n), w(n); f0r(i,n){
		f0r(j,m){in(x); v[i]+=p2(j) * x, w[i]+=p2(j)*(x^1);}
	} vvi full(p2(m)); f0r(i,n)if(full[w[i]].size()<2)full[w[i]].pb(i);
	f0r(i,m){
		f0r(j,p2(m))if(ist(j,i)){
			for(auto u : full[j])if(full[j^p2(i)].size()<2)full[j^p2(i)].pb(u);
		}
	}
	vector<vpii>dp(p2(m)); dp[0].eb(0,0), dp[0].eb(0,1); FOR(i,1,p2(m)){
		if(full[i].size()==2)dp[i].eb(pct(i),full[i][0]), dp[i].eb(pct(i),full[i][1]);
		else{
			if(full[i].size()==1)dp[i].eb(pct(i),full[i][0]); f0r(j,m)if(ist(i,j))for(auto u : dp[i^p2(j)])dp[i].pb(u);
			sort(rall(dp[i])); pii fi = dp[i][0]; pii se; FOR(j,1,dp[i].size()){if(dp[i][j].S != fi.S){se = dp[i][j]; break;}}
			dp[i].clear(); dp[i].pb(fi); dp[i].pb(se);
		}
	}
	vi cnt(m); f0r(i,n)f0r(j,m)if(ist(v[i],j))cnt[j]++;
	f0r(i,n){
		f0r(j,m)if(ist(v[i],j))cnt[j]--;
		int ans = 0, msk = 0; f0r(j,m)if(cnt[j] > n/2)ans++; else if(cnt[j] == n/2)msk |= p2(j);
		if(dp[msk][0].S != i)out(ans+dp[msk][0].F);
		else out(ans+dp[msk][1].F);
		f0r(j,m)if(ist(v[i],j))cnt[j]++;
	} 
}

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