Filp Game
来源:互联网 发布:nginx 目录跳转 编辑:程序博客网 时间:2024/06/11 06:09
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.
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).
bwwbbbwbbwwbbwww
4
AC代码:
#include<stdio.h>int map[4][4],step,flag=0;void turn(int i,int j)//转换{ map[i][j]=!map[i][j]; if(i>0) map[i-1][j]=!map[i-1][j]; if(i<3) map[i+1][j]=!map[i+1][j]; if(j>0) map[i][j-1]=!map[i][j-1]; if(j<3) map[i][j+1]=!map[i][j+1];}int range()//判定表格是否全部一样{ int i,j; for(i=0; i<4; i++) for(j=0; j<4; j++) if(map[i][j]!=map[0][0]) return 0; return 1;}int DFS(int i,int j,int dp)//深搜{ if(dp==step) { flag=range(); return 0; } if(flag||i==4)return 1; turn(i,j); if(j<3)DFS(i,j+1,dp+1); else DFS(i+1,0,dp+1); turn(i,j); if(j<3)DFS(i,j+1,dp); else DFS(i+1,0,dp); return 0;}int main(){ int i,j; char a; for(i=0; i<4; i++) { for(j=0; j<4; j++) { scanf("%c",&a); if(a=='b')map[i][j]=0; else map[i][j]=1; } getchar(); } for(step=0; step<=16; step++) { flag=0; DFS(0,0,0); if(flag)break; } if(flag)printf("%d\n",step); else printf("Impossible\n"); return 0;}
0 0
- Filp Game
- poj 1753 Filp Game
- POJ 1753 Filp Game dfs
- pku暑期训练3filp game
- pku 1753 Filp Game for循环+剪枝 > bfs
- 【POJ】1753【DFS】【Filp game】【又、全熄灯全亮灯问题】
- poj 1753 filp game 2015年暑假训练第一题 枚举
- filp-chip
- Android Card Filp Animations
- zoj 1028 filp and shift
- *dev=filp->private_data;这一句的理解
- *dev=filp->private_data;这一句的理解
- *dev=filp->private_data;这一句的理解
- game
- game
- game
- game...
- Game
- c++教程(二十一: Polymorphism)
- ccf试题 折点计数
- eclipse启动tomcat时出现一些莫名的错误
- 三国佚事——巴蜀之危
- Android高手进阶.听课笔记
- Filp Game
- mybatis常用jdbcType数据类型
- apk的安装分析
- (二)网络设备介绍-------交换机&路由器的工作原理
- 们--加强斐波那契
- 关于angular的include指令,include的页面无法加载js问题解决
- JPA学习笔记【五】【映射关联关系】
- C#static关键字的作用
- 折线分割平面