Complete the Word.cpp

#include<bits/stdc++.h>
 
using namespace std ;
 
typedef double D ;
typedef long long ll ;
typedef long double ld ;
typedef unsigned int ui ;
typedef unsigned long long ull ;
 
# define F first
# define S second
# define R return
# define C continue 
# define pb push_back 
# define pf push_front
# define mp make_pair
 
# define vi vector <int>
# define vb vector <bool>
# define vll vector <ll>
# define vs vector <string>
 
# define vvi vector < vector < int > >
# define vvb vector < vector < bool > >
# define vvc vector < vector < char > >
# define vvll vector < vector < ll > >
# define vvd vector < vector < D > >
# define vvld vector < vector < ld > >
 
# define pii pair < int , int >
# define pll pair < ll , ll >
# define pld pair < ld , ld >
# define pDD pair < D , D >
 
# define vpld vector < pld >
# define vpii vector < pii >
# define vpll vector < pll >
# define vpDD vector < pDD >
# define vvpii vector < vector < pii > >
 
# define all(v) (v).begin() , (v).end()
# define allrev(v) (v).rbegin() , (v).rend()
# define allcomp(v) v.begin() , v.end() , comp
# define allrevcomp(v) v.rbegin() , v.rend() , comp
 
# define Fi(i,L,R) for (int i = L ; i <= R ; i++)
# define Fd(i,R,L) for (int i = R ; i >= L ; i--)

# define FAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
 
# define dist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
 
const ll MOD = 1e9 + 7 ;
const int infi =  INT_MAX ;
const ll infll =  LLONG_MAX ;
const ld PI = 3.1415926535897932384626 ;
 
////////////////////////////////////////////////////////////////////////////////////////////////////////////////

string s ;
int len ;
int cnt[27] ;

/////////////////////////////////////////////

bool isok()
{
	for (int i = 0 ; i < 26 ; ++i)
	{
		if (cnt[i] > 1)
		    return false ;
	}
	return true ;
}

void AAA()
{
	for (int i = 0 ; i < len ; ++i)
	{
		if (s[i] == '?')
		    s[i] = 'A' ;
	}
}

void solve (int test_case)
{
	cin >> s ;
	len = s.length() ;
	if (len < 26)
	{
		cout << -1 ;
		R ;
	}
	
	memset(cnt, 0, sizeof(cnt)) ;
	for (int i = 0 ; i < 26 ; ++i)
	    ++cnt[s[i] - 'A'] ;
	
	if (isok())
	{
		int gone = 0 ;
		while(cnt[gone] > 0) ++gone ;
		for (int i = 0 ; i < 26 ; ++i)
		{
			if (s[i] == '?')
			{
				s[i] = gone + 'A' ;
				++gone ;
				while(cnt[gone] > 0) ++gone ;
			}
		}
		
		AAA() ;
		cout << s ;
		R ;
	}
	
	for (int i = 26 ; i < len ; ++i)
	{
		--cnt[s[i-26] - 'A'] ;
		++cnt[s[i] - 'A'] ;
		
		if (isok())
		{
			int gone = 0 ;
			while(cnt[gone] > 0) ++gone ;
			for(int j = i-25 ; j <= i ; ++j)
			{
				if (s[j] == '?')
				{
					s[j] = gone + 'A' ;
					++gone ;
					while(cnt[gone] > 0) ++gone ;
				}
			}
			
			AAA() ;
			cout << s ;
			R ;
		}
	}
	
	cout << -1 ;
}

int main()
{
	//freopen ("input.txt","r",stdin) ;
	//freopen ("output.txt","w",stdout) ;
	
	FAST ;
	int tc = 1 ;
//	cin >> tc ;
	while (tc--) 
	    solve (tc) ;
	return 0 ;
}