【codeforces】-699B-One Bomb（思维）

来源：互联网发布：java ftp断点续传下载编辑：程序博客网时间：2024/06/06 03:38

点击打开链接

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
YES1 2
input
3 3..*.*.*..
output
NO
input
6 5..*....*..*****..*....*....*..
output
YES3 3

1记录每行每列炸弹的数目

2for循环扫：1‘是炸弹判断其行和列的炸弹和减一是不是总炸弹数，是输出位置。

2’不是炸弹判断其行和列炸弹和是不是总炸弹数，是输出位置

#include<cstdio>#include<cstring>int main(){char c[1010][1010];int a[1010]={0},b[1010]={0};int h,w;scanf("%d %d",&h,&w);getchar();//下面输入字符，上面换行要用getchar();int num=0;for(int i=1;i<=h;i++){for(int j=1;j<=w;j++){scanf("%c",&c[i][j]);if(c[i][j]=='*'){a[i]++;//记录行的炸弹数 b[j]++;//记录列的炸弹数 num++;//总的炸弹数 }}getchar();//换行，用getchar(); }int flag=0;for(int i=1;i<=h;i++){for(int j=1;j<=w;j++){if(c[i][j]=='*'){if(a[i]+b[j]-1==num)//c是炸弹减去本身多加的一判断行列和是不是总的数目 {printf("YES\n%d %d\n",i,j);flag=1;break;}}else{if(a[i]+b[j]==num)//c不是炸弹，判断行列和是不是炸弹总数 {printf("YES\n%d %d\n",i,j);flag=1;break;}}}if(flag)//注意此时的连续跳出 break;}if(!flag)printf("NO\n");return 0;}

0 0