I - 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

#include <iostream>

using namespace std;

int main()
{
    int a,b,i,j,t=0,k,g,h=0,c=0,x,y;
    char s[1010][1010];
    cin >> a >> b;
    for(i=1; i<=a; i++)
    {
        cin >> s[i];
    }
    for(i=1; i<=a; i++)
    {
        for(j=0; j<b; j++)
        {
            if(s[i][j]=='*')
            {
                t++;
            }
        }
    }
    if(t==0)
    {
        cout << "YES" << endl;
        cout << 1 << " " << 1 << endl;
    }
    else
    {
        for(i=1; i<=a; i++)
        {
            for(j=0; j<b; j++)
            {
                if(s[i][j]=='*')
                {
                    h=0;
                    for(k=1; k<=a; k++)
                    {
                        if(s[k][j]=='*')
                        {
                            h++;
                        }
                    }
                    for(g=0; g<b; g++)
                    {
                        if(s[i][g]=='*')
                        {
                            h++;
                        }
                    }
                    h=h-1;
                    if(h==t)
                    {
                        c=1;
                        x=i;
                        y=j+1;
                        break;
                    }
                }
                else
                {
                    h=0;
                    for(k=1; k<=a; k++)
                    {
                        if(s[k][j]=='*')
                        {
                            h++;
                        }
                    }
                    for(g=0; g<b; g++)
                    {
                        if(s[i][g]=='*')
                        {
                            h++;
                        }
                    }
                    if(h==t)
                    {
                        c=1;
                        x=i;
                        y=j+1;
                        break;
                    }
                }
            }
            if(c==1)
            {
                break;
            }
        }
        if(c==1)
        {
            cout << "YES" << endl;
            cout << x << " " << y << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
}
#include <iostream>

using namespace std;

int main()
{
    int a,b,i,j,t=0,c=0,x,y;
    char s[1010][1010];
    int n[1010];
    int m[1010];
    cin >> a >> b;
    for(i=1; i<=a; i++)
    {
        cin >> s[i];
    }
    for(i=1; i<=a; i++)
    {
        for(j=0; j<b; j++)
        {
            if(s[i][j]=='*')
            {
                t++;
                n[i]++;
                m[j]++;
            }
        }
    }
    if(t==0)
    {
        cout << "YES" << endl;
        cout << 1 << " " << 1 << endl;
    }
    else
    {
        for(i=1; i<=a; i++)
        {
            for(j=0; j<b; j++)
            {
                if(s[i][j]=='*')
                {
                    if(n[i]+m[j]-1==t)
                    {
                        c=1;
                        x=i;
                        y=j+1;
                        break;
                    }
                }
                else
                {
                    if(n[i]+m[j]==t)
                    {
                        c=1;
                        x=i;
                        y=j+1;
                        break;
                    }
                }
            }
            if(c==1)
            {
                break;
            }
        }
        if(c==1)
        {
            cout << "YES" << endl;
            cout << x << " " << y << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
    return 0;
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

ZZ --瑞 hopeACMer

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值