#pragma GCC optimize ( "O3" ) #pragma GCC target ( "avx" ) #include #include #include #include #include using namespace std; using ll = long long; #define TYPE_OF( VAR ) remove_const::type >::type #define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) #define CEXPR( LL , BOUND , VALUE ) constexpr const LL BOUND = VALUE #define CIN( LL , A ) LL A; cin >> A #define ASSERT( A , MIN , MAX ) assert( MIN <= A && A <= MAX ) #define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); ASSERT( A , MIN , MAX ) #define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) #define FOREQ( VAR , INITIAL , FINAL ) for( TYPE_OF( FINAL ) VAR = INITIAL ; VAR <= FINAL ; VAR ++ ) #define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) #define QUIT return 0 #define COUT( ANSWER ) cout << ( ANSWER ) << "\n"; using uint = unsigned int; // 入力フォーマットチェック用 // 余分な改行を許さない #define CHECK_REDUNDANT_INPUT string VARIABLE_FOR_CHECK_REDUNDANT_INPUT = ""; cin >> VARIABLE_FOR_CHECK_REDUNDANT_INPUT; assert( VARIABLE_FOR_CHECK_REDUNDANT_INPUT == "" ); assert( ! cin ); // #define CHECK_REDUNDANT_INPUT string VARIABLE_FOR_CHECK_REDUNDANT_INPUT = ""; getline( cin , VARIABLE_FOR_CHECK_REDUNDANT_INPUT ); assert( VARIABLE_FOR_CHECK_REDUNDANT_INPUT == "" ); assert( ! cin ); // |N| <= BOUNDを満たすNをSから構築 #define STOI( S , N , BOUND ) TYPE_OF( BOUND ) N = 0; { bool VARIABLE_FOR_POSITIVITY_FOR_STOI = true; assert( S != "" ); if( S.substr( 0 , 1 ) == "-" ){ VARIABLE_FOR_POSITIVITY_FOR_STOI = false; S = S.substr( 1 ); assert( S != "" ); } assert( S.substr( 0 , 1 ) != " " ); while( S == "" ? false : S.substr( 0 , 1 ) != " " ){ assert( N < BOUND / 10 ? true : N == BOUND / 10 && stoi( S.substr( 0 , 1 ) ) <= BOUND % 10 ); N = N * 10 + stoi( S.substr( 0 , 1 ) ); S = S.substr( 1 ); } if( ! VARIABLE_FOR_POSITIVITY_FOR_STOI ){ N *= -1; } if( S != "" ){ S = S.substr( 1 ); } } // 1行で入力される変数の個数が適切か確認(半角空白の個数+1を調べる) #define COUNT_VARIABLE( S , VARIABLE_NUMBER ) { int size = S.size(); int count = 0; for( int i = 0 ; i < size ; i++ ){ if( S.substr( i , 1 ) == " " ){ count++; } } assert( count + 1 == VARIABLE_NUMBER ); } int main() { UNTIE; CEXPR( int , bound_T , 20 ); CIN_ASSERT( T , 1 , bound_T ); CEXPR( uint , bound_N , 1000 ); int length; string helloworld[10] = { "h" , "e" , "l" , "l" , "o" , "w" , "o" , "r" , "l" , "d" }; string helowrd[7] = { "h" , "e" , "l" , "o" , "w" , "r" , "d" }; string q = "?"; string a = "a"; string c; int j_L; REPEAT( T ){ CIN_ASSERT( N , 10 , bound_N ); CIN( string , S ); assert( S.size() == N ); length = 0; FOR( i , 0 , N ){ c = S.substr( i , 1 ); if( c == helloworld[length] || c == q ){ length++; if( length == 10 ){ j_L = i - 10; FOREQ( j , 0 , j_L ){ c = S.substr( j , 1 ); cout << ( c == q ? a : c ); } cout << "helloworld"; FOR( j , i + 1 , N ){ c = S.substr( j , 1 ); cout << ( c == q ? a : c ); } cout << "\n"; break; } } else if( length != 0 ){ FOR( j , 0 , 7 ){ if( c == helowrd[j] ){ i -= length - 1; break; } } length = 0; } } if( length != 10 ){ COUT( -1 ); } } CHECK_REDUNDANT_INPUT; QUIT; }