Codeforces Round #363 (Div. 2)[B]One Bomb

最新推荐文章于 2018-07-18 17:00:07 发布

真·skysys

最新推荐文章于 2018-07-18 17:00:07 发布

阅读量464

点赞数 1

CC 4.0 BY-SA版权

分类专栏：算法与数学文章标签： codeforces

请明确标注出处

本文链接：https://blog.csdn.net/qq_33583069/article/details/51963973

算法与数学专栏收录该内容

469 篇文章 ¥29.90 ¥99.00

订阅专栏

超级会员免费看

在给定的n×m矩形格子中，你需要放置一枚炸弹，它能清除所在行和列的所有墙壁。判断是否可能仅用一枚炸弹清除所有墙壁。输入包含格子的描述，输出是否可行及最佳放置位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B. One Bomb
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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