Flip Game -- POJ -- 1753
来源:互联网 发布:尤克里里新手入门软件 编辑:程序博客网 时间:2024/06/07 04:53
Flip Game
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.
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题意:这是一个棋盘,有一种黑白两面的特殊的棋子,在棋盘中翻动一个棋子,连带着这个棋子的四个方向都需要变动,问使全盘变为同一种颜色而翻动的棋子个数最少,输出翻动的子个数,如果不能使全盘变为同一种颜色,则输Impossible。
#include<stdio.h>int min(int a,int b){ return a<b?a:b;}char map[20][20];int dis[4][2]= {0,1,1,0,-1,0,0,-1},min1;int F(){ 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 turn(int x,int y){ if(map[x][y]=='w') map[x][y]='b'; else map[x][y]='w'; for(int i=0; i<4; i++) { int tx=x+dis[i][0]; int ty=y+dis[i][1]; if(tx<0||ty<0||tx>=4||ty>=4) continue; if(map[tx][ty]!='w') map[tx][ty]='w'; else map[tx][ty]='b'; }}void dfs(int x,int y,int step){ if(step>min1) return ; if(F()) { min1=min(min1,step); return ; } if(x==4) return ; turn(x,y); if(y>=3) dfs(x+1,0,step+1); else dfs(x,y+1,step+1); turn(x,y); if(y>=3) dfs(x+1,0,step); else dfs(x,y+1,step);}int main(){ for(int i=0; i<4; i++) scanf("%s",map[i]); min1=999999; dfs(0,0,0); if(min1>16) printf("Impossible\n"); else printf("%d\n",min1); return 0;}
阅读全文
0 0
- poj 1753 Flip Game
- poj 1753 Flip Game
- poj 1753 Flip Game
- poj 1753 Flip Game
- POJ 1753 Flip Game
- poj 1753 Flip Game
- poj 1753 Flip Game
- POJ-1753-Flip Game
- POJ 1753: Flip Game
- POJ 1753 Flip Game
- POJ 1753 Flip Game
- poj 1753 Flip Game
- poj 1753 Flip Game
- POJ 1753 Flip Game
- POJ-1753-Flip Game
- Poj 1753 Flip Game
- POJ 1753 Flip Game
- POJ-1753-Flip Game
- linux下查找文件内容
- Git-创建版本库
- Linux文件权限总结
- HDU 1541 Stars
- apidoc简单教程
- Flip Game -- POJ -- 1753
- apache配置多个端口访问
- table表格
- 3将命令添加到工具栏
- yum 软件仓库的使用
- Android 异常错误积累
- librtmp协议分析---RTMP_SendPacket函数
- 使用Ant构建java项目
- 递归之排列问题