Submission #737741

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
737741	2023-05-07T16:33:06 Z	arnold518	Council (JOI23_council)	C++17	0 / 100	95 ms	37612 KB

council

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 3e5;
const int MAXM = 20;
const int INF = 1e9;

int N, M, A[MAXN+10][MAXM+10];
int P[MAXM+10];
int B[MAXN+10];

pii dp[(1<<MAXM)+10][MAXM+10];

pii operator + (pii p, int q)
{
	return {p.first+q, p.second+q};
}

void f(pii &p, pii q)
{
	if(p.first<q.first) p={p.first, min(p.second, q.first)};
	else p={q.first, min(q.second, p.first)};
}

int main()
{
	scanf("%d%d", &N, &M);
	for(int i=1; i<=N; i++) for(int j=0; j<M; j++) scanf("%d", &A[i][j]);
	for(int j=0; j<M; j++)
	{
		int cnt=0;
		for(int i=1; i<=N; i++) cnt+=A[i][j];
		if(cnt<N/2) P[j]=0;
		else if(cnt>N/2+1) P[j]=3;
		else if(cnt==N/2) P[j]=1;
		else if(cnt==N/2+1) P[j]=2;
	}

	for(int j=0; j<=M; j++) for(int i=0; i<(1<<M); i++) dp[i][j]=pii(INF, INF);
	for(int i=1; i<=N; i++)
	{
		for(int j=0; j<M; j++) B[i]|=(A[i][j]<<j);
		f(dp[B[i]][0], pii(0, INF));
	}

	for(int i=0; i<M; i++)
	{
		for(int j=0; j<(1<<M); j++)
		{
			if(P[i]==0)
			{
				f(dp[j][i+1], dp[j][i]+1);
				f(dp[j][i+1], dp[j^(1<<i)][i]+1);
			}
			if(P[i]==3)
			{
				f(dp[j][i+1], dp[j][i]);
				f(dp[j][i+1], dp[j^(1<<i)][i]);
			}	
			if(P[i]==1)
			{
				if(j&(1<<i))
				{
					f(dp[j][i+1], dp[j][i]+1);
					f(dp[j][i+1], dp[j^(1<<i)][i]+1);
				}
				else
				{
					f(dp[j][i+1], dp[j][i]);
					f(dp[j][i+1], dp[j^(1<<i)][i]+1);
				}
			}
			if(P[i]==2)
			{
				if(j&(1<<i))
				{
					f(dp[j][i+1], dp[j][i]+1);
					f(dp[j][i+1], dp[j^(1<<i)][i]);
				}
				else
				{
					f(dp[j][i+1], dp[j][i]);
					f(dp[j][i+1], dp[j^(1<<i)][i]);
				}
			}
		}
	}
	for(int i=1; i<=N; i++)
	{
		if(__builtin_popcount(B[i])!=M-dp[B[i]][M].first) printf("%d\n", M-dp[B[i]][M].first);
		else printf("%d\n", M-dp[B[i]][M].second);
	}
}

Compilation message

council.cpp: In function 'int main()':
council.cpp:31:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  scanf("%d%d", &N, &M);
      |  ~~~~~^~~~~~~~~~~~~~~~
council.cpp:32:54: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  for(int i=1; i<=N; i++) for(int j=0; j<M; j++) scanf("%d", &A[i][j]);
      |                                                 ~~~~~^~~~~~~~~~~~~~~~

Subtask #1

0 / 8.0

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

Subtask #2

0 / 8.0

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

Subtask #3

0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	93 ms	37480 KB	Output is correct
3	Correct	90 ms	37612 KB	Output is correct
4	Correct	69 ms	37460 KB	Output is correct
5	Correct	95 ms	37580 KB	Output is correct
6	Correct	69 ms	37392 KB	Output is correct
7	Correct	93 ms	37580 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	93 ms	37480 KB	Output is correct
3	Correct	90 ms	37612 KB	Output is correct
4	Correct	69 ms	37460 KB	Output is correct
5	Correct	95 ms	37580 KB	Output is correct
6	Correct	69 ms	37392 KB	Output is correct
7	Correct	93 ms	37580 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	93 ms	37480 KB	Output is correct
3	Correct	90 ms	37612 KB	Output is correct
4	Correct	69 ms	37460 KB	Output is correct
5	Correct	95 ms	37580 KB	Output is correct
6	Correct	69 ms	37392 KB	Output is correct
7	Correct	93 ms	37580 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #6

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	93 ms	37480 KB	Output is correct
3	Correct	90 ms	37612 KB	Output is correct
4	Correct	69 ms	37460 KB	Output is correct
5	Correct	95 ms	37580 KB	Output is correct
6	Correct	69 ms	37392 KB	Output is correct
7	Correct	93 ms	37580 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #7

0 / 22.0

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