Submission #1334567

#TimeUsernameProblemLanguageResultExecution timeMemory
1334567sporknivesCouncil (JOI23_council)C++20
16 / 100
4091 ms5112 KiB
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;

// if one of the ordinances gets >= floor(n/2)+2 yes votes, it passes no matter what,
// vice versa for < floor(n/2)-2 yes votes.
// so for something to be in contention it must be within a range of 4 votes
signed main() {
	int n,m; cin>>n>>m;
	int vote[n][m];
	for(int i=0;i<n;i++) {
		for(int j=0;j<m;j++) {
			cin>>vote[i][j];
		}
	}
	
	int count[m]; memset(count,0,sizeof(count));
	for(int j=0;j<m;j++) {
		for(int i=0;i<n;i++) {
			count[j]+=vote[i][j];
		}
	}

	for(int i=0;i<n;i++) {
		int ans=0;
		for(int j=0;j<n;j++) {
			if(i==j)continue;
			int pass=0;
			for(int k=0;k<m;k++) {
				if(count[k] - vote[i][k] - vote[j][k] >= n/2) pass++;
			}
			ans=max(ans,pass);
		}
		cout<<ans<<"\n";
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...