【Codeforces】 330cPurification（找一点规律）

Problem Description
You are an adventurer currently journeying inside an evil temple. After defeating a couple of weak zombies, you arrived at a square room consisting of tiles forming an n × n grid. The rows are numbered 1 through n from top to bottom, and the columns are numbered 1 through n from left to right. At the far side of the room lies a door locked with evil magical forces. The following inscriptions are written on the door:

The cleaning of all evil will awaken the door!
Being a very senior adventurer, you immediately realize what this means. You notice that every single cell in the grid are initially evil. You should purify all of these cells.

The only method of tile purification known to you is by casting the "Purification" spell. You cast this spell on a single tile — then, all cells that are located in the same row and all cells that are located in the same column as the selected tile become purified (including the selected tile)! It is allowed to purify a cell more than once.

You would like to purify all n × n cells while minimizing the number of times you cast the "Purification" spell. This sounds very easy, but you just noticed that some tiles are particularly more evil than the other tiles. You cannot cast the "Purification" spell on those particularly more evil tiles, not even after they have been purified. They can still be purified if a cell sharing the same row or the same column gets selected by the "Purification" spell.

Please find some way to purify all the cells with the minimum number of spells cast. Print -1 if there is no such way.

Input
The first line will contain a single integer n (1 ≤ n ≤ 100). Then, n lines follows, each contains n characters. The j-th character in the i-th row represents the cell located at row i and column j. It will be the character 'E' if it is a particularly more evil cell, and '.' otherwise.

Output
If there exists no way to purify all the cells, output -1. Otherwise, if your solution casts x "Purification" spells (where x is the minimum possible number of spells), output x lines. Each line should consist of two integers denoting the row and column numbers of the cell on which you should cast the "Purification" spell.

Examples
Input

3
.E.
E.E
.E.

Output

1 1
2 2
3 3

Input

3
EEE
E..
E.E

Output

-1

Input

5
EE.EE
E.EE.
E...E
.EE.E
EE.EE

Output

3 3
1 3
2 2
4 4
5 3

Note
The first example is illustrated as follows. Purple tiles are evil tiles that have not yet been purified. Red tile is the tile on which "Purification" is cast. Yellow tiles are the tiles being purified as a result of the current "Purification" spell. Green tiles are tiles that have been purified previously.

In the second example, it is impossible to purify the cell located at row 1 and column 1.

For the third example:

题目大意：就是给你一个N阶的方阵，然后 其中的E是代表这个点是需要进行净化的，其中净化的意思就是选择一个点这个点的同行同列都会净化完毕，不可以选择E点净化，一开始是E的点始终是不能作为净化点的，问你用最少的步数净化完毕并输出你选择的要净化的点

思路：这个题目的话，我觉得是一个找一些规律的题目，下面给出几个图：（其中红色代表E点）

1.

这样的很显然是可以净化完毕的，因为所有的列上的E我们可以通过不同行的进行净化。

2.

这样的显然是不可以的，因为我们无法对<1,1>点进行净化

3.

这样的也是不可以的，因为这样的我用蓝笔标注的点是净化不到的

4.

这样的是可以的，我们都可以净化得到

-

PS：想到这个我总是想起我们线代老师讲行列式的课的时候的行列式为0的情况。。。。

代码：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=110;
int row[maxn],col[maxn];
int n;
char mp[maxn][maxn];
int main()
{
    scanf("%d",&n);
    bool r=true,c=true;
    for(int i=1; i<=n; i++)
        scanf("%s",mp[i]+1);
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(mp[i][j]=='E')
                row[i]++,col[j]++;
            if(row[i]==n)
                r=false;
            if(col[j]==n)
                c=false;
            if(!r&&!c)
            {
                cout<<"-1"<<endl;
                return 0;
            }
        }
    }
    if(c)
    {
        for(int j=1;j<=n;j++){
            for(int i = 1;i<=n;i++){
                if(mp[i][j]=='.'){
                    printf("%d %d\n",i,j);
                    break;
                }
            }
        }

    }
    else
    {
        for(int i = 1;i <= n;i++)
            for(int j = 1;j <= n;j++)
                if(mp[i][j]=='.'){
                    printf("%d %d\n",i,j);
                    break;
                }
    }
}