如题:http://poj.org/problem?id=3279
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 3867 | Accepted: 1483 |
Description
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15) of square tiles, each of which is colored black on one side and white on the other side.
As one would guess, when a single white tile is flipped, it changes to black; when a single black tile is flipped, it changes to white. The cows are rewarded when they flip the tiles so that each tile has the white side face up. However, the cows have rather large hooves and when they try to flip a certain tile, they also flip all the adjacent tiles (tiles that share a full edge with the flipped tile). Since the flips are tiring, the cows want to minimize the number of flips they have to make.
Help the cows determine the minimum number of flips required, and the locations to flip to achieve that minimum. If there are multiple ways to achieve the task with the minimum amount of flips, return the one with the least lexicographical ordering in the output when considered as a string. If the task is impossible, print one line with the word "IMPOSSIBLE".
Input
Lines 2.. M+1: Line i+1 describes the colors (left to right) of row i of the grid with N space-separated integers which are 1 for black and 0 for white
Output
Sample Input
4 4 1 0 0 1 0 1 1 0 0 1 1 0 1 0 0 1
Sample Output
0 0 0 0 1 0 0 1 1 0 0 1 0 0 0 0
Source
题目大意:给出一个M*N的矩阵,要求经过最小次数翻转,全变成0,如果最小次数有多重方法,按字典序输出第一种方法。
思路:上一篇3279,我们通过确定第一个是否反转来推出下面的状态,这一题则是给出一个矩阵,如果第一行的翻转确定了,最小翻转次数可以很容易求得,所以我们枚举所有第一行可能的翻转策略(按字典序),来推出下面的翻转策略。复杂度O(MN2^N).
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define MAXM 20
#define MAXN 20
int dx[5]={-1,0,0,0,1};
int dy[5]={0,-1,0,1,0};
int M,N;
int tile[MAXM][MAXN];
int opt[MAXM][MAXN];
int filp[MAXM][MAXN];
int get(int x,int y)
{
int c=tile[x][y];
int i;
for(i=0;i<5;i++)
{
int tx=x+dx[i];
int ty=y+dy[i];
if(tx>=0&&ty>=0&&tx<M&&ty<N)
c+=filp[tx][ty];
}
return c%2;
}
int solve()
{
int i,j;
for(i=1;i<M;i++)
for(j=0;j<N;j++)
if(get(i-1,j))
filp[i][j]=1;
for(i=0;i<N;i++)
if(get(M-1,i))
return -1;
int res=0;
for(i=0;i<M;i++)
for(j=0;j<N;j++)
res+=filp[i][j];
return res;
}
int main()
{
// freopen("C:\\Users\\Administrator\\Desktop\\fliptile.4.in","r",stdin); //4.5.6.7.8.9.10
cin>>M>>N;
int i,j;
for(i=0;i<M;i++)
for(j=0;j<N;j++)
scanf("%d",&tile[i][j]);
int res=-1;
for(i=0;i<1<<N;i++)
{
memset(filp,0,sizeof(filp));
for(j=0;j<N;j++)
filp[0][N-1-j]=i>>j&1;
int num=solve();
if(num>=0&&(res<0||res>num))
{
res=num;
memcpy(opt,filp,sizeof(filp));
}
}
if(res<0)
printf("IMPOSSIBLE\n");
else
for(i=0;i<M;i++)
for(j=0;j<N;j++)
printf("%d%c",opt[i][j],j+1==N?'\n':' ');
}