The Labyrinth CodeForces - 616C

最新推荐文章于 2020-10-11 09:35:04 发布

原创

最新推荐文章于 2020-10-11 09:35:04 发布 · 394 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#XUPT寒假训练

这篇博客介绍了CodeForces上的一道编程题616C - The Labyrinth，讨论了如何处理一个包含障碍物的矩形网格，计算每个障碍物如果变为可通行单元时，其所属的连通组件大小。博主提供了思路，即预先标记连通区域并记录其大小，然后计算障碍物相邻的未在同一连通区域的单元格数量，作为答案的一部分。

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

The Labyrinth CodeForces - 616C

题目描述
You are given a rectangular field of n × m cells. Each cell is either empty or impassable (contains an obstacle). Empty cells are marked with ‘.’, impassable cells are marked with ‘*’. Let’s call two empty cells adjacent if they share a side.

Let’s call a connected component any non-extendible set of cells such that any two of them are connected by the path of adjacent cells. It is a typical well-known definition of a connected component.

For each impassable cell (x, y) imagine that it is an empty cell (all other cells remain unchanged) and find the size (the number of cells) of the connected component which contains (x, y). You should do it for each impassable cell independently.

The answer should be printed as a matrix with n rows and m columns. The j-th symbol of the i-th row should be “.” if the cell is empty at the start. Otherwise the j-th symbol of the i-th row should contain the only digit —- the answer modulo 10. The matrix should be printed without any spaces.

To make your output faster it is recommended to build the output as an array of n strings having length m and print it as a sequence of lines. It will be much faster than writing character-by-character.

Input
The first line contains two integers n, m (1 ≤ n, m ≤ 1000) — the number of rows and columns in the field.
Each of the next n lines contains m symbols: “.” for empty cells, “*” for impassable cells.

Output
Print the answer as a matrix as described above. See the examples to precise the format of the output.