Complete the Word CodeForces 716B
Complete the Word
Time Limit:2000MS Memory Limit:
Description
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?
Input
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.
Output
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.
Sample Input
Input
ABC??FGHIJK???OPQR?TUVWXY?
Output
ABCDEFGHIJKLMNOPQRZTUVWXYS
Input
WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO
Output
-1
Input
??????????????????????????
Output
MNBVCXZLKJHGFDSAQPWOEIRUYT
Input
AABCDEFGHIJKLMNOPQRSTUVW??M
Output
-1
Hint
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.
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.
In the third sample case, any string of length 26 that contains all letters of the English alphabet fits as an answer.
思路：暴力 剛開始掉坑去了。。先說一下題意吧，讓你在一個字串中找一個完美的單詞，這個完美的單詞應該滿足長度為26，並且包含26個字母，找到後輸出原串和改變後的完美的單詞（這裡剛開始理解不對，說一下需要注意的幾點吧： 1. 輸出原來的字串並且不改變順序 2. 輸出的串中不能再包含問號 3. 完美的單詞中單詞順序任意，但不能改變原有的字母，只是問號的地方可以任意賦值）
分析幾個樣例：
Input
ABC??FGHIJK???OPQR?TUVWXY?
Output
ABCDEFGHIJKLMNOPQRZTUVWXYS 這個樣例其實S和Z的位置可以換得 ABCDEFGHIJKLMNOPQRSTUVWXYZ 也對
Input
ABABABBAB????????????ABABABABA???????????ABABABABA?????????KLCSJB?????????Z
Output
ABABABBABAAAAAAAAAAAAABABABABAAAAAAAAAAAAABABABABADEFGHIMNOKLCSJBPQRTUVWXYZ
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define eps 1e-9
#define MAXN 1e5+10
int main()
{
string s;
cin>>s;
int len=s.size();
int i,j,k;
if(len<26)
cout<<"-1"<<endl;
else
{
int g=0;
for(i=0; i<=len-26; i++)
{
string t;
t=s.substr(i,26);
set<char> sett;
map<char,int> mapp;
k=0;
for(j=0; j<26; j++)
{
if(t[j]=='?')
k++;
else
{
sett.insert(t[j]);
mapp[t[j]]++;
}
}
if(sett.size()+k==26)
{
for(j=0;j<i;j++)
{
if(s[j]=='?')
cout<<"A";
else
cout<<s[j];
}
queue<char> q;
for(j='A'; j<='Z'; j++)
{
if(!mapp[j])
q.push(j);
}
for(j=0;j<26;j++)
{
if(t[j]!='?')
cout<<t[j];
else
{
char w=q.front();
cout<<w;
q.pop();
}
}
g++;
for(j=i+26;j<len;j++)
{
if(s[j]=='?')
cout<<"A";
else
cout<<s[j];
}
}
if(g)
break;
}
if(g==0)
cout<<"-1"<<endl;
}
return 0;
}