A10662 | $Complete the Word$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

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. 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?

The first and only line of the input contains a single string $s$ ( $1<=|s|<=50000$ ), 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.

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. 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. If there are multiple solutions, you may print any of them.

输入 #1

ABC??FGHIJK???OPQR?TUVWXY?

输出 #1

ABCDEFGHIJKLMNOPQRZTUVWXYS

输入 #2

WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO

输出 #2

-1

输入 #3

??????????????????????????

输出 #3

MNBVCXZLKJHGFDSAQPWOEIRUYT

输入 #4

AABCDEFGHIJKLMNOPQRSTUVW??M

输出 #4

-1

C++ 编辑器

输入

输出