poj 2965 The Pilots Brothers' refrigerator
来源:互联网 发布:shell编程入门书籍推荐 编辑:程序博客网 时间:2024/05/30 23:00
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 columnj.
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
61 11 31 44 14 34 4
与这个点击打开雷同,可先看这题。
AC代码如下:
#include<iostream>#include<cstdio>using namespace std;int n,a[5][5];char b[5][5];int h[17],z[17],H[17],Z[17],minn;int PD(){ int i,j; for(i=0;i<4;i++) for(j=0;j<4;j++) if(a[i][j]!=0) return 0; return 1;}void dfs(int x,int y){ int i; for(i=0;i<4;i++) a[x][i]=!a[x][i]; for(i=0;i<4;i++) a[i][y]=!a[i][y]; a[x][y]=!a[x][y];}void work(int cur,int step){ int i; if(cur==16) { if(PD()&&step<minn) { minn=step; for(i=0;i<minn;i++) { H[i]=h[i];Z[i]=z[i]; } } } else{ work(cur+1,step); dfs(cur/4,cur%4); h[step]=cur/4;z[step]=cur%4; work(cur+1,step+1); dfs(cur/4,cur%4); }}int main(){ int i,j; for(i=0;i<4;i++) cin>>b[i]; for(i=0;i<4;i++) for(j=0;j<4;j++) if(b[i][j]=='+') a[i][j]=1; else a[i][j]=0; minn=17; work(0,0); cout<<minn<<endl; for(i=0;i<minn;i++) cout<<H[i]+1<<" "<<Z[i]+1<<endl; return 0;}
- poj 2965 The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator
- poj 2965The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator 枚举
- POJ-2965-The Pilots Brothers' refrigerator
- poj 2965 The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator
- poj 2965 The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator
- POJ-2965-The Pilots Brothers' refrigerator
- poj 2965 The Pilots Brothers' refrigerator
- POJ 2965:The Pilots Brothers' refrigerator
- Poj 2965 The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator(枚举)
- poj 2965 The Pilots Brothers' refrigerator
- POJ 2965 The Pilots Brothers' refrigerator 枚举
- POJ-2965-The Pilots Brothers' refrigerator
- 无线wifi
- Boost中文件系统类FileSystem全面解析
- Tomcat服务器的主要目录结构:
- poj 2409 Let it Bead Polya计数
- 这样0后言文塞一位优
- poj 2965 The Pilots Brothers' refrigerator
- 关于c语言的想法探究1(新手,给自己看的)
- 蝉知门户系统迁移到SAE平台-浏览目录空间
- 汉诺塔系列问题: 汉诺塔II、汉诺塔III、汉诺塔IV、汉诺塔V、汉诺塔VI、汉诺塔VII
- 【剑指offer】Q9:斐波那契数列
- Scrapy 安装
- 饭卡
- leetcode-Container With Most Water
- 机器学习之KNN算法