codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

716B.md (2579B)


      1 Source: https://codeforces.com/problemset/problem/716/B
      2 
      3 B. Complete the Word
      4 
      5 time limit per test
      6 
      7 2 seconds
      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 ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not nice.
     22 
     23 Now, ZS the Coder tells you a word, where some of its letters are missing as he forgot them. He wants to determine if it is possible to fill in the missing letters so that the resulting word is nice. If it is possible, he needs you to find an example of such a word as well. Can you help him?
     24 
     25 Input
     26 
     27 The first and only line of the input contains a single string *s* (1 ≤ |*s*| ≤ 50 000), the word that ZS the Coder remembers. Each character of the string is the uppercase letter of English alphabet ('A'-'Z') or is a question mark ('?'), where the question marks denotes the letters that ZS the Coder can't remember.
     28 
     29 Output
     30 
     31 If there is no way to replace all the question marks with uppercase letters such that the resulting word is nice, then print  - 1 in the only line.
     32 
     33 Otherwise, print a string which denotes a possible nice word that ZS the Coder learned. This string should match the string from the input, except for the question marks replaced with uppercase English letters.
     34 
     35 If there are multiple solutions, you may print any of them.
     36 
     37 Examples
     38 
     39 Input
     40 
     41 ```
     42 ABC??FGHIJK???OPQR?TUVWXY?
     43 ```
     44 
     45 Output
     46 
     47 ```
     48 ABCDEFGHIJKLMNOPQRZTUVWXYS
     49 ```
     50 
     51 Input
     52 
     53 ```
     54 WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO
     55 ```
     56 
     57 Output
     58 
     59 ```
     60 -1
     61 ```
     62 
     63 Input
     64 
     65 ```
     66 ??????????????????????????
     67 ```
     68 
     69 Output
     70 
     71 ```
     72 MNBVCXZLKJHGFDSAQPWOEIRUYT
     73 ```
     74 
     75 Input
     76 
     77 ```
     78 AABCDEFGHIJKLMNOPQRSTUVW??M
     79 ```
     80 
     81 Output
     82 
     83 ```
     84 -1
     85 ```
     86 
     87 Note
     88 
     89 In the first sample case, ABCDEFGHIJKLMNOPQRZTUVWXYS is a valid answer beacuse it contains a substring of length 26 (the whole string in this case) which contains all the letters of the English alphabet exactly once. Note that there are many possible solutions, such as ABCDEFGHIJKLMNOPQRSTUVWXYZ or ABCEDFGHIJKLMNOPQRZTUVWXYS.
     90 
     91 In the second sample case, there are no missing letters. In addition, the given string does not have a substring of length 26 that contains all the letters of the alphabet, so the answer is  - 1.
     92 
     93 In the third sample case, any string of length 26 that contains all letters of the English alphabet fits as an answer.