2965 -- The Pilots Brothers' refrigerator

The Pilots Brothers' refrigerator

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

Source

Northeastern Europe 2004, Western Subregion

 

 

题意：

　　给你4*4的矩阵。每个点有两种状态，+代表关，-代表开。每个点有一个操作就是该点所在行列所有状态翻转。问最少多少次可以全部打开，并且输出最少个数情况下翻转的点。

 

解题思路：

　　这道题跟1753 -- Flip Game很像，可以用1753的解题思路。

　　这道题用了更简单的方法。

　　遍历矩阵中每一个关闭的点，按照规则将其进行翻转，将他的反转次数++。重复上述操作，直到所有的点都是打开状态。

 #include<iostream>
 #include<stdio.h>
 using namespace std;
 char m[][];
 int Count[][];
 //判断状态
 bool Check()
 {
     for(int i=;i<=;i++)
         for(int j=;j<=;j++)
         {
             if(m[i][j] == '+') return ;//没有被全部打开
         }
     return ;
 }
 int getAns()
 {//计算结果
     int ans = ;
     for(int i=;i<=;i++)
     {
         for(int j=;j<=;j++)
         {
             if(Count[i][j]% == )
             {
                 Count[i][j] = ;
             }else{
                 Count[i][j] = ;
                 ans++;
             }
         }
     }
     return ans;
 }
 int changeState()
 {
     for(int i=;i<=;i++)
         for(int j=;j<=;j++)
         {
             if(m[i][j] == '+')//开关为关闭状态
             {
                 m[i][j] = '-';
                 Count[i][j] += ;
                 for(int k = ;k<=;k++)
                 {
                     if(m[i][k] == '+') {m[i][k] = '-';}
                     else{m[i][k] = '+';}
                 }
                 for(int k=;k<=;k++)
                 {
                     if(m[k][j] == '+') {m[k][j] = '-';}
                     else{m[k][j] = '+';}
                 }
                 if(Check())
                 {//进行结果输出
                     return getAns();
                 }
             }
         }
         if(Check() == ) return changeState();
 }

 int main()
 {
     char c;
     //初始化
     while(true)
     {
         for(int i = ;i<=;i++)
             for(int j=;j<=;j++)
                 Count[i][j] = ;
         for(int i=;i<=;i++)
         {
             for(int j=;j<=;j++)
             {
                 if((c = getchar()) == EOF) return ;
                 m[i][j] = c;
             }
             c = getchar();
         }

         cout<<changeState()<<endl;
         for(int i=;i<=;i++)
         {
             for(int j=;j<=;j++)
             {
                 if(Count[i][j] == ) cout<<i<<" "<<j<<endl;
             }
         }
     }

     return ;
 }

　　对于一个关闭的点，想要把他打开，首先翻转一下他自己，为了不影响其他的点他所在行列都得翻转一次。这样最后是奇数次的即为翻转点。

 #include<iostream>
 #include<stdio.h>
 #include<string.h>
 using namespace std;
 char m[][];
 int Count[][];
 //判断状态
 bool Check()
 {
     for(int i=;i<=;i++)
         for(int j=;j<=;j++)
         {
             if(m[i][j] == '+') return ;//没有被全部打开
         }
     return ;
 }
 int getAns()
 {//计算结果
     int ans = ;
     for(int i=;i<=;i++)
     {
         for(int j=;j<=;j++)
         {
             if(Count[i][j]% == )
             {
                 Count[i][j] = ;
             }else{
                 Count[i][j] = ;
                 ans++;
             }
         }
     }
     return ans;
 }
 int main()
 {
     char c;
     while(true)
     {
         memset(Count,,sizeof(Count));//初始化
         for(int i=;i<=;i++)
         {
             for(int j=;j<=;j++)
             {
                 if((c = getchar()) == EOF) return ;
                 m[i][j] = c;
                 if(c == '+')
                 {
                     for(int k=;k<=;k++)
                     {
                         Count[k][j]++;
                         Count[i][k]++;
                     }
                     Count[i][j]--;
                 }
             }
             c = getchar();
         }
         ///打印结果
         cout<<getAns()<<endl;
         for(int i=;i<=;i++)
         {
             for(int j=;j<=;j++)
             {
                 if(Count[i][j] == ) cout<<i<<" "<<j<<endl;
             }
         }
     }

     return ;
 }