CodeForces 699B One Bomb(暴力）

You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (".") or it can be occupied by a wall ("*").

You have one bomb. If you lay the bomb at the cell (x, y), then after triggering it will wipe out all walls in the row x and all walls in the column y.

You are to determine if it is possible to wipe out all walls in the depot by placing and triggering exactly one bomb. The bomb can be laid both in an empty cell or in a cell occupied by a wall.

Input
The first line contains two positive integers n and m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the depot field.

The next n lines contain m symbols "." and "*" each — the description of the field. j-th symbol in i-th of them stands for cell (i, j). If the symbol is equal to ".", then the corresponding cell is empty, otherwise it equals "*" and the corresponding cell is occupied by a wall.

Output
If it is impossible to wipe out all walls by placing and triggering exactly one bomb, then print "NO" in the first line (without quotes).

Otherwise print "YES" (without quotes) in the first line and two integers in the second line — the coordinates of the cell at which the bomb should be laid. If there are multiple answers, print any of them.Examples

input
3 4
.*..
....
.*..
output
YES
1 2
input
3 3
..*
.*.
*..
output
NO
input
6 5
..*..
..*..
*****
..*..
..*..
..*..
output
YES

3 3

思路：先找到一个点A1，枚举与这个点不同排不同列的另一个点A2。找到两个可以同时打到A1,A2的位置B1,B2，即在A1,A2处画十字线的交点。然后判断在B1或B2上放炸弹能否炸掉所有墙。

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

char s[1005][1005];

int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%s",s[i]);
        }
        int x1=-1,y1=-1,x2=-1,y2=-1;   //x1.y1为A1坐标，x2.y2为A2坐标
        int k=-1;
        int flag1=0;
        for(int j=0;j<n;j++)
        {
            for(int i=0;i<m;i++)
            {
                if(s[j][i]=='*')
                {
                    x1=j;
                    y1=i;
                    k=j;
                    flag1=1;
                    break;
                }
            }
            if(flag1==1) break;
        }
        flag1=0;
        for(int j=k+1;j<n;j++)
        {
            for(int i=0;i<m;i++)
            {
                if(s[j][i]=='*'&&i!=y1)
                {
                    x2=j;
                    y2=i;
                    flag1=1;
                    break;
                }
            }
            if(flag1==1) break;
        }
        if(x1==-1)   //没有找到A1,说明没有墙,直接输出1，1的位置
        {
            cout<<"YES"<<endl;
            cout<<"1 1"<<endl;
        }
        else if(x2==-1)   //没有找到A2,说明其他的墙都与A1同排或同列，则直接在A1处放炸弹
        {
            cout<<"YES"<<endl;
            cout<<x1+1<<" "<<y1+1<<endl;
        }
        else
        {
            int x=x1,y=y2;
            int flag=0;
            for(int i=0;i<n;i++)
            {
                for(int j=0;j<m;j++)
                {
                    if(s[i][j]=='*'&&i!=x&&j!=y)   
                    {
                        flag=1;
                        break;
                    }
                }
                if(flag==1) break;
            }
            if(flag==0)
            {
                cout<<"YES"<<endl;
                cout<<x+1<<" "<<y+1<<endl;
            }
            else
            {
                x=x2,y=y1;
                flag=0;
                for(int i=0;i<n;i++)
                {
                    for(int j=0;j<m;j++)
                    {
                        if(s[i][j]=='*'&&i!=x&&j!=y)
                        {
                            flag=1;
                            break;
                        }
                    }
                    if(flag==1) break;
                }
                if(flag==0)
                {
                    cout<<"YES"<<endl;
                    cout<<x+1<<" "<<y+1<<endl;
                }
                else
                {
                    cout<<"NO"<<endl;
                }
            }
        }
    }
    return 0;
}