989B.md (2536B)
1 Source: https://codeforces.com/problemset/problem/989/B 2 3 B. A Tide of Riverscape 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21 Walking along a riverside, Mino silently takes a note of something. 22 23 "Time," Mino thinks aloud. 24 25 "What?" 26 27 "Time and tide wait for no man," explains Mino. "My name, taken from the river, always reminds me of this." 28 29 "And what are you recording?" 30 31 "You see it, tide. Everything has its own period, and I think I've figured out this one," says Mino with confidence. 32 33 Doubtfully, Kanno peeks at Mino's records. 34 35 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). 36 37 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. 38 39 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$. 40 41 Input 42 43 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. 44 45 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. 46 47 Output 48 49 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)). 50 51 Examples 52 53 Input 54 55 ``` 56 10 7 57 1.0.1.0.1. 58 ``` 59 60 Output 61 62 ``` 63 1000100010 64 ``` 65 66 Input 67 68 ``` 69 10 6 70 1.0.1.1000 71 ``` 72 73 Output 74 75 ``` 76 1001101000 77 ``` 78 79 Input 80 81 ``` 82 10 9 83 1........1 84 ``` 85 86 Output 87 88 ``` 89 No 90 ``` 91 92 Note 93 94 In the first example, $7$ is not a period of the resulting string because the $1$-st and $8$-th characters of it are different. 95 96 In the second example, $6$ is not a period of the resulting string because the $4$-th and $10$-th characters of it are different. 97 98 In the third example, $9$ is always a period because the only constraint that the first and last characters are the same is already satisfied. 99 100 Note that there are multiple acceptable answers for the first two examples, you can print any of them.