1647: [Usaco2007 Open]Fliptile 翻格子游戏

Time Limit: 5 Sec  Memory Limit: 64 MB
Submit: 702  Solved: 281
[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".

 约翰知道,那些高智力又快乐的奶牛产奶量特别高.所以他做了一个翻瓦片的益智游戏来娱乐奶牛.在一个M×N(1≤M,N≤15)的骨架上,每一个格子里都有一个可以翻转的瓦片.瓦片的一面是黑色的,而另一面是白色的.对一个瓦片进行翻转,可以使黑变白,也可以使白变黑.然而,奶牛们的蹄子是如此的巨大而且笨拙,所以她们翻转一个瓦片的时候,与之有公共边的相邻瓦片也都被翻转了.那么,这些奶牛们最少需要多少次翻转,使所有的瓦片都变成白面向上呢?如杲可以做到,输出字典序最小的结果(将结果当成字符串处理).如果不能做到,输出“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

    第1行输入M和N,之后M行N列,输入游戏开始时的瓦片状态.0表示白面向上,1表示黑面向上.

Output

* Lines 1..M: Each line contains N space-separated integers, each specifying how many times to flip that particular location.

    输出M行,每行N个用空格隔开的整数,表示对应的格子进行了多少次翻转.

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

OUTPUT DETAILS:

After flipping at row 2 column 1, the board will look like:
0 0 0 1
1 0 1 0
1 1 1 0
1 0 0 1

After flipping at row 2 column 4, the board will look like:
0 0 0 0
1 0 0 1
1 1 1 1
1 0 0 1

After flipping at row 3 column 1, the board will look like:
0 0 0 0
0 0 0 1
0 0 1 1
0 0 0 1

After flipping at row 3 column 4, the board will look like:
0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

Another solution might be:
0 1 1 0
0 0 0 0
0 0 0 0
0 1 1 0
but this solution is lexicographically higher than the solution above.

第一眼看到数据范围可能很多人会想到状压 $DP$ , 然而看起来似乎是最大 $15 \times 15 = 225$ 的状压量根本无法枚举.

但是实际上我们可以推知, 根据上一行的黑白情况我们可以推知下一行的翻转情况. 因为在上一行已经确定的情况下下一行必须保证在黑色瓦片正下方进行翻转. 所以我们的所有情况都可以从第一行的黑白情况推知. 这时枚举量就从 $2^{k^2}$ 降到了 $2^k$ . 然后我们根据第一行枚举得出的黑白情况计算该种情况是否可以得出解. 如果得出解的话更新答案, 无解忽略即可.

枚举中途可以选择进行剪枝, 保存最低翻转数, 当已使用的翻转数大于这个值时停止继续求值.

参考代码

GitHub

 #include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm> const int MAXN=; int n;
int m;
int sum;
int flip;
int minfl;
int black;
bool ans[MAXN][MAXN];
bool raw[MAXN][MAXN];
bool tmp[MAXN][MAXN];
bool data[MAXN][MAXN]; void Change(int,int);
void Initialize();
bool Check(int);
bool Compare(); int main(){
freopen("fliptile.in","r",stdin);
freopen("fliptile.out","w",stdout);
bool solve=false;
Initialize();
for(int i=;i<(<<n);i++){
memset(tmp,,sizeof(tmp));
memcpy(data,raw,sizeof(raw));
flip=;
black=sum;
if(Check(i)){
memcpy(ans,tmp,sizeof(tmp));
minfl=flip;
solve=true;
}
}
if(solve){
for(int i=;i<=n;i++){
for(int j=;j<=m;j++){
printf("%d ",ans[i][j]?:);
}
putchar('\n');
}
}
else
puts("IMPOSSIBLE");
return ;
} inline void Change(int x,int y){
tmp[x][y]=true;
data[x][y]=!data[x][y];
black+=data[x][y]?:-;
if(x>){
data[x-][y]=!data[x-][y];
black+=data[x-][y]?:-;
}
if(x<n){
data[x+][y]=!data[x+][y];
black+=data[x+][y]?:-;
}
if(y>){
data[x][y-]=!data[x][y-];
black+=data[x][y-]?:-;
}
if(y<m){
data[x][y+]=!data[x][y+];
black+=data[x][y+]?:-;
}
} void Initialize(){
scanf("%d%d",&n,&m);
int tmp=;
minfl=0x7FFFFFFF;
for(int i=;i<=n;i++){
for(int j=;j<=m;j++){
scanf("%d",&tmp);
raw[i][j]=tmp;
sum+=tmp;
}
}
} bool Check(int x){
for(int i=;i<n;i++){
if(x&(<<i)){
Change(,i+);
flip++;
if(flip>=minfl)
return false;
}
}
for(int i=;i<=n;i++){
for(int j=;j<=m;j++){
if(data[i-][j]){
Change(i,j);
flip++;
if(flip>=minfl)
return false;
}
}
}
if(black>)
return false;
else
return true;
}

Backup

以及日常凸包图包

[BZOJ 1647][USACO 2007 Open] Fliptile 翻格子游戏的更多相关文章

  1. 【BZOJ 1647】[Usaco2007 Open]Fliptile 翻格子游戏 模拟、搜索

    第一步我们发现对于每一个格子,我们只有翻和不翻两种状态,我们发现一旦确定了第一行操作,那么第二行的操作也就随之确定了,因为第一行操作之后我们要想得到答案就得把第一行全部为0,那么第二行的每一个格子的操 ...

  2. 1647: [Usaco2007 Open]Fliptile 翻格子游戏

    1647: [Usaco2007 Open]Fliptile 翻格子游戏 Time Limit: 5 Sec  Memory Limit: 64 MBSubmit: 423  Solved: 173[ ...

  3. [Usaco2007 Open]Fliptile 翻格子游戏

    [Usaco2007 Open]Fliptile 翻格子游戏 题目 Farmer John knows that an intellectually satisfied cow is a happy ...

  4. Fliptile 翻格子游戏

    问题 B: [Usaco2007 Open]Fliptile 翻格子游戏 时间限制: 5 Sec  内存限制: 128 MB 题目描述 Farmer John knows that an intell ...

  5. [Usaco2007 Open]Fliptile 翻格子游戏题解

    问题 B: [Usaco2007 Open]Fliptile 翻格子游戏 时间限制: 5 Sec  内存限制: 128 MB 题目描述 Farmer John knows that an intell ...

  6. 【BZOJ】1647: [Usaco2007 Open]Fliptile 翻格子游戏(暴力)

    http://www.lydsy.com/JudgeOnline/problem.php?id=1647 自己太弱...看题解.. 竟然是枚举第一行的放法,,,因为一定要全部变0,所以将前一行1的在这 ...

  7. BZOJ 1647 [Usaco2007 Open]Fliptile 翻格子游戏:部分枚举 位运算

    题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1647 题意: 在一个n*m(1 <= n,m <= 15)的棋盘上,每一个格子 ...

  8. bzoj 1647: [Usaco2007 Open]Fliptile 翻格子游戏【dfs】

    这个可以用异或高斯消元,但是我不会呀我用的暴搜 2的m次方枚举第一行的翻转情况,然后后面的就定了,因为对于一个j位置,如果i-1的j位置需要翻,那么一定要翻i的j,因为这是i-1的j最后翻的机会 按字 ...

  9. Fliptile 翻格子游戏[Usaco2007 Open]

    题目描述 Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. ...

随机推荐

  1. ZOJ 2971 Give Me the Number

    Give Me the Number Numbers in English are written down in the following way (only numbers less than  ...

  2. sgu-203 Hyperhuffman(哈夫曼编码)

    Hyperhuffman You might have heard about Huffman encoding - that is the coding system that minimizes ...

  3. centos7中安装mongodb3.6

    centos7中安装mongodb3.6 首先更新系统 yum -y update 1.安装Mongodb 编辑Mongodb安装源 vim /etc/yum.repos.d/mongodb-org- ...

  4. 实现MySQL数据库的实时备份

    实现MySQL数据库的实时备份 使用MySQL Replication 吴剑 2018-08-03 原创文章,转载必需注明出处:http://www.cnblogs.com/wu-jian 吴剑 ht ...

  5. IOS Core Image之一

    项目中要实现高斯模糊的效果,今天看了下Core Image这块的内容, 主要包括CIImage.CIFilter.CIContext.CIDetector(检测).CIFeature(特征)等类. 今 ...

  6. 【angular5项目积累总结】消息订阅服务

    code import { Injectable } from '@angular/core'; import { Subject } from 'rxjs/Subject'; @Injectable ...

  7. [转]SSRS: Checking for Divide By Zero Using Custom Code

    本文转自:http://salvoz.com/blog/2011/11/25/ssrs-checking-for-divide-by-zero-using-custom-code/ I encount ...

  8. winform httplicent调用API

    绑定datagriview Uri uri = new Uri("http://localhost:49423");//地址            HttpClient clien ...

  9. WCF 之部署(2010版本之上)

    首先,在WIN系统下打开IIS,每种操作系统是不同的,请不要弄混. 1.控制面板---左下放的程序---启用或关闭Windows功能,如图: 2.找到Internet Information Serv ...

  10. Spring学习笔记:spring与mybatis四种整合方法

    1.采用数据映射器(MapperFactoryBean)的方式,不用写mybatis映射文件,采用注解方式提供相应的sql语句和输入参数.  (1)Spring配置文件: <!-- 引入jdbc ...