http://poj.org/status
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 5366 | Accepted: 2038 |
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
大意:一个m*n的01矩阵,每次点击(x,y),那么她的上下左右以及本身就会0变1,1变0,问把矩阵变成全0的,最小需要点击多少步。
想法:枚举第一行的所有可能,然后 判断 这样是否 存在 解,以及最小解,这样 将 第一行所有翻转方式都尝试一遍,得解, 复杂度 O(M*N*2^N);;
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int dx[5]={-1,0,0,0,1};
int dy[5]={0,-1,0,1,0};
int M,N;
int opt[20][20];
int flip[20][20];
int tile[20][20];
///查询x,y颜色
int get(int x,int y)
{
int c=tile[x][y];
for(int i=0;i<5;i++)
{
int x2=x+dx[i];
int y2=y+dy[i];
if(x2>=0&&x2<M&&y2>=0&&y2<N)
{
c+=flip[x2][y2];
}
}
return c%2;
}
int calc()
{
for(int i=1;i<M;i++)
{
for(int j=0;j<N;j++)
{
if(get(i-1,j)!=0)///(i-1,j)是 黑色,则必须翻转这个格子
flip[i][j]=1;
}
}
///判断 最后一行是否 是 全 白;;
for(int j=0;j<N;j++)
{
if(get(M-1,j)!=0)
return -1;
}
///统计翻转次数
int res=0;
for(int i=0;i<M;i++)
for(int j=0;j<N;j++)
{
res+=flip[i][j];
}
return res;
}
void sovle()
{
int res=-1;
///按照字典序 第一行所有 可能性
for(int i=0;i<1<<N;i++)
{
memset(flip,0,sizeof(flip));
for(int j=0;j<N;j++)
{
flip[0][j]=i>>j&1;
}
int num=calc();
if(num>=0&&(res<0||res>num))
{
res=num;
memcpy(opt,flip,sizeof(flip));
}
}
if(res<0)
printf("IMPOSSIBLE\n");
else
{
for(int i=0;i<M;i++)
{
for(int j=0;j<N;j++)
{
printf("%d%c",opt[i][j],j+1==N?'\n':' ');
}
}
}
}
int main()
{
while(cin>>M>>N)
{
for(int i=0;i<M;i++)
for(int j=0;j<N;j++)
cin>>tile[i][j];
sovle();
}
return 0;
}