Submission #1748955


Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a[15][100010];

int main(){
	cin >> n >> m;
	REP(i,0,n) REP(j,0,m) cin >> a[i][j];
	
	int mi=n*m;
	REP(i,0,(1<<n)){
		int sum=0;
		REP(j,0,m){
			int pos=0;
			REP(k,0,n){
				pos+=a[k][j]^((i>>k)&1);
			}
			
			sum+=min(n-pos,pos);
		}
		
		mi=min(mi,sum);
	}
	
	cout << n*m-mi << endl;
	return 0;
}

Submission Info

Submission Time
Task E - おせんべい
User ecasdqina
Language C++14 (GCC 5.4.1)
Score 100
Code Size 716 Byte
Status AC
Exec Time 131 ms
Memory 2560 KB

Judge Result

Set Name set01 set02 set03 set04 set05
Score / Max Score 20 / 20 20 / 20 20 / 20 20 / 20 20 / 20
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
set01 data1
set02 data2
set03 data3
set04 data4
set05 data5
Case Name Status Exec Time Memory
data1 AC 2 ms 2304 KB
data2 AC 2 ms 2304 KB
data3 AC 3 ms 2304 KB
data4 AC 66 ms 2432 KB
data5 AC 131 ms 2560 KB