Codeforces 716B Complete the Word【模拟】 (Codeforces Round #372 (Div. 2))

B. Complete the Word

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Examples

input

ABC??FGHIJK???OPQR?TUVWXY?

output

ABCDEFGHIJKLMNOPQRZTUVWXYS

input

WELCOMETOCODEFORCESROUNDTHREEHUNDREDANDSEVENTYTWO

output

-1

input

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

output

MNBVCXZLKJHGFDSAQPWOEIRUYT

input

AABCDEFGHIJKLMNOPQRSTUVW??M

output

-1

Note

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.

题目链接：

　　http://codeforces.com/contest/716/problem/B

题目大意：

　　给你一个长度为N(N<=100000)只含大写字母和'?'的字符串，其中'?'可以被任意大写字母替换，问这个字符串是否能够含有一个连续的长度为26的子串，使得每个大写字母只出现一次。

题目思路：

　　【模拟】

　　枚举左右端点I和J，并且记录最后一个大写字母出现的位置，如果这个字母已经出现过并且最后出现的位置X在I之后，那么直接把I移动到X+1，继续做，直到I~J的长度为26

　　接下来对于'?'只要从I到J依次填入没出现过的字母，其余不在I~J的随意填。

 

//
//by coolxxx
//#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<map>
#include<stack>
#include<queue>
#include<set>
#include<bitset>
#include<memory.h>
#include<time.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
//#include<stdbool.h>
#include<math.h>
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define abs(a) ((a)>0?(a):(-(a)))
#define lowbit(a) (a&(-a))
#define sqr(a) ((a)*(a))
#define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
#define mem(a,b) memset(a,b,sizeof(a))
#define eps (1e-10)
#define J 10000
#define mod 1000000007
#define MAX 0x7f7f7f7f
#define PI 3.14159265358979323
#pragma comment(linker,"/STACK:1024000000,1024000000")
#define N 50004
using namespace std;
typedef long long LL;
double anss;
LL aans;
int cas,cass;
int n,m,lll,ans;
char s[N];
int mark[30];
int main()
{
	#ifndef ONLINE_JUDGEW
//	freopen("1.txt","r",stdin);
//	freopen("2.txt","w",stdout);
	#endif
	int i,j,k;
	int x,y,z;
//	init();
//	for(scanf("%d",&cass);cass;cass--)
//	for(scanf("%d",&cas),cass=1;cass<=cas;cass++)
	while(~scanf("%s",s))
//	while(~scanf("%d",&n))
	{
		n=strlen(s);
		mem(mark,-1);
		if(n<26){puts("-1");continue;}
		for(i=0,j=0;j<n;j++)
		{
			if(s[j]=='?')
			{
				if(j-i==25)break;
				continue;
			}
			k=s[j]-'A';
			if(mark[k]!=-1)
			{
				i=max(i,mark[k]+1);
				mark[k]=j;
			}
			else mark[k]=j;
			if(j-i==25)break;
		}
		if(j==n || j-i<25)puts("-1");
		else
		{
			x=0;
			for(k=i;k<=j;k++)
			{
				if(s[k]=='?')
				{
					for(;x<26 && mark[x]!=-1;x++);
					s[k]=x+'A';mark[x]=i;
				}
			}
			for(i=0;i<n;i++)
				if(s[i]=='?')s[i]='A';
			puts(s);
		}
	}
	return 0;
}
/*
//

//
*/