水题
题目大意是输入n和m,代表有n行m列像素点,初始所有的像素均为白色,即为0,然后给定一个r*c的举证,在这个范围内发像素均改变它的颜色,黑变白,白变黑,问有至少多少次操作使最终变成给定的像素矩阵。
所以用反向思维,求最终用多少次操作使得像素矩阵最后为全白。
Maybe you wonder what an annoying painting tool is? First of all, the painting tool we speak of supports only black and white. Therefore, a picture consists of a rectangular area of pixels, which are either black or white. Second, there is only one operation how to change the colour of pixels:
Select a rectangular area of r rows and c columns of pixels, which is completely inside the picture. As a result of the operation, each pixel inside the selected rectangle changes its colour (from black to white, or from white to black).
Initially, all pixels are white. To create a picture, the operation described above can be applied several times. Can you paint a certain picture which you have in mind?
Input
The input contains several test cases. Each test case starts with one line containing four integers n, m, r and c. (1 ≤ r ≤ n ≤ 100, 1 ≤ c ≤ m ≤ 100), The following n lines each describe one row of pixels of the painting you want to create. The ith line consists of m characters describing the desired pixel values of the ith row in the finished painting ('0' indicates white, '1' indicates black).
The last test case is followed by a line containing four zeros.
Output
For each test case, print the minimum number of operations needed to create the painting, or -1 if it is impossible.
Sample Input
3 3 1 1 010 101 010 4 3 2 1 011 110 011 110 3 4 2 2 0110 0111 0000 0 0 0 0
Sample Output
4 6 -1
#include<iostream>
using namespace std;
char map[101][101];
int main()
{
int n,m,r,c,ans;
while(cin>>n>>m>>r>>c&&n){
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
cin>>map[i][j];
ans=0;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(map[i][j]=='1')
{
if(i+r>n||j+c>m)
continue;
ans++;
for(int k=i;k<i+r;k++)
for(int l=j;l<j+c;l++)
map[k][l]=((map[k][l]-'0')^1)+'0';
}
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(map[i][j]!='0')
{
ans=-1;
break;
}
}
if(ans==-1)
break;
}
cout<<ans<<endl;
}
return 0;
}