305200: CF989B. A Tide of Riverscape
Memory Limit:256 MB
Time Limit:1 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
A Tide of Riverscape
题意翻译
**题目大意:** 给定一个由'0','1','.'构成的字符串,问可不可能无论'.'是什么,这个字符串都存在长度为$p$的周期 **输入格式:** 一行两个数,$n,p$,$1<=p<=n<=2000$ 以下一行,一个长度为$n$的字符串 **输出格式:** 如果不满足条件,输出不满足条件的字符串(把'.'用'0'或'1'替换),否则输出"No" 感谢@守望 提供翻译题目描述
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 $ s $ 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 $ p $ 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 $ p $ is considered a period of string $ s $ , if for all $ 1 \leq i \leq \lvert s \rvert - p $ , the $ i $ -th and $ (i + p) $ -th characters of $ s $ are the same. Here $ \lvert s \rvert $ is the length of $ s $ .输入输出格式
输入格式
The first line contains two space-separated integers $ n $ and $ p $ ( $ 1 \leq p \leq n \leq 2000 $ ) — the length of the given string and the supposed period, respectively. The second line contains a string $ s $ of $ n $ characters — Mino's records. $ s $ only contains characters '0', '1' and '.', and contains at least one '.' character.
输出格式
Output one line — if it's possible that $ p $ 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)).
输入输出样例
输入样例 #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