codeforces 699B One Bomb （思维）

最新推荐文章于 2022-01-12 00:30:00 发布

fushenliao

最新推荐文章于 2022-01-12 00:30:00 发布

阅读量512

点赞数

文章标签： acm codeforces

本文链接：https://blog.csdn.net/night_13/article/details/51969234

版权

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 <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

typedef long long LL;
const int INF = 0x7fffffff;
const int MAXN = 1e3 + 10;
int n, m;
char g[MAXN][MAXN];
int row[MAXN], column[MAXN];

int main() { 
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
#endif
    while (scanf("%d%d", &n, &m) != EOF) {
        for (int i = 1; i <= n; ++i) {
            scanf("%s", g[i] + 1);
        }
        memset(row, 0, sizeof(row));
        memset(column, 0, sizeof(column));
        int num = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (g[i][j] == '*') {
                    ++row[i];
                    ++column[j];
                    ++num;
                }
            }
        }
        bool yes = false;
        for (int i = 1; i <= n && !yes; ++i) {
            for (int j = 1; j <= m; ++j) {
                if (g[i][j] == '*' && row[i] + column[j] - 1 == num ||
                    g[i][j] != '*' && row[i] + column[j] == num) {
                    printf("YES\n%d %d\n", i, j);
                    yes = true;
                    break;
                }
            }
        }
        if (!yes) printf("NO\n");
    }
    return 0;
}