题意:
给你一个01组成的矩形,问能否经过交换,变成每行1相同或者每列1相同或者每行列1相同,相应输出row, column, both和最小交换数。
解:
这题的贪心真是神,行和列分开来做,贪心的思路也很神。
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#define maxn 1010
using namespace std;
int r[maxn], T, m, n, flag, c[maxn], grid[maxn][maxn], pre[maxn], af[maxn];
char str[maxn];
bool push(int * arr, int l, int & ans){
int sm = 0;
for(int i = 0; i < l; i ++) sm += arr[i];
if(sm % l) return false;
int avg = sm / l, t[maxn];
int mn = 1 << 30;
for(int i = 0; i < l; i ++){//从i开始
if(arr[i] >= avg){//必须要加上等号,等号的情况是每行每列的1相同的情况
int cur = 0;
memcpy(t, arr, sizeof(t));
for(int j = i; j <= i + l - 1; j ++){//
int now = j % l;
int af = (j + 1) % l;
cur += abs(t[now] - avg);
t[af] += t[now] - avg;
t[now] = avg;
}
mn = min(mn, cur);
}
}
ans += mn;
return true;
}
int main(){
scanf("%d",&T);
for(int ca = 1; ca <= T; ca ++){
scanf("%d%d", & m, & n);
memset(r, 0, sizeof(r));
memset(c, 0, sizeof(c));
for(int i = 0; i < m; i ++){
scanf("%s", str);
for(int j = 0; j < n; j ++){
grid[i][j] = str[j] - '0';
r[i] += grid[i][j];
c[j] += grid[i][j];
}
}
int ans = 0; flag = 0;
if(push(r,m,ans)) flag |= 1;
if(push(c,n,ans)) flag |= 2;
if(flag == 0)
printf("Case %d: impossible\n", ca);
else if(flag == 1)
printf("Case %d: row %d\n", ca, ans);
else if(flag == 2)
printf("Case %d: column %d\n", ca, ans);
else
printf("Case %d: both %d\n", ca, ans);
}
return 0;
}