POJ-1753-Flip Game
2016-07-25 15:42
281 查看
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: 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 bwwb bbwb bwwb bwww Sample Output 4 Source Northeastern Europe 2000 |
#include<stdio.h> #include<queue> #include<math.h> #include<string.h> using namespace std; bool Map[6][6]; int step = -1, flag = 0; int tx[] = {1,0,-1,0,0}; int ty[] = {0,1,0,-1,0}; void Filp(int x, int y) // 翻转 { for(int i = 0; i<5; ++i) { int xx = x+tx[i]; int yy = y+ty[i]; Map[xx][yy] = !Map[xx][yy]; } } int Make_sure() //判断当前是否为目标状态 { int k = 0; for(int i = 1; i<=4; ++i) for(int j = 1; j<=4; ++j) k+=Map[i][j]; if(k==16||k==0)return 1; else return 0; } void dfs(int x, int y, int s) { if(Make_sure()) { flag = 1; if(step>s||step == -1)step = s; return; } if(y>4) { ++x; if(x>4)return; y = 1; } dfs(x, y+1, s); Filp(x, y); dfs(x, y+1, s+1); Filp(x, y); } int main() { char s[5]; for(int i = 1; i<=4; ++i) { scanf("%s", s); for(int j = 1; j<=4; ++j) { if(s[j-1]=='b')Map[i][j] = 1; else Map[i][j] = 0; } } dfs(1, 1, 0); if(flag)printf("%d\n", step); else printf("Impossible\n"); return 0; }
相关文章推荐
- Thread_MultiShareData(多线程共享变量)
- STL之Vector(四):深入了解Vector
- 震惊世界的31张照片!惊心动魄!不看后悔~
- 【Android】 基础知识(一) --Android Studio使用技巧(1)
- iOS 文件操作,记录log日志。
- RAII惯用法:C++资源管理的利器
- 程序包管理二之yum详解
- codeforces 319C div1 189
- 二叉树中序遍历变型——折纸问题
- POJ 2386 Lake Counting
- 爹地,我找到了!,15个极好的Linux find命令示例
- 在开启DRS的集群中修复VMware虚拟主机启动问题
- nginx + tomcat 架构中,error_page错误页面的设置
- host文件设置详解
- SQL清除表格内容
- Android Studio Preview ”Rendering Problems“问题解决初探。
- PARDISO 5.0.0 Solver Project
- hdu5001 walk 【概率dp】
- 探索Javascript异步编程
- linux手贱操作