Fliptile 翻格子游戏[Usaco2007 Open]
题目描述
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".
输入
* 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
输出
* Lines 1..M: Each line contains N space-separated integers, each specifying how many times to flip that particular location.
样例输入
4 4
1 0 0 1
0 1 1 0
0 1 1 0
1 0 0 1
样例输出
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. 题解
一眼以为是喜闻乐见的每日大暴搜,然后就开心地开始画。这个东西和翻的先后无关,而且每个点翻两次就翻回去了,只会有0和1两种情况。直接按字典序从小到大翻不翻枚举,得到第一个可行解就停止搜索,没有想清楚“步数最少”到底是不是题目要求。稍微剪了剪枝,就直接这么放着了。搜索复杂度比较玄学,也没仔细想,天真地以为这样就差不多了。
所以说我这么信任你你居然是个状压?用二进制枚举第一行的操作,正如《分手是祝愿》一样,每个点被翻偶数次状态与原来相同。用一个矩阵记录一下每个位置被改变了多少次,在翻下一行时要求上一行全部为0,而能改变的上一行只有正对的那个,所以下一行的操作也是可以确定的。推到最后一行,这一系列操作真正正确与否就可以验证了,看它是否使最后一行全部变为0。当搜出了一个可行解,它固然字典序很小,但还要比较操作次数,并且以操作次数小的优先(话说字典序大多数情况下都是用来优中选优的),所以无论如何都要在第一行枚举所有状态。
昨天找规律,今天递推,正解还真是五花八门多种多样丰富多彩惊世骇俗啊……然而真正的dalao们还是能想到解决问题的办法。存在即合理,有题目就会有解法,有偏差就会有错误,我们总是得相信些什么,有所相信才能走下去。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int ans[],a[][],n,m,bf[][],res[],mi,ge;
bool jg,cl;
void init()
{
scanf("%d%d",&m,&n);
for(int i=;i<=m;i++)
for(int j=;j<=n;j++)
scanf("%d",&a[i][j]);
mi=m*n+;
}
void dt()
{
for(int j=n-;j>=;j--)
if(ans[]&(<<j))
{
bf[][n-j]++;
bf[][n-j-]++;
bf[][n-j+]++;
bf[][n-j]++;
}
for(int i=;i<=m;i++)
for(int j=;j<=n;j++)
if((bf[i-][j]&)!=a[i-][j])
{
ans[i]|=(<<(n-j));
bf[i][j]++;
bf[i][j+]++;
bf[i][j-]++;
bf[i+][j]++;
}
cl=;
for(int j=;j<=n;j++)
if((bf[m][j]&)!=a[m][j])
{
cl=;
break;
}
}
int main()
{
init();
for(int i=;i<=(<<n)-;i++)
{
memset(bf,,sizeof(bf));
memset(ans,,sizeof(ans));
ans[]=i;
dt();
if(cl)
{
jg=;
ge=;
for(int k=;k<=m;k++)
for(int j=;j<n;j++)
if(ans[k]&(<<j)) ge++;
if(ge<mi)
{
for(int k=;k<=m;k++)
res[k]=ans[k];
mi=ge;
}
}
}
if(jg)
for(int i=;i<=m;i++)
{
for(int j=n-;j>;j--)
{
if(res[i]&(<<j)) printf("1 ");
else printf("0 ");
}
if(res[i]&) printf("1\n");
else printf("0\n");
}
if(!jg) printf("IMPOSSIBLE");
return ;
}
fliptile
食堂知道,那些疲惫又难过的OIer吃得特别多,所以他们很喜欢大暴搜……
Fliptile 翻格子游戏[Usaco2007 Open]的更多相关文章
- 1647: [Usaco2007 Open]Fliptile 翻格子游戏
1647: [Usaco2007 Open]Fliptile 翻格子游戏 Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 423 Solved: 173[ ...
- [Usaco2007 Open]Fliptile 翻格子游戏
[Usaco2007 Open]Fliptile 翻格子游戏 题目 Farmer John knows that an intellectually satisfied cow is a happy ...
- [Usaco2007 Open]Fliptile 翻格子游戏题解
问题 B: [Usaco2007 Open]Fliptile 翻格子游戏 时间限制: 5 Sec 内存限制: 128 MB 题目描述 Farmer John knows that an intell ...
- Fliptile 翻格子游戏
问题 B: [Usaco2007 Open]Fliptile 翻格子游戏 时间限制: 5 Sec 内存限制: 128 MB 题目描述 Farmer John knows that an intell ...
- [BZOJ 1647][USACO 2007 Open] Fliptile 翻格子游戏
1647: [Usaco2007 Open]Fliptile 翻格子游戏 Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 702 Solved: 281[ ...
- [Usaco2007 Open]Fliptile 翻格子游戏 状态压缩
考试想到了状压,苦于T1废掉太长时间,于是默默输出impossible.. 我们知道,一个格子的翻转受其翻转次数和它相邻翻转次数的影响. 由每一个位置操作两次相当于把它翻过来又翻回去,所以答案中每一个 ...
- 【BZOJ】1647: [Usaco2007 Open]Fliptile 翻格子游戏(暴力)
http://www.lydsy.com/JudgeOnline/problem.php?id=1647 自己太弱...看题解.. 竟然是枚举第一行的放法,,,因为一定要全部变0,所以将前一行1的在这 ...
- 【BZOJ 1647】[Usaco2007 Open]Fliptile 翻格子游戏 模拟、搜索
第一步我们发现对于每一个格子,我们只有翻和不翻两种状态,我们发现一旦确定了第一行操作,那么第二行的操作也就随之确定了,因为第一行操作之后我们要想得到答案就得把第一行全部为0,那么第二行的每一个格子的操 ...
- BZOJ 1647 [Usaco2007 Open]Fliptile 翻格子游戏:部分枚举 位运算
题目链接:http://www.lydsy.com/JudgeOnline/problem.php?id=1647 题意: 在一个n*m(1 <= n,m <= 15)的棋盘上,每一个格子 ...
随机推荐
- v9 频道页如果有下级栏目跳转到第一个栏目链接
{if $CATEGORYS[$catid]['child']==1} {php $firstarr = explode(',',$CATEGORYS[$catid]['arrchildid']);} ...
- .NET C#转Java没那么难,开发环境篇
.NET C#转Java没那么难,都是面向对向的语言,而且语法还是相似的,先对比一下开发环境,再到Servlet,再到MVC,都是一样一样的,只是JAVA的配制项比较多而已,只要配好一个,后面都是co ...
- sublime 设置字体
通过菜单Preferences/Settings - User,添加下面这行配置就可以修改字体: "font_face": "Courier New", &qu ...
- Structured-Streaming之窗口操作
Structured Streaming 之窗口事件时间聚合操作 Spark Streaming 中 Exactly Once 指的是: 每条数据从输入源传递到 Spark 应用程序 Exactly ...
- 3.sublime vue 语法高亮插件安装
默认情况下,Vue.js 的单文件组件(*.vue)在 sublime 编辑器中是不被识别的.若要想高亮显示,需要安装插件 Vue Syntax Hightlight.安装步骤如下: 第一,在 s ...
- MySQL基础语法命令
1. 建表 创建MySQL数据表需要以下信息: 表名 表字段名 定义每个表字段 通用语法: CREATE TABLE table_name (column_name column_type); 实例: ...
- dynamic-load-apk 插件与宿主方法互调
新建项目 DlPluginHost,下载dynamic-load-apk源码 1.将dynamic-load-apk 文件夹中的lib做为module导入到DlPlginHost 2.导入到Plugi ...
- JS,HTML,CSS
HTML定义了网页的内容 CSS定义了网页的布局 JavaScript定义了网页的行为
- weblogic漏洞修复:CVE-2014-4210,UDDI Explorer对外开放
漏洞描述:http://blog.gdssecurity.com/labs/2015/3/30/weblogic-ssrf-and-xss-cve-2014-4241-cve-2014-4210-cv ...
- sublime text 3 配置python IDE
Python越来越受“程序猿”们的青睐.快速的开发模式,简洁的代码格式,海量的扩展,这无疑都为python的火热奠定了基础. “磨刀不误砍柴工”,一款功能强劲的IDE能帮助开发者有效的管理.编辑,运行 ...