Submission #889782

#	Time	Username	Problem	Language	Result	Execution time	Memory
889782		vjudge1	Council (JOI23_council)	C++17	6 / 100	863 ms	5956 KiB

council

#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..
 
HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */
//The most CHALISHKANCHIK
//~ #define ff first
//~ #define ss second
//~ #define pb push_back
//~ #define all(x) x.begin(),x.end()
//~ #define rall(x) x.rbegin(),x.rend()
#define int long long
//~ typedef vector<int> vi;
//~ typedef pair<int,int> pii;
//~ typedef vector<pair<int,int> > vii;
const int N = 2e5+50, inf = 1e18, mod = 1e9+7;
void solve(){
	int n, m, k;
	cin >> n >> m;
	k = min(950ll, n);
	int a[n][m];
	int rez[m]{};
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin >> a[i][j];
			rez[j]+=a[i][j];
		}
	}
	//~ for(auto i:rez)cout << i << ' ';
	//~ cout << '\n';
	int ps[k]{};
	int sm = 0;
	for(int i = 0; i < n; i++){
		int res = 0;
		for(int j = 0; j < m; j++){
			res+=(rez[j] - a[i][j] >= n/2);
		}
		if(res >= sm){
			for(int h = k-1; h > 0; h--){
				ps[h] = ps[h-1];
			}
			sm = res;
			ps[0] = i;
		}
	}
	int ans;
	for(int i = 0; i < n; i++){
		ans = 0;
		for(int j = 0; j < k; j++){
			if(ps[j] == i)continue;
			int res = 0;
			for(int h = 0; h < m; h++){
				res += ((rez[h] - (a[i][h] + a[ps[j]][h])) >= n/2);
			}
			ans = max(ans, res);
		}
		cout << ans << '\n';
	}
}
main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}

Compilation message (stderr)

council.cpp:64:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   64 | main(){
      | ^~~~

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