zoukankan      html  css  js  c++  java
  • poj 2965 The Pilots Brothers' refrigerator

    http://poj.org/problem?id=2965

      poj 1753扩展,dfs+枚举,不过加了一个路径。

                                                                                  The Pilots Brothers' refrigerator
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 19278   Accepted: 7384   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
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int ans[6][6];
    int step;
    int r[20],c[20];
    bool flag=false;
    bool judge()
    {
        int i,j,sum=0;
        for(i=1;i<=4;i++)
          for(j=1;j<=4;j++)
               sum+=ans[i][j];
        if(sum==0)
            return true;
        else
             return false;
    }
    void flip(int x,int y)
    {
        int i,j;
        for(j=1;j<=4;j++)
        {
            if(ans[x][j]==1)
                ans[x][j]=0;
            else
               ans[x][j]=1;
        }
        for(i=1;i<=4;i++)
        {
             if(i==x)
                continue;
           if(ans[i][y]==1)
                ans[i][y]=0;
            else
               ans[i][y]=1;
        }
    }
    void dfs(int x,int y,int d)
     {
          if(d==step)
         {
            flag=judge();
                return ;
          }
    
          if(flag||x>4)
            {
             return ;
            }
         flip(x,y);
         r[d]=x;//保存路径。
         c[d]=y;//保存路径。
          if(y<4)
           dfs(x,y+1,d+1);
          else
           dfs(x+1,1,d+1);
          flip(x,y);
          if(y<4)
           dfs(x,y+1,d);
          else
            dfs(x+1,1,d);
    
     }
    int main()
    {
        int i,j;
        char temp;
        for(i=1;i<=4;i++)
         {
         for(j=1;j<=4;j++)
          {
             scanf("%c",&temp);
             if(temp=='+')
                 ans[i][j]=1;
             else
               ans[i][j]=0;
          }
            getchar();
         }
         for(step=1;step<=16;step++)
           {
               dfs(1,1,0);
               if(flag)
                   break;
           }
           printf("%d
    ",step);
           for(i=0;i<step;i++)
              printf("%d %d
    ",r[i],c[i]);
          return 0;
    }
  • 相关阅读:
    第二周课程进度
    Codeforces Round #479 (Div. 3) F. Consecutive Subsequence (简单dp)
    Codeforces Round #538 (Div. 2) C. Trailing Loves (or L'oeufs?) (分解质因数)
    Codeforces Round #162 (Div. 1) B. Good Sequences (dp+分解素数)
    Codeforces Round #552 (Div. 3) F. Shovels Shop (前缀和预处理+贪心+dp)
    桂林电子科技大学第三届ACM程序设计竞赛 G 路径
    Codeforces Round #551 (Div. 2) D. Serval and Rooted Tree (树形dp)
    Codeforces Round #324 (Div. 2) (哥德巴赫猜想)
    Codeforces Round #244 (Div. 2) C. Checkposts (tarjan 强连通分量)
    Codeforces Round #207 (Div. 1) A. Knight Tournament (线段树离线)
  • 原文地址:https://www.cnblogs.com/cancangood/p/4132078.html
Copyright © 2011-2022 走看看