One Bomb
来源:互联网 发布:公司数据安全 编辑:程序博客网 时间:2024/05/13 13:11
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.
Sample Input
3 4.*.......*..
YES1 2
3 3..*.*.*..
NO
6 5..*....*..*****..*....*....*..
YES3 3
#include<map>#include<set>#include<cmath>#include<queue>#include<bitset>#include<math.h>#include<vector>#include<string>#include<stdio.h>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int maxn=1000+10;char a[maxn][maxn];int b1[maxn];int b2[maxn];int main(){memset(b1,0,sizeof(b1));memset(b2,0,sizeof(b2));int n,m;scanf("%d%d",&n,&m);int i,j,i1,i2;int k1=0;for(i=1;i<=n;i++)for(j=0;j<=m;j++){scanf("%c",&a[i][j]);if(a[i][j]=='*'){b2[j]++;b1[i]++;k1++;}}for(i=1;i<=n;i++)for(j=1;j<=m;j++)if(b1[i]+b2[j]==k1+1){printf("YES\n");printf("%d %d\n",i,j);return 0;}else if(b1[i]+b2[j]==k1&&a[i][j]!='*'){printf("YES\n");printf("%d %d\n",i,j);return 0;}printf("NO\n");return 0;}
- One Bomb
- One Bomb
- One Bomb
- Codeforces699B One Bomb 暴力
- 699B - One Bomb
- Codeforces #363 One Bomb
- B - One Bomb
- B. One Bomb
- Codeforces 699A One Bomb
- Codeforces-Round-#363- One Bomb
- Codeforces 699B One Bomb
- codeforces 699B One Bomb
- codeforces 699B One Bomb
- Codeforces 699B - One Bomb
- Codeforces-699B One Bomb
- CodeForces 699B One Bomb
- CodeForces 699B One Bomb
- CodeForces 699B One Bomb
- 无间道之并查集_hihoCoder
- Linux中SWAP交换分区概述
- 一、如何爬取链家网页房源信息
- UVA232 UVALive5171 POJ1888 Crossword Answers
- Git 是一个分布式版本控制工具
- One Bomb
- Android之线程池
- 写一个 ButterKnife
- Ubuntu16.04LTS 安装flash player
- s-palindrome
- linux下创建用户
- linux基础——经典线程同步问题解析及编程实现
- 剑指offer第10题:二进制中1的个数
- Ubuntu 16.04设置静态IP地址(NAT方式)