#ifndef INCLUDE_MODE #define INCLUDE_MODE /* #define SUBMIT_ONLY */ #define DEBUG_OUTPUT #define SAMPLE_CHECK E #endif #ifdef INCLUDE_MAIN VO Solve() { CIN( int , N , M ); CIN_A( string , 0 , N , S ); CEXPR( int , size , 26 ); TrieTree tt{ AdditiveGroup() , size }; FOR( j , 0 , N ){ tt.insert( S[j] , 1 ); } vector v = {} , node = {0}; int L = 0; while( tt.count( node[L] )[I] != 0 ){ auto [c0,c1] = tt.count( node[L] ); if( N - c1 >= M ){ break; } if( N - c0 <= M ){ while( !v.empty() && v.back() == size - 1 ){ v.pop_back(); node.pop_back(); L--; } if( v.empty() ){ RETURN( "No" ); } if( ( node[L] = tt.NodeNumber( ++v[L-1] , node[L-1] ) ) == -1 ){ break; } } else { v <<= 0; L++; node <<= tt.NodeNumber( v[L-1] , node[L-1] ); } } string a{}; RUN( v , c ){ a <<= 'a' + c; } COUT( "Yes" ); RETURN( a ); } REPEAT_MAIN(1); #else /* INCLUDE_MAIN */ #ifdef INCLUDE_SUB /* 圧縮時は中身だけ削除する。*/ IN VO Experiment() { } /* 圧縮時は中身だけ削除する。*/ IN VO SmallTest() { CERR( "全てのケースを確認しました。" ); } /* 圧縮時は中身だけ削除する。*/ IN VO RandomTest( const int& test_case_num ) { REPEAT( test_case_num ){ } CERR( "全てのケースを確認しました。" ); } #define INCLUDE_MAIN #include __FILE__ #else /* INCLUDE_SUB */ #ifdef INCLUDE_LIBRARY /* VVV 常設でないライブラリは以下に挿入する。*/ #define DEFINITION_OF_SEARCH_IN_TRIE_TREE( NEW_EDGE , UPDATE_COUNT_IS , UPDATE_COUNT ) \ int node = 0; \ UPDATE_COUNT_IS; \ \ for( auto& i : ToArray( v ) ){ \ \ assert( i >= 0 ); \ auto& edge = m_edge[node]; \ \ if( edge.count( i ) == 0 ){ \ \ NEW_EDGE; \ \ } else { \ \ node = edge[i]; \ \ } \ \ UPDATE_COUNT_IS; \ \ } \ \ UPDATE_COUNT; \ template class TrieTree { private: ABEL_GROUP m_M; vector> m_count; vector> m_edge; int m_base; int m_length; public: inline TrieTree( ABEL_GROUP M , int base = 0 , int length = -1 ); inline int NodeNumber( const int& v , const int& node ); template vector NodeSequence( const V& v ); template void insert( const V& v , const U& u ); template inline void erase( const V& v ); template inline void erase( const V& v , const U& u ); inline void clear(); inline bool empty() const noexcept; inline const U& size() const noexcept; template T2 count( const V& v ); inline T2 count( const int& node ); template U InitialSegmentCount( const V& v_ulim ); template U IntervalCount( const V& v_min , const V& v_ulim ); T2 Increment( vector& v , vector& node ) const; T2 Decrement( vector& v , vector& node ) const; inline vector Maximum(); inline vector Minimum(); template vector MaximumLeq( const V& v ); template vector MinimumGeq( const V& v ); template inline vector MaximumLt( const V& v ); template inline vector MinimumGt( const V& v ); vector ReversedMaximum( const vector& v ); inline vector ReversedMinimum( vector v ); template void swap( const V& v0 , const V& v1 ); inline void SetBase( const int& base ); inline void SetLength( const int& length ); inline vector ToArray( const int& v ); inline vector ToArray( ll v ); static vector ToArray( ll v , const int& M ); static vector ToArray( ll v , const int& M , const int& L ); private: static const vector& ToArray( const vector& v ); static inline vector ToArray( const char* const& v ); template static vector ToArray( const V& v ); template void SetNextNode( const map& edge , vector& v , vector& node , RANGE range ) const; template void SetMaximum_Body( vector& v , vector& node , SEARCH search , RANGE range ) const; inline void SetMaximum( vector& v , vector& node ) const; inline void SetMinimum( vector& v , vector& node ) const; template void SetMaximumLeq_Body( const vector& v , vector& answer , vector& node , bool& lt , RANGE range ) const; }; template TrieTree( ABEL_GROUP , ARGS... ) -> TrieTree,ABEL_GROUP>; template inline TrieTree::TrieTree( ABEL_GROUP M , int base , int length ) : m_M( move( M ) ) , m_count{{m_M.Zero(),m_M.Zero()}} , m_edge( 1 ) , m_base( move( base ) ) , m_length( move( length ) ) { static_assert( is_same_v> ); } template inline int TrieTree::NodeNumber( const int& v , const int& node ) { auto& edge = m_edge.at( node ); return In( v , edge ) ? edge[v] : -1; } template template vector TrieTree::NodeSequence( const V& v ) { vector answer = {0}; for( auto& vi : v ){ answer <<= m_edge[answer.back()].at( vi ); } return answer; } template template void TrieTree::insert( const V& v , const U& count ) { const U& zero = m_M.Zero(); if( count == zero ){ return; } DEFINITION_OF_SEARCH_IN_TRIE_TREE( node = edge[i] = m_count.size(); m_count.push_back( {zero,zero} ); m_edge <<= {} , m_count[node][I] = m_M.Sum( move( m_count[node][I] ) , count ) , m_count[node][O] = m_M.Sum( move( m_count[node][O] ) , count ) ); } template template inline void TrieTree::erase( const V& v ) { auto&& val = ToArray( v ); erase( val , count( val )[O] ); } template template inline void TrieTree::erase( const V& v , const U& count ) { insert( v , m_M.Inverse( count ) ); } template inline void TrieTree::clear() { m_count.resize( 1 ); m_count[0] = {m_M.Zero(),m_M.Zero()}; m_edge.resize( 1 ); m_edge[0].clear(); } template inline bool TrieTree::empty() const noexcept { return size() == m_M.Zero(); } template inline const U& TrieTree::size() const noexcept { return m_count[0][I]; } template template T2 TrieTree::count( const V& v ) { bool found = true; DEFINITION_OF_SEARCH_IN_TRIE_TREE( found = false; break , , ); return found ? m_count[node] : T2{m_M.Zero(),m_M.Zero()}; } template inline T2 TrieTree::count( const int& node ) { return 0 <= node && node < len( m_count ) ? m_count[node] : T2{m_M.Zero(),m_M.Zero()}; } template template U TrieTree::InitialSegmentCount( const V& v_ulim ) { auto&& val = ToArray( v_ulim ); int L = val.size(); vector node( L + 1 ); for( int i = 0 ; i < L ; i++ ){ auto itr = m_edge[node[i]].lower_bound( val[i] ); if( itr == m_edge[node[i]].end() || val[i] < itr->first ){ L = i + 1; break; } node[i+1] = itr->second; } U answer = m_M.Zero(); while( --L >= 0 ){ for( auto itr = m_edge[node[L]].begin() , end = m_edge[node[L]].end() ; itr != end && itr->first < val[L] ; ++itr ){ answer = m_M.Sum( move( answer ) , m_count[itr->second][I] ); } } return answer; } template template inline U TrieTree::IntervalCount( const V& v_min , const V& v_ulim ) { return v_min < v_ulim ? m_M.Sum( InitialSegmentCount( v_ulim ) , m_M.Inverse( InitialSegmentCount( v_min ) ) ) : m_M.Zero(); } template T2 TrieTree::Increment( vector& v , vector& node ) const { int L = v.size(); if( node.empty() ){ node = NodeSequence( v ); } const U& zero = m_M.Zero(); while( true ){ auto& [count,count_is] = m_count[node[L]]; assert( !( count_is < count ) ); if( count != count_is ){ break; } while( v[L-1] == m_edge[node[L-1]].rbegin()->first ){ v.pop_back(); node.pop_back(); L--; if( L == 0 ){ v = node = {-1}; return {zero,zero}; } } auto&& [key,val] = *( m_edge[node[L-1]].upper_bound( v[L-1] ) ); v[L-1] = key; node[L] = val; if( zero < m_count[val][O] ){ return m_count[val]; } } SetMinimum( v , node ); assert( len( node ) == ++L ); return m_count[node[L]]; } template T2 TrieTree::Decrement( vector& v , vector& node ) const { int L = v.size(); if( node.empty() ){ node = NodeSequence( v ); } const U& zero = m_M.Zero(); do { while( v[L-1] == m_edge[node[L-1]].begin()->first ){ v.pop_back(); node.pop_back(); L--; if( L == 0 ){ v = node = {-1}; return {zero,zero}; } } auto&& [key,val] = *reverse_iterator( m_edge[node[L-1]].lower_bound( v[L-1] ) ); v[L-1] = key; node[L] = val; } while( zero == m_count[node[L]][I] ); SetMaximum( v , node[L] ); return m_count[node.back()]; } template template void TrieTree::SetNextNode( const map& edge , vector& v , vector& node , RANGE range ) const { static_assert( is_invocable_v&> ); const U& zero = m_M.Zero(); for( auto [itr,end] = range( edge ) ; itr != end ; itr++ ){ if( m_count[itr->second][I] != zero ){ v <<= itr->first; node <<= itr->second; return; } } abort(); } template template void TrieTree::SetMaximum_Body( vector& v , vector& node , SEARCH search , RANGE range ) const { static_assert( is_invocable_v&> ); while( !search( m_count[node.back()] ) ){ SetNextNode( m_edge[node.back()] , v , node , range ); } return; } template inline void TrieTree::SetMaximum( vector& v , vector& node ) const { SetMaximum_Body( v , node , [&]( const T2& count ){ assert( !( count[I] < count[O] ) ); return count[O] == count[I]; } , [&]( const map& edge ){ return pair{ edge.rbegin() , edge.rend() }; } ); } template inline void TrieTree::SetMinimum( vector& v , vector& node ) const { SetMaximum_Body( v , node , [&]( const T2& count ){ assert( !( count[I] < count[O] ) ); return m_M.Zero() < count[O]; } , [&]( const map& edge ){ return pair{ edge.begin() , edge.end() }; } ); } template inline vector TrieTree::Maximum() { vector answer{}; int node = 0; SetMaximum( answer , node ); return answer; } template inline vector TrieTree::Minimum() { vector answer{}; int node = 0; SetMinimum( answer , node ); return answer; } template template void TrieTree::SetMaximumLeq_Body( const vector& v , vector& answer , vector& node , bool& lt , RANGE range ) const { static_assert( is_invocable_v&,const int&> ); const U& zero = m_M.Zero(); for( auto& i : v ){ assert( i >= 0 ); auto& edge = m_edge[node.back()]; bool found = false; for( auto [itr,end] = range( edge , i ) ; itr != end ; itr++ ){ if( m_count[itr->second][I] != zero ){ found = true; answer <<= itr->first; node <<= itr->second; lt = itr->first != i; break; } } if( !found || lt ){ break; } } return; } template template vector TrieTree::MaximumLeq( const V& v ) { auto&& val = ToArray( v ); vector answer = {} , node = {0}; bool lt = false; SetMaximumLeq_Body( val , answer , node , lt , [&]( const map& edge , const int& i ){ return pair{ reverse_iterator( edge.upper_bound( i ) ) , edge.rend() }; } ); if( lt ){ SetMaximum( answer , node ); } else if( answer != vector{-1} && m_count[node.back()][O] == m_M.Zero() ){ Decrement( answer ); } assert( answer == vector{-1} || val >= answer ); return answer; } template template vector TrieTree::MinimumGeq( const V& v ) { auto&& val = ToArray( v ); vector answer = {} , node = {0}; bool gt = false; SetMaximumLeq_Body( val , answer , node , gt , [&]( const map& edge , const int& i ){ return pair{ edge.lower_bound( i ) , edge.end() }; } ); if( gt ){ SetMinimum( answer , node ); } else if( answer != vector{-1} ){ const bool lt = answer < val; if( lt ){ SetMaximum( answer , node ); } if( lt || m_count[node.back()][O] == m_M.Zero() ){ Increment( answer , node ); } } assert( answer == vector{-1} || val <= answer ); return answer; } template template inline vector TrieTree::MaximumLt( const V& v ) { auto&& val = ToArray( v ); vector answer = MaximumLeq( val ); if( answer != vector{-1} && val == answer ){ Decrement( answer ); assert( answer == vector{-1} || val > answer ); } return answer; } template template inline vector TrieTree::MinimumGt( const V& v ) { auto&& val = ToArray( v ); vector answer = MinimumGeq( val ); if( answer != vector{-1} && val == answer ){ Increment( answer ); assert( answer == vector{-1} || val < answer ); } return answer; } template vector TrieTree::ReversedMaximum( const vector& v ) { if( empty() ){ return {-1}; } auto&& val = ToArray( v ); vector answer = {} , node = {0}; bool lt = false; for( auto& reversed : v ){ if( reversed ){ SetNextNode( m_edge[node.back()] , answer , node , [&]( const map& edge ){ return pair{ edge.begin() , edge.end() }; } ); } else { SetNextNode( m_edge[node.back()] , answer , node , [&]( const map& edge ){ return pair{ edge.rbegin() , edge.rend() }; } ); } } return answer; } template inline vector TrieTree::ReversedMinimum( vector v ) { v.flip(); return ReversedMaximum( v ); } template template void TrieTree::swap( const V& v0 , const V& v1 ) { const U& zero = m_M.Zero(); vector node0 = {0}; for( auto& i : v0 ){ auto& edge = m_edge[node0.back()]; if( edge.count( i ) == 0 ){ node0 <<= edge[i] = m_count.size(); m_count <<= {zero,zero}; m_edge <<= {}; } else { node0 <<= edge[i]; } } vector node1 = {0}; for( auto& i : v1 ){ auto& edge = m_edge[node1.back()]; if( edge.count( i ) == 0 ){ node1 <<= edge[i] = m_count.size(); m_count <<= {zero,zero}; m_edge <<= {}; } else { node1 <<= edge[i]; } } m_edge[node0.back()].swap( m_edge[node1.back()] ); U diff = m_M.Sum( m_count[node0.back()] , m_M.Inverse( m_count[node1.back()] ) ); for( auto& node : node1 ){ m_count[node] = m_M.Sum( move( m_count[node] ) , diff ); } diff = m_M.Inverse( diff ); for( auto& node : node0 ){ m_count[node] = m_M.Sum( move( m_count[node] ) , diff ); } return; } template inline void TrieTree::SetBase( const int& base ) { m_base = base; } template inline void TrieTree::SetLength( const int& length ) { m_length = length; } template inline const vector& TrieTree::ToArray( const vector& v ) { return v; } template inline vector TrieTree::ToArray( const int& v ) { return ToArray( ll( v ) ); } template inline vector TrieTree::ToArray( ll v ) { assert( m_base >= 1 ); return m_length == -1 ? ToArray( v , m_base ) : ToArray( v , m_base , m_length ); } template vector TrieTree::ToArray( ll v , const int& M ) { assert( v >= 0 ); vector answer{}; while( v > 0 ){ answer <<= v % M; v /= M; } Reverse( answer ); return answer; } template vector TrieTree::ToArray( ll v , const int& M , const int& L ) { assert( 0 <= L && 0 <= v ); vector answer( L ); for( int i = 0 ; i < L ; i++ ){ answer[L-1-i] =v % M; v /= M; } return answer; } template inline vector TrieTree::ToArray( const char* const& v ) { return ToArray( string( v ) ); } template template vector TrieTree::ToArray( const V& v ) { const int L = v.size(); vector answer( L ); for( int i = 0 ; i < L ; i++ ){ if constexpr( is_same_v ){ answer[i] = v[i] - ( v[i] < 'a' ? 'A' : 'a' ); } else { answer[i] = v[i]; } } return answer; } /* AAA 常設でないライブラリは以上に挿入する。*/ #define INCLUDE_SUB #include __FILE__ #else /* INCLUDE_LIBRARY */ #ifdef DEBUG #define _GLIBCXX_DEBUG #else #pragma GCC optimize ( "O3" ) #pragma GCC optimize ( "unroll-loops" ) #pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" ) #define DEXPR( LL , BOUND , VALUE1 , VALUE2 ) CEXPR( LL , BOUND , VALUE1 ) #define ASSERT( A , MIN , MAX ) AS( ( MIN ) <= A && A <= ( MAX ) ) #define REPEAT_MAIN( BOUND ) START_MAIN; CEXPR( int , test_case_num_bound , BOUND ); int test_case_num = 1; if CE( test_case_num_bound > 1 ){ FINISH_MAIN #ifdef USE_GETLINE #define SET_SEPARATE( SEPARATOR , ... ) VariadicGetline( cin , SEPARATOR , __VA_ARGS__ ) #define SET( ... ) SET_SEPARATE( '\n' , __VA_ARGS__ ) #define GETLINE_SEPARATE( SEPARATOR , ... ) string __VA_ARGS__; SET_SEPARATE( SEPARATOR , __VA_ARGS__ ) #define GETLINE( ... ) GETLINE_SEPARATE( '\n' , __VA_ARGS__ ) #define FINISH_MAIN GETLINE( test_case_num_str ); test_case_num = stoi( test_case_num_str ); ASSERT( test_case_num , 1 , test_case_num_bound ); } REPEAT( test_case_num ){ Solve(); } } #else #define SET( ... ) VariadicCin( cin , __VA_ARGS__ ) #define CIN( LL , ... ) LL __VA_ARGS__; SET( __VA_ARGS__ ) #define SET_A( I , N , ... ) VariadicResize( N + I , __VA_ARGS__ ); FOR( VARIABLE_FOR_SET_A , 0 , N ){ VariadicSet( cin , VARIABLE_FOR_SET_A + I , __VA_ARGS__ ); } #define CIN_A( LL , I , N , ... ) VE __VA_ARGS__; SET_A( I , N , __VA_ARGS__ ) #define CIN_AA( LL , I0 , N0 , I1 , N1 , VAR ) VE VAR( N0 + I0 , VE( N1 + I1 ) ); FOR( VARIABLE_FOR_CIN_AA , 0 , N0 ){ SET_A( I1 , N1 , VAR[VARIABLE_FOR_CIN_AA + I0] ); } #define FINISH_MAIN SET_ASSERT( test_case_num , 1 , test_case_num_bound ); } REPEAT( test_case_num ){ Solve(); } } #endif #define SET_ASSERT( A , MIN , MAX ) SET( A ); ASSERT( A , MIN , MAX ) #define SOLVE_ONLY #define COUT( ... ) VariadicCout( cout , __VA_ARGS__ ) << ENDL #define COUTNS( ... ) VariadicCoutNonSep( cout , __VA_ARGS__ ) #define CERR( ... ) #define CERRNS( ... ) #define COUT_A( I , N , A ) CoutArray( cout , I , N , A ) << ENDL #define CERR_A( I , N , A ) #define WHAT( ... ) #define TLE( CONDITION ) if( !( CONDITION ) ){ cerr << "TLE" << endl; ll TLE_VAR = 1; while( TLE_VAR != 0 ){ ( TLE_VAR += 2 ) %= int( 1e9 ); } cerr << TLE_VAR << endl; } #define MLE( CONDITION ) if( !( CONDITION ) ){ cerr << "MLE" << endl; vector> MLE_VAR{}; REPEAT( 1e6 ){ MLE_VAR.push_back( vector( 1e6 ) ); } cerr << MLE_VAR << endl; } #define OLE( CONDITION ) if( !( CONDITION ) ){ cerr << "OLE" << endl; REPEAT( 1e8 ){ COUT( "OLE" ); } } #endif #ifdef REACTIVE #ifndef DEBUG #define LOCAL( ... ) #define RSET( A , ... ) SET( A ) #endif #define RCIN( LL , A , ... ) LL A; RSET( A , __VA_ARGS__ ) #define ENDL endl #else #define ENDL "\n" #endif #include using namespace std; #define ATT __attribute__( ( target( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" ) ) ) #define START_MAIN int main(){ ios_base::sync_with_stdio( false ); cin.tie( nullptr ) #define START_WATCH chrono::system_clock::time_point watch = chrono::system_clock::now(); double loop_average_time = 0.0 , loop_start_time = loop_average_time , current_time = loop_start_time; int loop_count = current_time; assert( loop_count == 0 ) #define CURRENT_TIME ( current_time = static_cast( chrono::duration_cast( chrono::system_clock::now() - watch ).count() / 1000.0 ) ) #define CHECK_WATCH( TL_MS ) ( CURRENT_TIME , loop_count == 0 ? loop_start_time = current_time : loop_average_time = ( current_time - loop_start_time ) / loop_count , ++loop_count , current_time < TL_MS - loop_average_time * 2 - 100.0 ) #define CEXPR( LL , BOUND , VALUE ) CE LL BOUND = VALUE #define SET_A_ASSERT( I , N , A , MIN , MAX ) FOR( VARIABLE_FOR_SET_A , 0 , N ){ SET_ASSERT( A[VARIABLE_FOR_SET_A + I] , MIN , MAX ); } #define SET_AA_ASSERT( I0 , N0 , I1 , N1 , A , MIN , MAX ) FOR( VARIABLE_FOR_SET_AA0 , 0 , N0 ){ FOR( VARIABLE_FOR_SET_AA1 , 0 , N1 ){ SET_ASSERT( A[VARIABLE_FOR_SET_AA0 + I0][VARIABLE_FOR_SET_AA1 + I1] , MIN , MAX ); } } #define CIN_ASSERT( A , MIN , MAX ) decldecay_t( MAX ) A; SET_ASSERT( A , MIN , MAX ) #define CIN_A_ASSERT( I , N , A , MIN , MAX ) vector A( N + I ); SET_A_ASSERT( I , N , A , MIN , MAX ) #define CIN_AA_ASSERT( I0 , N0 , I1 , N1 , A , MIN , MAX ) vector A( N0 + I0 , vector( N1 + I1 ) ); SET_AA_ASSERT( I0 , N0 , I1 , N1 , A , MIN , MAX ) #define PR1( A1 , ... ) A1 #define PR2( A1 , A2 , ... ) A2 #define PR3( A1 , A2 , A3 , ... ) A3 #define FOR_( VAR , INITIAL , FINAL , UPPER , COMP , INCR ) for( decldecay_t( UPPER ) VAR = INITIAL ; VAR COMP ( FINAL ) ; VAR INCR ) #define FOR( VAR , INITIAL , ... ) FOR_( VAR , INITIAL , PR1( __VA_ARGS__ ) , PR1( __VA_ARGS__ ) , < , PR3( __VA_ARGS__ , += PR2( __VA_ARGS__ , ? ) , ++ ) ) #define FOREQ( VAR , INITIAL , ... ) FOR_( VAR , INITIAL , PR1( __VA_ARGS__ ) , PR1( __VA_ARGS__ ) , <= , PR3( __VA_ARGS__ , += PR2( __VA_ARGS__ , ? ) , ++ ) ) #define FOREQINV( VAR , INITIAL , ... ) FOR_( VAR , INITIAL , PR1( __VA_ARGS__ ) , INITIAL , + 1 > , PR3( __VA_ARGS__ , -= PR2( __VA_ARGS__ , ? ) , -- ) ) #define ITR( ARRAY ) auto begin_ ## ARRAY = ARRAY .BE() , itr_ ## ARRAY = begin_ ## ARRAY , end_ ## ARRAY = ARRAY .EN() #define FOR_ITR( ARRAY ) for( ITR( ARRAY ) , itr = itr_ ## ARRAY ; itr_ ## ARRAY != end_ ## ARRAY ; itr_ ## ARRAY ++ , itr++ ) #define RUN( ARRAY , ... ) for( auto&& __VA_ARGS__ : ARRAY ) #define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) #define SET_PRECISION( DECIMAL_DIGITS ) cout << fixed << setprecision( DECIMAL_DIGITS ); cerr << fixed << setprecision( DECIMAL_DIGITS ) #define RETURN( ... ) SOLVE_ONLY; COUT( __VA_ARGS__ ); RE #define COMPARE( ... ) auto naive = Naive( __VA_ARGS__ , false ); auto answer = Answer( __VA_ARGS__ , false ); bool match = naive == answer; CERR( "(" , #__VA_ARGS__ , ") == (" , __VA_ARGS__ , ") : Naive ==" , naive , match ? "==" : "!=" , answer , "== Answer" ); if( !match ){ CERR( "出力の不一致が検出されました。" ); RE; } #define CHECK( ... ) auto answer = Answer( __VA_ARGS__ , false ); CERR( "(" , #__VA_ARGS__ , ") == (" , __VA_ARGS__ , ") : Answer == " , answer ) /* 圧縮用 */ #define TE template #define TY typename #define US using #define ST static #define AS assert #define IN inline #define CL class #define PU public #define OP operator #define CE constexpr #define CO const #define NE noexcept #define RE return #define WH while #define VO void #define VE vector #define LI list #define BE begin #define EN end #define SZ size #define LE length #define MO move #define TH this #define CRI CO int& #define CRUI CO uint& #define CRL CO ll& #define VI virtual #define IS basic_istream #define OS basic_ostream #define ST_AS static_assert #define reMO_CO remove_const #define is_COructible_v is_constructible_v #define rBE rbegin /* 型のエイリアス */ #define decldecay_t(VAR)decay_t TE US ret_t = decltype(declval()(declval()...)); TE US inner_t = TY T::type; US uint = unsigned int; US ll = long long; US ull = unsigned long long; US ld = long double; US lld = __float128; /* VVV 常設ライブラリは以下に挿入する。*/ #ifdef DEBUG #include "C:/Users/user/Documents/Programming/Contest/Template/Local/a_Body.hpp" US MP = DMod; #else /* BinarySearch (2KB)*/ CE bool reactive = #ifdef REACTIVE true; #else false; #endif /* Random (1KB)*/ ll GetRand(CRL Rand_min,CRL Rand_max){AS(Rand_min <= Rand_max);ll AN = time(NULL);RE AN * rand()%(Rand_max + 1 - Rand_min)+ Rand_min;} /* Set (2KB)*/ #define DC_OF_HASH(...)struct hash<__VA_ARGS__>{IN size_t OP()(CO __VA_ARGS__& n)CO;}; CL is_ordered{PU:is_ordered()= delete;TE ST CE auto Check(CO T& t)-> decltype(t < t,true_type());ST CE false_type Check(...);TE ST CE CO bool value = is_same_v< decltype(Check(declval())),true_type >;}; TE US Set = conditional_t>,unordered_set,conditional_t,set,VO>>; #define DF_OF_POP_FOR_SET(SET)TE IN T pop_max(SET& S){AS(!S.empty());auto IT = --S.EN();T AN = *IT;S.erase(IT);RE AN;}TE IN T pop_min(SET& S){AS(!S.empty());auto IT = S.BE();T AN = *IT;S.erase(IT);RE AN;}TE IN SET& OP<<=(SET& S,T t){S.insert(MO(t));RE S;}TE IN SET& OP<<=(SET& S,U&& u){S.insert(T{forward(u)});RE S;}TE IN SET& OP>>=(SET& S,CO T& t){auto IT = S.find(t);if(IT != S.EN()){S.erase(IT);}RE S;}TE IN SET& OP>>=(SET& S,CO U& u){RE S >>= T{u};}TE IN CO T& Get(CO SET& S,int i){auto BE = S.BE(),EN = S.EN();auto& IT = i < 0?(++i,--EN):BE;WH(i > 0 && IT != EN){--i;++IT;}WH(i < 0 && IT != BE){++i;--IT;}AS(i == 0);RE *IT;} #define DF_OF_UNION_FOR_SET(SET)TE IN SET& OP|=(SET& S0,SET S1){S0.merge(MO(S1));RE S0;}TE IN SET OP|(SET S0,SET S1){RE MO(S0.SZ()< S1.SZ()?S1 |= MO(S0):S0 |= MO(S1));} TE IN TY SET::const_iterator MaximumLeq(CO SET& S,CO T& t){auto IT = S.upper_bound(t);RE IT == S.BE()?S.EN():--IT;}TE IN TY SET::const_iterator MaximumLt(CO SET& S,CO T& t){auto IT = S.lower_bound(t);RE IT == S.BE()?S.EN():--IT;}TE IN TY SET::const_iterator MinimumGeq(CO SET& S,CO T& t){RE S.lower_bound(t);}TE IN TY SET::const_iterator MinimumGt(CO SET& S,CO T& t){RE S.upper_bound(t);}TE IN VO EraseBack(SET& S,ITERATOR& IT){IT = S.erase(IT);}TE IN VO EraseFront(SET& S,ITERATOR& IT){IT = S.erase(IT);IT == S.BE()?IT = S.EN():--IT;}TE TY SET,TY T,TY...Args> IN bool In(CO T& t,CO SET& S){RE S.count(t)> 0;}DF_OF_POP_FOR_SET(set);DF_OF_POP_FOR_SET(unordered_set);DF_OF_POP_FOR_SET(multiset);DF_OF_POP_FOR_SET(unordered_multiset);DF_OF_UNION_FOR_SET(set);DF_OF_UNION_FOR_SET(unordered_set);DF_OF_UNION_FOR_SET(multiset);DF_OF_UNION_FOR_SET(unordered_multiset);DF_OF_UNION_FOR_SET(VE);DF_OF_UNION_FOR_SET(LI); /* Tuple (6KB)*/ #define DF_OF_AR_FOR_TUPLE(OPR)TE TY PAIR> IN auto OP OPR ## =(PAIR& t0,CO PAIR& t1)-> decltype((get<0>(t0),t0))&{get<0>(t0)OPR ## = get<0>(t1);get<1>(t0)OPR ## = get<1>(t1);RE t0;}TE TY TUPLE> IN auto OP OPR ## =(TUPLE& t0,CO TUPLE& t1)-> decltype((get<0>(t0),t0))&{get<0>(t0)OPR ## = get<0>(t1);get<1>(t0)OPR ## = get<1>(t1);get<2>(t0)OPR ## = get<2>(t1);RE t0;}TE TY TUPLE> IN auto OP OPR ## =(TUPLE& t0,CO TUPLE& t1)-> decltype((get<0>(t0),t0))&{get<0>(t0)OPR ## = get<0>(t1);get<1>(t0)OPR ## = get<1>(t1);get<2>(t0)OPR ## = get<2>(t1);get<3>(t0)OPR ## = get<3>(t1);RE t0;}TE TY PAIR> IN auto OP OPR ## =(PAIR& t0,CO ARG& t1)-> decltype((get<0>(t0),t0))&{get<0>(t0)OPR ## = t1;get<1>(t0)OPR ## = t1;RE t0;}TE TY TUPLE> IN auto OP OPR ## =(TUPLE& t0,CO ARG& t1)-> decltype((get<0>(t0),t0))&{get<0>(t0)OPR ## = t1;get<1>(t0)OPR ## = t1;get<2>(t0)OPR ## = t1;RE t0;}TE TY TUPLE> IN auto OP OPR ## =(TUPLE& t0,CO ARG& t1)-> decltype((get<0>(t0),t0))&{get<0>(t0)OPR ## = t1;get<1>(t0)OPR ## = t1;get<2>(t0)OPR ## = t1;get<3>(t0)OPR ## = t1;RE t0;}TE TY TUPLE,TY...ARGS,TY ARG> IN auto OP OPR(CO TUPLE& t0,CO ARG& t1)-> decldecay_t((get<0>(t0),t0)){auto t = t0;RE MO(t OPR ## = t1);} #define DF_OF_INCREMENT_FOR_TUPLE(INCR)TE TY PAIR> IN auto OP INCR(PAIR& t)-> decltype((get<0>(t),t))&{INCR get<0>(t);INCR get<1>(t);RE t;}TE TY TUPLE> IN auto OP INCR(TUPLE& t)-> decltype((get<0>(t),t))&{INCR get<0>(t);INCR get<1>(t);INCR get<2>(t);RE t;}TE TY TUPLE> IN auto OP INCR(TUPLE& t)-> decltype((get<0>(t),t))&{INCR get<0>(t);INCR get<1>(t);INCR get<2>(t);INCR get<3>(t);RE t;} TE IN IS& OP>>(IS& is,tuple& arg){RE is >> get<0>(arg);}TE TY V> IN auto OP>>(IS& is,V& arg)-> decltype((get<0>(arg),is))&{RE is >> get<0>(arg)>> get<1>(arg);}TE IN IS& OP>>(IS& is,tuple& arg){RE is >> get<0>(arg)>> get<1>(arg)>> get<2>(arg);}TE IN IS& OP>>(IS& is,tuple& arg){RE is >> get<0>(arg)>> get<1>(arg)>> get<2>(arg)>> get<3>(arg);}TE IN OS& OP<<(OS& os,CO tuple& arg){RE os << get<0>(arg);}TE TY V> IN auto OP<<(OS& os,CO V& arg)-> decltype((get<0>(arg),os))&{RE os << get<0>(arg)<< " " << get<1>(arg);}TE IN OS& OP<<(OS& os,CO tuple& arg){RE os << get<0>(arg)<< " " << get<1>(arg)<< " " << get<2>(arg);}TE IN OS& OP<<(OS& os,CO tuple& arg){RE os << get<0>(arg)<< " " << get<1>(arg)<< " " << get<2>(arg)<< " " << get<3>(arg);}DF_OF_AR_FOR_TUPLE(+);TE TY V> IN auto OP-(CO V& t)-> decldecay_t((get<0>(t),t)){RE{-get<0>(t),-get<1>(t)};}TE IN tuple OP-(CO tuple& t){RE{-get<0>(t),-get<1>(t),-get<2>(t)};}TE IN tuple OP-(CO tuple& t){RE{-get<0>(t),-get<1>(t),-get<2>(t),-get<3>(t)};}DF_OF_AR_FOR_TUPLE(-);DF_OF_AR_FOR_TUPLE(*);DF_OF_AR_FOR_TUPLE(/);DF_OF_AR_FOR_TUPLE(%);DF_OF_INCREMENT_FOR_TUPLE(++);DF_OF_INCREMENT_FOR_TUPLE(--); TE CL TupleAccessIndex{};TE CL Tuple:PU tuple{PU:IN Tuple(Types&&... args);TE IN Tuple(Args&&... args);TE IN auto& OP[](CO TupleAccessIndex& i)NE;TE IN CO auto& OP[](CO TupleAccessIndex& i)CO NE;};TE CL tuple_size>:PU tuple_size>{};TE CL tuple_element>:PU tuple_element>{}; TE US Pair = Tuple;TE US T2 = Pair;TE US T3 = Tuple;TE US T4 = Tuple; CE TupleAccessIndex<0> O{};CE TupleAccessIndex<1> I{};CE TupleAccessIndex<2> II{};CE TupleAccessIndex<3> III{}; TE IN Tuple::Tuple(Types&&... args):tuple(MO(args)...){}TE TE IN Tuple::Tuple(Args&&... args):tuple(forward(args)...){}TE TE IN auto& Tuple::OP[](CO TupleAccessIndex& i)NE{RE get(*TH);}TE TE IN CO auto& Tuple::OP[](CO TupleAccessIndex& i)CO NE{RE get(*TH);}TE TY PAIR,TY INT> T2 cast(CO PAIR& t){RE{get<0>(t),get<1>(t)};}TE T3 cast(CO tuple& t){RE{get<0>(t),get<1>(t),get<2>(t)};}TE T4 cast(CO tuple& t){RE{get<0>(t),get<1>(t),get<2>(t),get<3>(t)};} #define DF_OF_HASH_FOR_TUPLE(PAIR)TE IN size_t hash>::OP()(CO PAIR& n)CO{ST CO size_t seed =(GetRand(1e3,1e8)<< 1)| 1;ST CO hash h0;ST CO hash h1;RE(h0(get<0>(n))* seed)^ h1(get<1>(n));} TE DC_OF_HASH(tuple);TE DC_OF_HASH(pair);TE DC_OF_HASH(tuple);TE DC_OF_HASH(tuple);TE DC_OF_HASH(tuple); TE IN size_t hash>::OP()(CO tuple& n)CO{ST CO hash h;RE h(get<0>(n));}DF_OF_HASH_FOR_TUPLE(pair);DF_OF_HASH_FOR_TUPLE(tuple);TE IN size_t hash>::OP()(CO tuple& n)CO{ST CO size_t seed =(GetRand(1e3,1e8)<< 1)| 1;ST CO hash> h01;ST CO hash h2;RE(h01({get<0>(n),get<1>(n)})* seed)^ h2(get<2>(n));}TE IN size_t hash>::OP()(CO tuple& n)CO{ST CO size_t seed =(GetRand(1e3,1e8)<< 1)| 1;ST CO hash> h01;ST CO hash> h23;RE(h01({get<0>(n),get<1>(n)})* seed)^ h23({get<2>(n),get<3>(n)});} /* Vector (3KB)*/ #define DF_OF_COUT_FOR_VE(V)TE IN OS& OP<<(OS& os,CO V