Pagini recente » Cod sursa (job #1921861) | Borderou de evaluare (job #872177) | Cod sursa (job #1481312) | Cod sursa (job #1378003) | Cod sursa (job #1462580)
#include <fstream>
#include <limits>
#define int64 long long
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int a[20][20],n,m,mx,l[20],c[20];
void line(int x)
{
for(int i=1;i<=n;i++)
{
a[x][0]-=a[x][i];
a[0][i]-=a[x][i];
a[x][i]=-a[x][i];
a[x][0]+=a[x][i];
a[0][i]+=a[x][i];
}
}
void col(int x)
{
for(int i=1;i<=m;i++)
{
a[0][x]-=a[i][x];
a[i][0]-=a[i][x];
a[i][x]=-a[i][x];
a[0][x]+=a[i][x];
a[i][0]+=a[i][x];
}
}
int getsum()
{
int sum=0;
for(int i=1;i<=n;i++)
sum+=a[i][0];
return sum;
}
void back(int x)
{
mx=max(mx,getsum());
if(x>n)return;
for(int i=1;i<=m;i++)
if(a[0][i]<0)
col(i);
back(x+1);
line(x);
for(int i=1;i<=m;i++)
if(a[0][i]<0)
col(i);
back(x+1);
}
int main()
{
in>>n>>m;
mx=numeric_limits<int>::min();
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
in>>a[i][j];
a[i][0]+=a[i][j];
a[0][j]+=a[i][j];
}
back(1);
out<<mx<<'\n';
return 0;
}