POJ 2965 The Pilots Brothers' refrigerator 位运算枚举

The Pilots Brothers' refrigerator Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 15176   Accepted: 5672   Special Judge 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. Sample Input -+-- ---- ---- -+-- Sample Output 6 1 1 1 3 1 4 4 1 4 3 4 4

受到POJ1753的启发，用枚举过了，但是这个题有高效的数学方法。。。

#include <stdio.h>
#include <queue>
#include <string.h>
using namespace std;

struct node
{
    int data, step;
}path[];
queue<struct node>q;

int swit(int s, int n)
{
    int t = n /  * ;
    for(int i = t; i <= t+; i++)
        s ^= <<i;
    for(int i = n % ; i < ; i += )
        s ^= <<i;
    s ^= <<n;
    return s;
}

int vis[];
void bfs()
{
    while(!q.empty())
    {
        struct node u = q.front();
        q.pop();
        if(u.data == )
        {
            printf("%d\n", u.step);
            int tmp = u.data;
            for(int i = ; i < u.step; i++)
            {
                printf("%d %d\n", -path[tmp].step/, -path[tmp].step%);
                tmp = path[tmp].data;
            }
            return;
        }
        for(int i = ; i < ; i++)
        {
            int y = swit(u.data, i);
            if(!vis[y])
            {
                q.push((struct node){y, u.step+});
                path[y] = (struct node){u.data, i};
                vis[y] = ;
            }
        }
    }
}

int main()
{
    char s[];
    int x = ;
    for(int i = ; i < ; i++)
    {
        scanf("%s", s);
        for(int j = ; j < ; j++)
        {
            if(s[j] == '+')
                x = (x<<) + ;
            else x <<= ;
        }
    }
    memset(vis, , sizeof(vis));
    vis[x] = ;
    q.push((struct node){x, });
    bfs();
    return ;
}