[bzoj1647][Usaco2007 Open]Fliptile 翻格子游戏

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.

HINT

Source

Silver

sol:
发现暴力会T,然后其实只要枚举第一行的状态,那么根据第一行的状态就能推出下面的状态了。

#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
using namespace std;
const int N=20;
int ans,n,m;
inline int read()
{
    char c;
    int res,flag=0;
    while((c=getchar())>'9'||c<'0') if(c=='-')flag=1;
    res=c-'0';
    while((c=getchar())>='0'&&c<='9') res=(res<<3)+(res<<1)+c-'0';
    return flag?-res:res;
}
bool a[N][N],t[N][N];
bool b[N][N],c[N][N],p[N][N];
void solve()
{
    int cnt=0;
    memset(p,0,sizeof(p));
    memcpy(t,a,sizeof(t));
    for(int i=1;i<=m;++i) p[1][i]=b[1][i];
    for(int i=2;i<=n;++i)
    for(int j=1;j<=m;++j)
    if(t[i-1][j]){t[i-1][j]^=1;t[i+1][j]^=1;t[i][j-1]^=1;t[i][j+1]^=1;t[i][j]^=1;p[i][j]=1;}
    for(int i=1;i<=n;++i)
    for(int j=1;j<=m;++j)
    {
        if(t[i][j]) return;
        if(p[i][j]) ++cnt;
    }
    if(cnt<ans)
    {
        ans=cnt;
        for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)
        c[i][j]=p[i][j];
    }
}
void dfs(int x)
{
    if(x>m)
    {
        solve();
        return;
    }
    dfs(x+1);
    a[1][x]^=1;a[1][x-1]^=1;a[1][x+1]^=1;a[2][x]^=1;
    b[1][x]=1;
    dfs(x+1);
    a[1][x]^=1;a[1][x-1]^=1;a[1][x+1]^=1;a[2][x]^=1;
    b[1][x]=0;
}
int main()
{
//  freopen("1647.in","r",stdin);
//  freopen(".out","w",stdout);
    n=read();
    m=read();
    for(int i=1;i<=n;++i)
    for(int j=1;j<=m;++j)
    a[i][j]=read();
    ans=n*m+1;
    dfs(1);
    if(ans<n*m+1)
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<m;++j)
        printf("%d ",c[i][j]);
        printf("%d\n",c[i][m]);
    }
    else
    printf("IMPOSSIBLE\n");
}
Python网络爬虫与推荐算法新闻推荐平台:网络爬虫:通过Python实现新浪新闻的爬取,可爬取新闻页面上的标题、文本、图片、视频链接(保留排版) 推荐算法:权重衰减+标签推荐+区域推荐+热点推荐.zip项目工程资源经过严格测试可直接运行成功且功能正常的情况才上传,可轻松复刻,拿到资料包后可轻松复现出一样的项目,本人系统开发经验充足(全领域),有任何使用问题欢迎随时与我联系,我会及时为您解惑,提供帮助。 【资源内容】:包含完整源码+工程文件+说明(如有)等。答辩评审平均分达到96分,放心下载使用!可轻松复现,设计报告也可借鉴此项目,该资源内项目代码都经过测试运行成功,功能ok的情况下才上传的。 【提供帮助】:有任何使用问题欢迎随时与我联系,我会及时解答解惑,提供帮助 【附带帮助】:若还需要相关开发工具、学习资料等,我会提供帮助,提供资料,鼓励学习进步 【项目价值】:可用在相关项目设计中,皆可应用在项目、毕业设计、课程设计、期末/期中/大作业、工程实训、大创等学科竞赛比赛、初期项目立项、学习/练手等方面,可借鉴此优质项目实现复刻,设计报告也可借鉴此项目,也可基于此项目来扩展开发出更多功能 下载后请首先打开README文件(如有),项目工程可直接复现复刻,如果基础还行,也可在此程序基础上进行修改,以实现其它功能。供开源学习/技术交流/学习参考,勿用于商业用途。质量优质,放心下载使用。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值