1647: [Usaco2007 Open]Fliptile 翻格子游戏
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 727 Solved: 287
[ Submit][ Status][ Discuss]
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 x 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
* Line 1: Two space-separated integers: M and N
* 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
* Lines 1..M: Each line contains N space-separated integers, each specifying how many times to flip that particular location.
Sample Input
Sample Output
每个瓦片翻2次和不翻是一样的,所以对于每个瓦片要不不翻,要不就只需要翻1次
所以可以暴力每一种情况,但是O(2^(nm))的复杂度太高了
其中只用暴力第一行的每一种情况就好了,这样下面所有的瓦片按和不按就已经确定了
比如如果(1,2)的瓦片黑面向上,那么你必须按下(2,2)的瓦片,否则不能按……依次类推
复杂度O(nm(2^m))
注意题目要求在按次数最少的情况下输出字典序最小的
#include<stdio.h>
#include<string.h>
int n, m, a[20][20], b[20][20], ans[20][20], bet[20][20];
int dir[5][2] = {1,0,0,1,-1,0,0,-1,0,0};
int Check()
{
int i, j;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(b[i][j])
return 0;
}
}
return 1;
}
int main(void)
{
int i, j, k, p, sum, now;
scanf("%d%d", &n, &m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
scanf("%d", &a[i][j]);
}
sum = n*m+1;
for(i=0;i<(1<<m);i++)
{
now = 0;
memset(ans, 0, sizeof(ans));
memcpy(b, a, sizeof(b));
for(j=1;j<=m;j++)
{
if(i&(1<<(j-1)))
{
now++;
ans[1][m-j+1] = 1;
for(k=0;k<=4;k++)
b[1+dir[k][0]][m-j+1+dir[k][1]] ^= 1;
}
}
for(j=2;j<=n;j++)
{
for(k=1;k<=m;k++)
{
if(b[j-1][k])
{
now++;
ans[j][k] = 1;
for(p=0;p<=4;p++)
b[j+dir[p][0]][k+dir[p][1]] ^= 1;
}
}
}
if(Check() && now<sum)
{
sum = now;
memcpy(bet, ans, sizeof(ans));
}
}
if(sum<=n*m)
{
for(j=1;j<=n;j++)
{
printf("%d", bet[j][1]);
for(k=2;k<=m;k++)
printf(" %d", bet[j][k]);
printf("\n");
}
}
else if(i==(1<<m))
printf("IMPOSSIBLE\n");
return 0;
}