CF86B.Tetris revisited

提高+/省选-

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Physicist Woll likes to play one relaxing game in between his search of the theory of everything.

Game interface consists of a rectangular n × m playing field and a dashboard. Initially some cells of the playing field are filled while others are empty. Dashboard contains images of all various connected (we mean connectivity by side) figures of 2, 3, 4 and 5 cells, with all their rotations and reflections. Player can copy any figure from the dashboard and place it anywhere at the still empty cells of the playing field. Of course any figure can be used as many times as needed.

Woll's aim is to fill the whole field in such a way that there are no empty cells left, and also... just have some fun.

Every initially empty cell should be filled with exactly one cell of some figure. Every figure should be entirely inside the board.

In the picture black cells stand for initially filled cells of the field, and one-colour regions represent the figures.

物理学家沃尔喜欢在追寻“万物理论”的间隙玩一款轻松的游戏。

游戏界面由一个 n×mn \times m 的矩形游戏区域和一个控制面板组成。初始时,游戏区域中部分格子已被填充,其余为空。控制面板中包含所有由 2、3、4 和 5 个格子组成的、彼此边相邻的连通图形(含其全部旋转与镜像形式)的图像。玩家可从控制面板中复制任意图形,并将其放置于游戏区域中任意仍为空的格子上。当然,每个图形均可按需多次使用。

沃尔的目标是将整个游戏区域完全填满,不留任何空格,同时……也纯粹为了娱乐。

每个初始为空的格子必须恰好被某个图形中的一个格子所覆盖;每个图形必须完全位于棋盘内部。

图中黑色格子表示游戏区域中初始已被填充的格子,单色区域代表所放置的图形。

输入格式

First line contains integers n and m (1 ≤ n, m ≤ 1000) — the height and the width of the field correspondingly. Next n lines contain m symbols each. They represent the field in a natural way: j-th character of the i-th line is "#" if the corresponding cell is filled, and "." if it is empty.

第一行包含两个整数 nn 和 mm(1≤n,m≤10001 \leq n, m \leq 1000),分别表示场地的高度和宽度。接下来的 nn 行,每行包含 mm 个字符,以自然方式表示该场地:第 ii 行的第 jj 个字符为 # 表示对应格子被填充,为 . 表示对应格子为空。

输出格式

If there is no chance to win the game output the only number "-1" (without the quotes). Otherwise output any filling of the field by the figures in the following format: each figure should be represented by some digit and figures that touch each other by side should be represented by distinct digits. Every initially filled cell should be represented by "#".

如果无法赢得游戏,则仅输出数字“-1”(不带引号)。否则,以如下格式输出棋盘的一种填充方案:每个图形用某个数字表示,且彼此边相邻的图形必须用不同的数字表示。所有初始已填充的格子均用“#”表示。

输入输出样例

  • 输入#1

    2 3
    ...
    #.#

    输出#1

    000
    #0#
  • 输入#2

    3 3
    .#.
    ...
    ..#

    输出#2

    5#1
    511
    55#
  • 输入#3

    3 3
    ...
    .##
    .#.

    输出#3

    -1
  • 输入#4

    1 2
    ##

    输出#4

    ##

说明/提示

In the third sample, there is no way to fill a cell with no empty neighbours.

In the forth sample, Woll does not have to fill anything, so we should output the field from the input.

在第三个样例中,不存在任何一种方式,使得某个格子的所有相邻格子均非空。

在第四个样例中,Woll 无需填充任何格子,因此我们应直接输出输入中的棋盘。

输入解题思路,AI测评打分。不知道怎么写?

首页