oj.uz

Submission #1005843

# Submission time Handle Problem Language Result Execution time Memory
1005843 2024-06-23T07:00:24 Z pcc Council (JOI23_council) C++17
0 / 100
 32 ms 13172 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,popcnt,sse4")
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


const int mxn = 3e5+10;
const int B = 20;
int ans[1<<B],arr[mxn];
bitset<mxn> ap;
int dp[1<<B];
//int dp[1<<(10)][1<<(10)];//left = l,min of popcnt(right & r)
int mask[mxn];
int cnt[B];
int N,M;
int sh[mxn];
int rmask;
int tl,tr;

int pull(int tar){
	int re = B+1;
	for(int i = 0;i<(1<<tl);i++){
		//int tmp = __builtin_popcount((i<<tr)&tar)+dp[i][tar&rmask];
		int tmp = __builtin_popcount((i<<tr)&tar)+dp[(i<<tr)|(tar&rmask)];
		re = min(re,tmp);
	}
	return re;
}

void push(int now){
	for(int i = 0;i<(1<<tr);i++){
		int tmp = __builtin_popcount(i&now);
		dp[((now>>tr)<<tr)|i] = min(dp[((now>>tr)<<tr)|i],tmp);
		//dp[now>>tr][i] = min(dp[now>>tr][i],tmp);
	}
	return;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>M;
	tl = M>>1,tr = M-tl;
	rmask = (1<<tr)-1;
	memset(ans,-1,sizeof(ans));
	for(int i = 0;i<N;i++){
		for(int j = 0;j<M;j++){
			int k;
			cin>>k;
			if(k)arr[i] |= 1<<j,cnt[j]++;
		}
		if(ans[arr[i]] == -1)ans[arr[i]] = B+1;
		else ap[i] = 1;
	}
	for(int i = 0;i<N;i++){
		for(int j = 0;j<M;j++){
			if(arr[i]&(1<<j))cnt[j]--;
			if(cnt[j]>=N/2)sh[i]++;
			if(cnt[j] == N/2)mask[i]|=1<<j;
			if(arr[i]&(1<<j))cnt[j]++;
		}
	}
	fill(dp,dp+(1<<B),B+1);
	//for(auto &i:dp)for(auto &j:i)j = B+1;
	for(int i = 0;i<N;i++){
		if(ap[i])continue;
		ans[arr[i]] = pull(mask[i]);
		push(arr[i]);
	}
	fill(dp,dp+(1<<B),B+1);
	//for(auto &i:dp)for(auto &j:i)j = B+1;
	for(int i = N-1;i>=0;i--){
		if(ap[i])continue;
		ans[arr[i]] = min(ans[arr[i]],pull(mask[i]));
		push(arr[i]);
	}
	for(int i = 0;i<N;i++){
		cout<<sh[i]-ans[arr[i]]<<'\n';
	}
	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11864 KB Output is correct
2 Correct 2 ms 11864 KB Output is correct
3 Correct 1 ms 11868 KB Output is correct
4 Correct 1 ms 11868 KB Output is correct
5 Correct 2 ms 11992 KB Output is correct
6 Incorrect 2 ms 11868 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11864 KB Output is correct
2 Correct 2 ms 11864 KB Output is correct
3 Correct 1 ms 11868 KB Output is correct
4 Correct 1 ms 11868 KB Output is correct
5 Correct 2 ms 11992 KB Output is correct
6 Incorrect 2 ms 11868 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11868 KB Output is correct
2 Incorrect 32 ms 13172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11868 KB Output is correct
2 Incorrect 32 ms 13172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11868 KB Output is correct
2 Incorrect 32 ms 13172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11868 KB Output is correct
2 Incorrect 32 ms 13172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11864 KB Output is correct
2 Correct 2 ms 11864 KB Output is correct
3 Correct 1 ms 11868 KB Output is correct
4 Correct 1 ms 11868 KB Output is correct
5 Correct 2 ms 11992 KB Output is correct
6 Incorrect 2 ms 11868 KB Output isn't correct
7 Halted 0 ms 0 KB -