poj Flip Game(DFS)(枚举)
来源:互联网 发布:淘宝定制小说人设图片 编辑:程序博客网 时间:2024/05/22 09:01
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:
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.
- Choose any one of the 16 pieces.
- 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
bwwbbbwbbwwbbwww
Sample Output
4
思路:DFS枚举所有情况,因为每个棋子只有黑或白两种情况,所以总共有2^16种情况
代码:
#include<stdio.h>int map[5][5];int flag,step;void flip(int i,int j)//翻转{ map[i][j]=!map[i][j]; if(i<3) map[i+1][j]=!map[i+1][j]; if(j<3) map[i][j+1]=!map[i][j+1]; if(i>0) map[i-1][j]=!map[i-1][j]; if(j>0) map[i][j-1]=!map[i][j-1];}int check()//检测是否“清一色”{ for(int i=0; i<4; i++) for(int j=0; j<4; j++) if(map[i][j]!=map[0][0]) return 0; return 1;}void dfs(int i,int j,int dp){ if(dp==step) { flag=check(); return ; } if(flag||i==4) return ; flip(i,j);//此位置翻转 if(j<3) dfs(i,j+1,dp+1); else dfs(i+1,0,dp+1); flip(i,j);//回溯恢复成翻转前的状态 if(j<3)//此位置不翻转 dfs(i,j+1,dp); else dfs(i+1,0,dp);}int main(){ int i,j; char s; for(i=0; i<4; i++) { for(j=0; j<4; j++) { scanf("%c",&s); if(s=='b')//将图案转换成01图 map[i][j]=1; else map[i][j]=0; } getchar(); } flag=0; for(step=0; step<=16; step++)//枚举所有情况,因为总共只有16个格子,所以最多只能进行16步 { dfs(0,0,0); if(flag) break; } if(flag) printf("%d\n",step); else printf("Impossible\n"); return 0;}
1 0
- poj Flip Game(DFS)(枚举)
- poj 1753 Flip Game(dfs+枚举)
- poj 1753 Flip Game (dfs + 枚举)
- POJ 1753 Flip Game(dfs+枚举)
- POJ 1753 Flip Game(dfs+枚举)
- POJ 1753-Flip Game(枚举&&DFS)
- (枚举,dfs)Flip Game poj 1753
- POJ 1753 Flip Game(枚举+dfs)
- Flip Game(DFS枚举)
- POJ 1753 Flip Game 翻转(枚举+dfs)
- POJ 1753 Flip Game 暴力搜索(dfs加枚举)
- 文章标题 POJ 1753 : Flip Game(枚举+dfs)
- POJ 1753 Flip Game (DFS + 暴力枚举)
- poj Flip game【DFS 枚举】
- poj1753 Flip Game(枚举Enum+dfs)
- POJ 1753 Flip Game dfs + 枚举
- POJ 1753 Flip Game DFS枚举
- POJ 1753 Flip Game (DFS + 枚举)
- POJ 2251(WA)Dungeon Master(三维BFS)
- OC——4.BOOL类型
- 世界因大数据而 改变
- “加油站”优先队列贪心3题
- spring源码分析2本最高清带书目PDF百度网盘分享
- poj Flip Game(DFS)(枚举)
- Android Things专题 1.前世今生
- tensorflow用CNN 处理文本
- 面向对象面向过程的理解
- Makefile:1607 *** mixed implicit and nomal rules:depracated syntax
- linux开发初识-csdn文章被攻击找回
- 暗影精灵2plus(GTX1070)安装Ubuntu双系统
- 逆波兰表达式求值
- Unity5脚本事件函数及其执行顺序