The Pilots Brothers' refrigerator
2015-08-14 11:10
525 查看
The Pilots Brothers' refrigerator
Description
The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.
There are 16 handles on the refrigerator door. Every handle can be in one of two states: open or closed. The refrigerator is open only when all handles are open. The handles are represented as a matrix 4х4. You can change the state of a handle in any location[i,
j] (1 ≤ i, j ≤ 4). However, this also changes states of all handles in rowi and all handles in column
j.
The task is to determine the minimum number of handle switching necessary to open the refrigerator.
Input
The input contains four lines. Each of the four lines contains four characters describing the initial state of appropriate handles. A symbol “+” means that the handle is in closed state, whereas the symbol “−” means “open”. At least one of the handles is
initially closed.
Output
The first line of the input contains N – the minimum number of switching. The rest N lines describe switching sequence. Each of the lines contains a row number and a column number of the matrix separated by one or more spaces. If there are several solutions,
you may give any one of them.
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |||
Total Submissions: 20905 | Accepted: 8072 | Special Judge |
The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.
There are 16 handles on the refrigerator door. Every handle can be in one of two states: open or closed. The refrigerator is open only when all handles are open. The handles are represented as a matrix 4х4. You can change the state of a handle in any location[i,
j] (1 ≤ i, j ≤ 4). However, this also changes states of all handles in rowi and all handles in column
j.
The task is to determine the minimum number of handle switching necessary to open the refrigerator.
Input
The input contains four lines. Each of the four lines contains four characters describing the initial state of appropriate handles. A symbol “+” means that the handle is in closed state, whereas the symbol “−” means “open”. At least one of the handles is
initially closed.
Output
The first line of the input contains N – the minimum number of switching. The rest N lines describe switching sequence. Each of the lines contains a row number and a column number of the matrix separated by one or more spaces. If there are several solutions,
you may give any one of them.
Sample Input
-+-- ---- ---- -+--
Sample Output
6 1 1 1 3 1 4 4 1 4 3 4 4 法一:DFS+枚举#include<iostream> using namespace std; bool map[10][10]={false},fd=false; int step; int r[10],c[10]; //用于存储操作的位置 bool pd() //判断把手状态 { for (int i=1;i<=4;i++) { for (int j=1;j<=4;j++) { if (map[i][j]!=true) return false; } } return true; } void fz(int row,int col) //改变把手状态 { for (int i=1;i<=4;i++) { map[i][col]=!map[i][col]; map[row][i]=!map[row][i]; } map[row][col]=!map[row][col]; } void dfs(int row ,int col , int d) { if (d==step) { fd=pd(); return ; } if (fd||row==5) return ; fz(row,col); r[d]=row; c[d]=col; if (col<4) dfs(row,col+1,d+1); else dfs(row+1,1,d+1); fz(row,col); if (col<4) dfs(row,col+1,d); else dfs(row+1,1,d); } int main() { char a; for (int i=1;i<=4;i++) { for (int j=1;j<=4;j++) { cin>>a; if (a=='-') map[i][j]=true; } } for (step=0;step<=16;step++) { dfs(1,1,0); if (fd) break; } cout<<step<<endl; for (int i=0;i<step;i++) cout<<r[i]<<' '<<c[i]<<endl; return 0; }
法二:
思路
先看一个简单的问题,如何把'+'变成'-'而不改变其他位置上的状态?答案是将该位置(i,j)及位置所在的行(i)和列(j)上所有的handle更新一次,结果该位置被更新了7次,相应行(i)和列(j)的handle被更新了4次,剩下的被更新了2次.被更新偶数次的handle不会造成最终状态的改变.因此得出高效解法,在每次输入碰到'+'的时候,自增该位置与相应的行和列,当输入结束后,遍历数组,所有为奇数的位置则是操作的位置,而奇数位置的个数之和则是最终的操作次数.#include<iostream> using namespace std; int a[10][10]; int main() { char c; for (int i=1;i<=4;i++) { for (int j=1;j<=4;j++) { cin>>c; if (c=='+') { for (int k=1;k<=4;k++) { a[i][k]++; a[k][j]++; } a[i][j]--; } } } int s=0; for (int i=1;i<=4;i++) { for (int j=1;j<=4;j++) s+=a[i][j]%2; } cout<<s<<endl; for (int i=1;i<=4;i++) { for (int j=1;j<=4;j++) if (a[i][j]%2!=0) cout<<i<<' '<<j<<endl; } return 0; }
相关文章推荐
- ViewFlow增强onItemClick功能及ViewFlow AbsListView源码分析
- HDU 4442 Physical Examination
- php中文字符串翻转
- PLSQL win7 64位
- HDU 3073 Saving Beans
- Java是解释型语言
- js实现人才网站职位选择功能的方法
- hdu-1285 确定比赛名次
- android 管理ViewGroup中的触摸事件
- 未来航天飞机或用远程微波能量推动
- ios开发_Runtime
- Android Application类
- 判断网页的编码方式 python
- C++Primer 第五版 练习10.12解答
- UISegmentedControl——分段控件
- PHP获取curl的错误
- 如何禁用Visual Studio 2013的Browser Link功能
- win10 genymotion 无法启动的问题解决
- 倒立三角形
- 培训落差感,一切以不传授技能为主的培训都是耍流氓