Codeforces Round #363 (Div. 2) B

Description

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
我们用num记录有多少的*,拿x[i]记录第i行有多少*,拿y[j]记录第j列有多少*,有x[i]+y[j]==num+1||num的情况,就是符合要求的
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include<bits/stdc++.h>
using namespace std;
int n;
#define INF 1<<30
int L[200005];
int R[200005];
int num[200005];
string s;
int a;
 
int main()
{
    /*int coL=0;
    int coR=0;
    cin>>n;
    cin>>s;
    for(int i=0; i<n; i++)
    {
        cin>>num[i];
    }
    if(n==1)
    {
        puts("-1");
    }
    else
    {
        int MIN=INF;
        for(int i=1; i<n; i++)
        {
            if(s[i]=='L'&&s[i-1]=='R')
            {
                MIN=min(MIN,num[i]-num[i-1]);
            }
        }
        if(MIN==INF)
        {
            puts("-1");
        }
        else
        {
            printf("%d\n",MIN/2);
        }
    }*/
    char a[1005][1005];
    int ax[1100],bx[1100];
    int n,m;
    int num=0;
    cin>>n>>m;
    for(int i=0; i<n; i++)
    {
        scanf("%s",a[i]);
    }
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
          //  cout<<a[i][j]<<" ";
            if(a[i][j]=='*')
            {
                //cout<<"A"<<endl;
                ax[i]++;
                bx[j]++;
                num++;
            }
        }
      //  cout<<endl;
    }
  //  cout<<num<<endl;
    int px=-1,py=-1;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(a[i][j]=='*')
            {
                if(ax[i]+bx[j]==num+1)
                {
                    px=i;
                    py=j;
                    break;
                }
            }
            else
            {
                if(ax[i]+bx[j]==num)
                {
                    px=i;
                    py=j;
                    break;
                }
            }
        }
    }
    if(px==-1||py==-1)
    {
        cout<<"NO"<<endl;
    }
    else
    {
        cout<<"YES"<<endl;
        cout<<px+1<<" "<<py+1<<endl;
    }
    return 0;
}

  

posted @   樱花落舞  阅读(307)  评论(0编辑  收藏  举报
编辑推荐:
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
阅读排行:
· TypeScript + Deepseek 打造卜卦网站:技术与玄学的结合
· Manus的开源复刻OpenManus初探
· AI 智能体引爆开源社区「GitHub 热点速览」
· 从HTTP原因短语缺失研究HTTP/2和HTTP/3的设计差异
· 三行代码完成国际化适配,妙~啊~
点击右上角即可分享
微信分享提示