POJ 2965 The Pilots Brothers' refrigerator(DFS)

最新推荐文章于 2024-05-05 08:00:34 发布

Noooooorth

最新推荐文章于 2024-05-05 08:00:34 发布

阅读量1.5k

点赞数 1

分类专栏：搜索文章标签： ACM 算法 dfs

本文链接：https://blog.csdn.net/Noooooorth/article/details/47013505

版权

搜索专栏收录该内容

13 篇文章 0 订阅

订阅专栏

The Pilots Brothers' refrigerator

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20726		Accepted: 7973		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

与POJ1753类似，把矩阵的状态转换成一个16位的二进制数，'+'对应位为1，反之为0。到达终点的标志就是矩阵的二进制数为0。对4*4矩阵的16个点进行dfs，分为翻转和不翻转两种选择，最终输出路径。

#pragma commment(linker,"/STACK: 102400000 102400000")
#include<stack>
#include<queue>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=1e5+50;
#define MAXI 0x3f3f3f

int step[20],ans;
stack<int>s;

int cmp(int a,int b)
{
    return a>b;
}

int change(int num,int n)
{
    int r=n/4,c=n%4;
    for(int i=0;i<16;i++)
        if(i/4==r||i%4==c)
            num^=(1<<(i));
    return num;
}

void dfs(int loc,int now,int num)
{
    if(now==0)
    {
        if(num<ans)
        {
            ans=num;
            int c=0;
            while(!s.empty())
            {
                int t=s.top();
                s.pop();
                step[c++]=t;
            }
            for(int i=c-1;i>=0;i--)
                s.push(step[i]);
        }
        return ;
    }
    if(loc<0)
        return ;
    s.push(loc);
    dfs(loc-1,change(now,loc),num+1);
    s.pop();
    dfs(loc-1,now,num);
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
#endif // ONLINE_JUDGE
    int s=0;
    char t;
    for(int i=0;i<4;i++)
    {
        for(int j=0;j<4;j++)
        {
            scanf("%c",&t);
            if(t=='+')
                s=s*2+1;
            else
                s=s*2+0;
        }
        getchar();
    }
    ans=20;
    dfs(15,s,0);
    printf("%d\n",ans);
    sort(step,step+ans,cmp);
    for(int i=0;i<ans;i++)
        printf("%d %d\n",(15-step[i])/4+1,(15-step[i])%4+1);
    return 0;
}