The Pilots Brothers' refrigerator

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 row i 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.

 

我的理解：

---

      和Filp Game几乎差不多，题的类型及解法都很相似。

      枚举 +　位运算 + BFS（广度优先算法）

 

AC代码：

---

// The Pilots Brothers' refrigerator ：枚举 +　位运算 + BFS #include <iostream> #include <queue> #include <vector> #include <bitset> using std::cout; using std::cin; using std::endl; using std::vector; using std::queue; using std::bitset; // 翻转第i个点，所影响的位，即当前矩阵值 ^ round[i]; long round[16] = {0xF888,0xF444,0xF222,0xF111, 0x8F88,0x4F44,0x2F22,0x1F11, 0x88F8,0x44F4,0x22F2,0x11F1, 0x888F,0x444F,0x222F,0x111F}; long state[0xFFFF]; const long RESULT = 0x0; // 输入并转换 long Input() { bitset<16> current; for (int i = 0; i < 16;) { char c = cin.get(); if (c == '/n') continue; current.set(i, (c == '-' ? 0 : 1)); ++i; } return current.to_ulong(); } void BFS(long current) { if (current == RESULT) return; queue<long> status; memset(state, 0, sizeof(state)); status.push(current); while (!status.empty()) { long currStatus = status.front(); status.pop(); for (int i = 0; i < 16; ++i) { long temp = currStatus ^ round[i]; if (state[temp]) continue; state[temp] = currStatus * 16 + i; status.push(temp); if (temp == RESULT) return; } } } int main() { long current = Input(); BFS(current); vector<int> seq; long next(RESULT); while (true) { if (next == current) break; seq.push_back(state[next] % 16); next = state[next] / 16; } cout << seq.size() << endl; for (int i = 0; i != seq.size(); ++i) cout << 4 - seq[i] / 4<< " " << 4 - seq[i] % 4<< endl; }