CF989B.A Tide of Riverscape

普及-

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

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

题目描述

Walking along a riverside, Mino silently takes a note of something.

"Time," Mino thinks aloud.

"What?"

"Time and tide wait for no man," explains Mino. "My name, taken from the river, always reminds me of this."

"And what are you recording?"

"You see it, tide. Everything has its own period, and I think I've figured out this one," says Mino with confidence.

Doubtfully, Kanno peeks at Mino's records.

The records are expressed as a string ss of characters '0', '1' and '.', where '0' denotes a low tide, '1' denotes a high tide, and '.' denotes an unknown one (either high or low).

You are to help Mino determine whether it's possible that after replacing each '.' independently with '0' or '1', a given integer pp is not a period of the resulting string. In case the answer is yes, please also show such a replacement to Mino.

In this problem, a positive integer pp is considered a period of string ss, if for all 1≤i≤∣s∣−p1 \leq i \leq \lvert s \rvert - p, the ii-th and (i+p)(i + p)-th characters of ss are the same. Here ∣s∣\lvert s \rvert is the length of ss.

沿着河岸漫步,美浓静静地记录着什么。

“时间。”美浓大声说道。

“什么?”

“时光与潮汐不等人。”美浓解释道,“我的名字取自河流,总让我想起这句话。”

“那你正在记录什么呢?”

“你看到了,潮汐。万物皆有其周期,而我认为我已经弄清了这个周期。”美浓自信地说。

康野半信半疑地瞥了一眼美浓的记录。

这些记录以一个字符串 ss 表示,其中字符为 '0'、'1' 和 '.':'0' 表示低潮,'1' 表示高潮,'.' 表示未知状态(即该位置可能是高潮或低潮)。

你需要帮助美浓判断:是否存在一种方式,将每个 '.' 独立地替换为 '0' 或 '1',使得给定的正整数 pp 不是最终所得字符串的一个周期。若答案为“是”,请同时给出这样一种替换方案供美浓参考。

在本题中,正整数 pp 被称为字符串 ss 的一个周期,当且仅当对所有满足 1≤i≤∣s∣−p1 \leq i \leq \lvert s \rvert - p 的 ii,字符串 ss 的第 ii 个字符与第 (i+p)(i + p) 个字符完全相同。其中 ∣s∣\lvert s \rvert 表示字符串 ss 的长度。

输入格式

The first line contains two space-separated integers nn and pp (1≤p≤n≤20001 \leq p \leq n \leq 2000) — the length of the given string and the supposed period, respectively.

The second line contains a string ss of nn characters — Mino's records. ss only contains characters '0', '1' and '.', and contains at least one '.' character.

第一行包含两个以空格分隔的整数 nn 和 pp(1≤p≤n≤20001 \leq p \leq n \leq 2000),分别表示给定字符串的长度和假设的周期。

第二行包含一个长度为 nn 的字符串 ss —— Mino 的记录。ss 仅包含字符 '0'、'1' 和 '.',且至少包含一个 '.' 字符。

输出格式

Output one line — if it's possible that pp is not a period of the resulting string, output any one of such strings; otherwise output "No" (without quotes, you can print letters in any case (upper or lower)).

输出一行:如果可能存在 pp 不是结果字符串的周期的情况,则输出任意一个满足该条件的字符串;否则输出 "No"(不带引号,字母大小写均可)。

输入输出样例

  • 输入#1

    10 7
    1.0.1.0.1.

    输出#1

    1000100010
  • 输入#2

    10 6
    1.0.1.1000

    输出#2

    1001101000
  • 输入#3

    10 9
    1........1

    输出#3

    No

说明/提示

In the first example, 77 is not a period of the resulting string because the 11-st and 88-th characters of it are different.

In the second example, 66 is not a period of the resulting string because the 44-th and 1010-th characters of it are different.

In the third example, 99 is always a period because the only constraint that the first and last characters are the same is already satisfied.

Note that there are multiple acceptable answers for the first two examples, you can print any of them.

在第一个例子中,77 不是结果字符串的周期,因为该字符串的第 11 个字符与第 88 个字符不同。

在第二个例子中,66 不是结果字符串的周期,因为该字符串的第 44 个字符与第 1010 个字符不同。

在第三个例子中,99 恒为周期,因为唯一约束条件——首字符与末字符相同——已经满足。

注意,前两个例子存在多个可接受的答案,你可以输出其中任意一个。

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

首页