Codeforces Round #363 (Div. 2) B. One Bomb

B. One Bomb
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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

题意：给你一个$n*m$的地图，上面会有一些石头，然后给你一个炸弹，这个炸弹选择一个爆破点之后会把这个爆破点所处的行和列都爆破，这个点可以是石头，也可以是空地，问是否可以找到一个爆破点使得所有的石头都被消灭。

思路：记录头数总数和每行每列所有的石头数，然后枚举点查看是否该点的行石头数＋列石头数＝总石头数，注意当前点是石头的情况。

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
#define eps 1e-8
using namespace std;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
double dpow(double a,ll b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
//head
char str[1010][1010];
int h[1010],l[1010];
int main(){
    int n,m;scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++) scanf("%s",str[i]);
    int x,y;int cnt=0;mem(h),mem(l);
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(str[i][j]=='*')
                h[i]++,cnt++;
        }
    }
    for(int j=0;j<m;j++){
        for(int i=0;i<n;i++){
            if(str[i][j]=='*')
                l[j]++;
        }
    }
    int flag=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            int sum=h[i]+l[j];
            if(str[i][j]=='*') sum--;
            if(sum>=cnt){
                flag=1,x=i+1,y=j+1;
            }
        }
    }
    if(!flag) printf("NO\n");
    else printf("YES\n%d %d\n",x,y);
    return 0;
}