poj1753Flip Game
来源:互联网 发布:注册自己域名的邮箱 编辑:程序博客网 时间:2024/05/22 14:27
链接:http://poj.org/problem?id=1753
Flip Game
Description
Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules:
1 Choose any one of the 16 pieces.
2 Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).
Consider the following position as an example:
bwbw
wwww
bbwb
bwwb
Here "b" denotes pieces lying their black side up and "w" denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become:
bwbw
bwww
wwwb
wwwb
The goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal.
Input
The input consists of 4 lines with 4 characters "w" or "b" each that denote game field position.
Output
Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it's impossible to achieve the goal, then write the word "Impossible" (without quotes).
Sample Input
bwwb
bbwb
bwwb
bwww
Sample Output
4
思路:简单枚举加深搜
#include<stdio.h>#include<iostream>using namespace std;int chess[4][4];int c=33;void build()//将棋盘的颜色以标记化 { char c; int i,j;for(i=0;i<4;i++)for(j=0;j<4;j++){cin>>c;if(c=='w')chess[i][j]=0;elsechess[i][j]=1;}}void turn(int x,int y)//翻转{ if(x>=0&&x<=3&&y>=0&&y<=3) chess[x][y]=!chess[x][y];}void flip(int s)//一个棋子变化,周围四个都要变化{int i=s/4;int j=s%4;turn(i,j);turn(i+1,j);turn (i,j+1);turn(i-1,j);turn(i,j-1); }int complete()//判断棋盘是否变成同一的颜色{int i,j,s1=0;for(i=0;i<4;i++)for(j=0;j<4;j++)s1+=chess[i][j];if(s1%16)return 0;elsereturn 1;}void dfs(int s,int b)//进行深搜{ if(complete()) {if(c>b) c=b;return; } if(s>=16) return;dfs(s+1,b);flip(s);dfs(s+1,b+1);flip(s); }int main(){ build();dfs(0,0);if(c==33)//由于翻转次数最多为32次printf("Impossible\n");elseprintf("%d\n",c);return 0; }
- POJ1753Flip Game
- poj1753Flip Game
- poj1753Flip Game
- POJ1753Flip Game
- poj1753Flip Game
- poj1753Flip Game(DFS+枚举)
- POJ1753Flip Game(位压缩+bfs)
- poj1753Flip Game【刷题计划】
- poj1753Flip Game之 广搜解法+暴搜解法
- game
- game
- game
- game...
- Game
- Game
- Game
- Game
- game
- K次方(即求n^k的前三位与后三位)
- 9---4 继承与多态
- hdu1232畅通工程(并查集入门)
- 家庭理财项目 分析
- resin解压war包错误
- poj1753Flip Game
- C++模板声明定义分离编译错误详解
- FZU 1015 土地划分
- ASP.NET C# 动态设置网页标题、关键字、描述
- JDBC开发
- 使用WinPcap编程(4)——把网络数据包存储到一个文件中
- VS2010 字体和颜色配置方案
- Sencha Touch 2 入门 Demo 之一:搭建 Sencha Touch 2 的运行环境
- pythonPkg_BeautifulSoup