Submission #889720

#	Time	Username	Problem	Language	Result	Execution time	Memory
889720		vjudge1	Council (JOI23_council)	C++17	41 / 100	4089 ms	86984 KiB

council

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;

bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){cout << "Yes\n" ;}
void NO(){cout << "No\n" ;}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define ff first
#define ss second
#define endl '\n'

const int N = 3e5 + 5 ;
const int inf = 1e18 ;
const int mod = 998244353 ;
const double eps = 1e-8 ;

int binpow( int a , int b ){
  if ( b == 0 ) return 1 ;
  int x = binpow ( a , b/2 ) ;
  if ( !(b%2) ) return (x*x) ;
  return (x*x*a) ;
}
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}

//code

int n , m ;
int a[N][30] , cnt[30] , b[N] , ans[N] , c[N] ;
vector <int> g[N] ;


void solve(){
	
	cin >> n >> m ;
	for ( int i = 0 ; i < n ; i ++ ){
		for ( int j = 0 ; j < m ; j ++ ) cin >> a[i][j] ;
	}
	if ( m <= 10 ){
		for ( int i = 0 ; i < n ; i ++ ){
			for ( int j = 0 ; j < m ; j ++ ){
				cnt[j] += a[i][j] ;
				if (a[i][j]) b[i] += (1<<j) ;
			} c[b[i]] ++ ;
			g[b[i]].push_back(i) ;
		}
		for ( int i = 0 ; i < ( 1 << m ) ; i ++ ){
			if (!c[i]) continue ;
			c[i] -- ;
			for ( int l = 0 ; l < m ; l ++ ) if ( i & ( 1 << l ) ) cnt[l] -- ;
			for ( int j = 0 ; j < ( 1 << m ) ; j ++ ){
				int res = 0 ;
				if (!c[j]) continue ;
				c[j] -- ;
				for ( int l = 0 ; l < m ; l ++ ) if ( j & ( 1 << l ) ) cnt[l] -- ;
				for ( int l = 0 ; l < m ; l ++ ) if( cnt[l] >= n/2 ) res ++ ;
				chmax ( ans[i] , res ) ; chmax ( ans[j] , res ) ;
				for ( int l = 0 ; l < m ; l ++ ) if ( j & ( 1 << l ) ) cnt[l] ++ ;
				c[j] ++ ;
			}
			c[i] ++ ;
			for ( int l = 0 ; l < m ; l ++ ) if ( i & ( 1 << l ) ) cnt[l] ++ ;
		}
		for ( int i = 0 ; i < n ; i ++ ) cout << ans[b[i]] << endl ;
		return ;
	}
	for ( int i = 0 ; i < n ; i ++ ){
		int ans = 0 ;
		for ( int j = 0 ; j < m ; j ++ ) cnt[j] = 0 ;
		for ( int j = 0 ; j < m ; j ++ ){
			for ( int l = 0 ; l < n ; l ++ ){
				if ( l == i ) continue ;
				cnt[j] += a[l][j] ;
			}
		}
		for ( int j = 0 ; j < n ; j ++ ){
			if ( i == j ) continue ;
			int cur = 0 ;
			for ( int l = 0 ; l < m ; l ++ ){
				cur += ((cnt[l]-a[j][l])>=(n)/2) ;
			}
			chmax ( ans , cur ) ;
		} cout << ans << endl ;
	}	
}

signed main(){
    ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message (stderr)

council.cpp: In function 'void fopn(std::string)':
council.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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