#ifndef INCLUDE_MODE #define INCLUDE_MODE // #define REACTIVE // #define USE_GETLINE #endif #ifdef INCLUDE_MAIN IN VO Solve() { CIN( int , N , K ); CIN_A( ll , A , N ); int t = ( 1 << K ) - 1; ll answer = 0; bool b = true; BitExhausiveSearch bes{ 1 << N , N }; while( b ){ ll s = 0; FOR( i , 0 , N ){ s += A[i] * ( ( t >> i ) & 1 ); } s%998244353<=s%998 ? ++answer : answer; b = bes.NextSubset( t ); } RETURN( answer % 998 ); } REPEAT_MAIN(1); #else // INCLUDE_MAIN #ifdef INCLUDE_SUB // グラフ用 TE Map gF; TE VE gA; TE VE> gE; TE TY V> IN auto Get( CO V& a ) { return [&]( CRI i = 0 ){ RE a[i]; }; } // COMPAREに使用。圧縮時は削除する。 ll Naive( int N , int M , int K ) { ll answer = N + M + K; return answer; } // COMPAREに使用。圧縮時は削除する。 ll Answer( ll N , ll M , ll K ) { // START_WATCH; ll answer = N + M + K; // // TLに準じる乱択や全探索。デフォルトの猶予は100.0[ms]。 // CEXPR( double , TL , 2000.0 ); // while( CHECK_WATCH( TL ) ){ // } return answer; } // 圧縮時は中身だけ削除する。 IN VO Experiment() { // CEXPR( int , bound , 10 ); // FOREQ( N , 0 , bound ){ // FOREQ( M , 0 , bound ){ // FOREQ( K , 0 , bound ){ // COUT( N , M , K , ":" , Naive( N , M , K ) ); // } // } // // cout << Naive( N ) << ",\n"[N==bound]; // } } // 圧縮時は中身だけ削除する。 IN VO SmallTest() { // CEXPR( int , bound , 10 ); // FOREQ( N , 0 , bound ){ // FOREQ( M , 0 , bound ){ // FOREQ( K , 0 , bound ){ // COMPARE( N , M , K ); // } // } // // COMPARE( N ); // } } #define INCLUDE_MAIN #include __FILE__ #else // INCLUDE_SUB #ifdef INCLUDE_LIBRARY /* C-x 3 C-x o C-x C-fによるファイル操作用 BFS: c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/BreadthFirstSearch/compress.txt CoordinateCompress: c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/CoordinateCompress/compress.txt DFSOnTree c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/DepthFirstSearch/Tree/a.hpp Divisor: c:/Users/user/Documents/Programming/Mathematics/Arithmetic/Prime/Divisor/compress.txt IntervalAddBIT c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/AffineSpace/BIT/IntervalAdd/compress.txt Polynomial c:/Users/user/Documents/Programming/Mathematics/Polynomial/compress.txt UnionFind c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/UnionFindForest/compress.txt */ // GRAPHは辺Edge:N->N^{< \omega}を持つグラフに相当する型。 // 構築 O(1)/O(|V_G|)（未初期化/初期化） // Next()の反復でinitから到達可能な頂点を全探索 O(initの連結成分における辺の本数) // Next()の反復とShift()で全探索 O(|V_G|+|E_G|) // initからの到達可能性判定と深さ計算 O(initの連結成分における辺の本数) // 連結成分の色分けと数え上げ O(|V_G|+|E_G|) template class VirtualBreadthFirstSearch : public PointedSet { protected: GRAPH& m_G; bool m_initialised; // 次の探索点たちを格納。 list m_next; // 到達済みか否かを格納。 vector m_found; // 到達済みかつ到達済みの点から辺を辿って到達した場合、その点を格納。 vector m_prev; public: inline VirtualBreadthFirstSearch( GRAPH& G ); inline VirtualBreadthFirstSearch( GRAPH& G , const int& init ); // m_nextとm_foundとm_prevを初期化する。 inline void Initialise(); // m_nextとm_foundとm_prevを初期化した上でinitを最初の探索点に設定する。 inline void Initialise( const int& init ); // m_nextを初期化した上でm_foundとm_prevを非初期化せずinitを次の探索点に設定する。 inline void Shift( const int& init ); inline const int& size() const noexcept; inline vector::reference found( const int& i ); inline const int& prev( const int& i ); inline int Next(); // 最初の未到達点（初期化時点ではinit）から到達できる未到達点の深さを格納し、 // 到達できない未到達点や既到達点は深さの代わりに-1を格納。 vector GetDistance(); // 無向グラフである場合にのみサポート。 // 未到達点の全体のなす部分グラフにおける連結成分の色分けと連結成分数を格納。 void SetConnectedComponent( vector& cc_num , int& count ); private: virtual void Push( list& next , const int& i ) = 0; }; template class BreadthFirstSearch : public VirtualBreadthFirstSearch { public: template inline BreadthFirstSearch( GRAPH& G , const Args&... args ); private: inline void Push( list& next , const int& i ); }; template inline VirtualBreadthFirstSearch::VirtualBreadthFirstSearch( GRAPH& G ) : m_G( G ) , m_initialised( false ) , m_next() , m_found() , m_prev() { static_assert( is_same_v,int> && is_same_v().Edge(0)),list>); } template inline VirtualBreadthFirstSearch::VirtualBreadthFirstSearch( GRAPH& G , const int& init ) : VirtualBreadthFirstSearch( G ) { Initialise( init ); } template template inline BreadthFirstSearch::BreadthFirstSearch( GRAPH& G , const Args&... args ) : VirtualBreadthFirstSearch( G , args... ) {} template inline void VirtualBreadthFirstSearch::Initialise() { m_initialised = true; const int& V = size(); m_next.clear(); m_found = vector( V ); m_prev = vector( V , -1 ); } template inline void VirtualBreadthFirstSearch::Initialise( const int& init ) { assert( ( this->init() = init ) < size() ); Initialise(); m_next.push_back( init ); m_found[init] = true; } template inline void VirtualBreadthFirstSearch::Shift( const int& init ) { if( m_initialised ){ const int& V = size(); assert( ( this->init() = init ) < V ); m_next.clear(); if( ! m_found[init] ){ m_next.push_back( init ); m_found[init] = true; } } else { Initialise( init ); } } template inline const int& VirtualBreadthFirstSearch::size() const noexcept { return m_G.size(); } template inline vector::reference VirtualBreadthFirstSearch::found( const int& i ) { assert( i < size() ); if( !m_initialised ){ Initialise(); } return m_found[i]; } template inline const int& VirtualBreadthFirstSearch::prev( const int& i ) { assert( i < size() ); if( !m_initialised ){ Initialise(); } return m_prev[i]; } template inline int VirtualBreadthFirstSearch::Next() { if( m_next.empty() ){ return -1; } const int i_curr = m_next.front(); m_next.pop_front(); auto&& edge = m_G.Edge( i_curr ); while( ! edge.empty() ){ const int& i = edge.front(); auto&& found_i = m_found[i]; if( ! found_i ){ Push( m_next , i ); m_prev[i] = i_curr; found_i = true; } edge.pop_front(); } return i_curr; } template vector VirtualBreadthFirstSearch::GetDistance() { vector depth{}; depth = vector( size() , -1 ); int i = Next(); depth[i] = 0; while( ( i = Next() ) != -1 ){ depth[i] = depth[prev( i )] + 1; } return depth; } template void VirtualBreadthFirstSearch::SetConnectedComponent( vector& cc_num , int& count ) { const int& V = size(); cc_num = vector( V , -1 ); count = 0; for( int i = 0 ; i < V ; i++ ){ if( cc_num[i] == -1 ){ Shift( i ); int j = Next(); if( j != -1 ){ while( j != -1 ){ // 無向グラフである場合は常にtrue。 assert( cc_num[j] == -1 ); cc_num[j] = count; j = Next(); } count++; } } } return; } template inline void BreadthFirstSearch::Push( list& next , const int& i ) { next.push_back( i ); } #define DEFINITION_OF_ADJACENT_SET( T_COPY , OPR , ULIM , UPDATE ) \ list answer{}; \ int t_copy = T_COPY; \ int t_next; \ int d; \ \ while( t_copy != 0 && ( t_next = ( t OPR ( d = ( t_copy & -t_copy ) ) ) ) < ULIM ){ \ \ t_copy -= d; \ UPDATE; \ \ } \ \ return answer \ #define DEFINITION_OF_PROPER_SET( INCREMENT , OPR , ULIM , UPDATE ) \ list answer{}; \ int t_next = t; \ \ while( ( ( INCREMENT t_next ) OPR t ) < ULIM ){ \ \ UPDATE; \ \ } \ \ return answer \ class BitExhausiveEdge { public: const int* m_p_V; inline list operator()( const int& t ); }; // bitを0から1に変更する方向に有向辺を貼ったグラフに対するBFS class BitExhausiveSearch : public BreadthFirstSearch> { private: Graph m_G; const int* m_p_V; int m_digit; public: // Vは最大の集合に対応する整数+1（digitの羃集合全体なら1< UnreachedAdjacentSupsetOf( const int& t ) noexcept; // tに対応する部分集合に1つ要素を削除した部分集合で未到達なものを格納。 inline list UnreachedAdjacentSubsetOf( const int& t ) noexcept; // tに対応する部分集合を真に含む部分集合で未到達なものを格納。 inline list UnreachedProperSupsetOf( const int& t ) noexcept; // tに対応する部分集合の真部分集合で未到達なものを格納。 inline list UnreachedProperSubsetOf( const int& t ) noexcept; // tに対応する部分集合に1つ要素を追加した部分集合を格納。 inline list AdjacentSupsetOf( const int& t ) noexcept; // tに対応する部分集合を真に含む部分集合を格納。 inline list ProperSupsetOf( const int& t ) noexcept; // tに対応する部分集合に1つ要素を削除した部分集合を格納。 static inline list AdjacentSubsetOf( const int& t ) noexcept; // tに対応する部分集合の真部分集合を格納。 static inline list ProperSubsetOf( const int& t ) noexcept; // 対応する部分集合の濃度を変えずにtを昇順で後続に遷移させる。 inline bool NextSubset( int& t ) noexcept; // tの2進表記における桁数を返す。 static inline int DigitOf( const int& t ) noexcept; // tの2進加法付値をメモ化して返す。（合計O(max t)） static inline const int& ValuationOf( const int& t ) noexcept; }; inline list BitExhausiveEdge::operator()( const int& t ) { DEFINITION_OF_ADJACENT_SET( ~t , | , *m_p_V , answer.push_back( t_next ); ); } inline BitExhausiveSearch::BitExhausiveSearch( const int& V , const int& digit ) : BreadthFirstSearch>( m_G ) , m_G( V , BitExhausiveEdge() ) , m_p_V( &( m_G.size() ) ) , m_digit( digit ) { assert( 0 <= m_digit && m_digit <= 30 && ( *m_p_V >> m_digit ) <= 1 ); m_G.edge().m_p_V = m_p_V; } inline BitExhausiveSearch::BitExhausiveSearch( const int& V ) : BitExhausiveSearch( V , DigitOf( V ) ) {} inline list BitExhausiveSearch::UnreachedAdjacentSupsetOf( const int& t ) noexcept { DEFINITION_OF_ADJACENT_SET( ~t , | , *m_p_V , if( ! this->found( t_next ) ){ answer.push_back( t_next ); } ); } inline list BitExhausiveSearch::UnreachedProperSupsetOf( const int& t ) noexcept { DEFINITION_OF_PROPER_SET( ++ , |= , *m_p_V , if( ! this->found( t_next ) ){ answer.push_back( t_next ); } ); } inline list BitExhausiveSearch::AdjacentSupsetOf( const int& t ) noexcept { DEFINITION_OF_ADJACENT_SET( ~t , | , *m_p_V , answer.push_back( t_next ) ); } inline list BitExhausiveSearch::ProperSupsetOf( const int& t ) noexcept { DEFINITION_OF_PROPER_SET( ++ , |= , *m_p_V , answer.push_back( t_next ); ); } inline list BitExhausiveSearch::UnreachedAdjacentSubsetOf( const int& t ) noexcept { DEFINITION_OF_ADJACENT_SET( t , ^ , t , if( ! this->found( t_next ) ){ answer.push_back( t_next ); } ); } inline list BitExhausiveSearch::UnreachedProperSubsetOf( const int& t ) noexcept { DEFINITION_OF_PROPER_SET( -- , &= , t , if( ! this->found( t_next ) ){ answer.push_back( t_next ); } ); } inline list BitExhausiveSearch::AdjacentSubsetOf( const int& t ) noexcept { DEFINITION_OF_ADJACENT_SET( t , ^ , t , answer.push_back( t_next ) ); } inline list BitExhausiveSearch::ProperSubsetOf( const int& t ) noexcept { DEFINITION_OF_PROPER_SET( -- , &= , t , answer.push_back( t_next ); ); } inline bool BitExhausiveSearch::NextSubset( int& t ) noexcept { vector S( m_digit ); for( int d = 0 ; d < m_digit ; d++ ){ S[d] = ( ( t >> ( m_digit - d - 1 ) ) & 1 ); } bool b = next_permutation( S.begin() , S.end() ); t = 0; for( int d = 0 ; d < m_digit ; d++ ){ t |= S[d] << ( m_digit - d - 1 ); b = b && t < *m_p_V; } return b; } inline int BitExhausiveSearch::DigitOf( const int& t ) noexcept { int digit = 0; int power = 1; while( t > power ){ power <<= 1; digit++; } return digit; } inline const int& BitExhausiveSearch::ValuationOf( const int& t ) noexcept { static unordered_map g_v; static int length = 0; while( g_v.count( t ) == 0 ){ assert( t >> length > 0 ); g_v[ 1 << length ] = length; length++; } return g_v[t]; } // AAA 常設でないライブラリは以上に挿入する。 #define INCLUDE_SUB #include __FILE__ #else // INCLUDE_LIBRARY #ifdef DEBUG #define _GLIBCXX_DEBUG #define REPEAT_MAIN( BOUND ) START_MAIN; signal( SIGABRT , &AlertAbort ); AutoCheck( exec_mode , use_getline ); if( exec_mode == sample_debug_mode || exec_mode == submission_debug_mode || exec_mode == library_search_mode ){ RE 0; } else if( exec_mode == experiment_mode ){ Experiment(); RE 0; } else if( exec_mode == small_test_mode ){ SmallTest(); RE 0; }; DEXPR( int , bound_test_case_num , BOUND , min( BOUND , 100 ) ); int test_case_num = 1; if( exec_mode == solve_mode ){ if CE( bound_test_case_num > 1 ){ SET_ASSERT( test_case_num , 1 , bound_test_case_num ); } } else if( exec_mode == random_test_mode ){ CERR( "ランダムテストを行う回数を指定してください。" ); SET_LL( test_case_num ); } FINISH_MAIN #define DEXPR( LL , BOUND , VALUE , DEBUG_VALUE ) CEXPR( LL , BOUND , DEBUG_VALUE ) #define ASSERT( A , MIN , MAX ) CERR( "ASSERTチェック： " , ( MIN ) , ( ( MIN ) <= A ? "<=" : ">" ) , A , ( A <= ( MAX ) ? "<=" : ">" ) , ( MAX ) ); AS( ( MIN ) <= A && A <= ( MAX ) ) #define SET_ASSERT( A , MIN , MAX ) if( exec_mode == solve_mode ){ SET_LL( A ); ASSERT( A , MIN , MAX ); } else if( exec_mode == random_test_mode ){ CERR( #A , " = " , ( A = GetRand( MIN , MAX ) ) ); } else { AS( false ); } #define SOLVE_ONLY ST_AS( __FUNCTION__[0] == 'S' ) #define CERR( ... ) VariadicCout( cerr , __VA_ARGS__ ) << endl #define COUT( ... ) VariadicCout( cout << "出力： " , __VA_ARGS__ ) << endl #define CERR_A( A , N ) OUTPUT_ARRAY( cerr , A , N ) << endl #define COUT_A( A , N ) cout << "出力： "; OUTPUT_ARRAY( cout , A , N ) << endl #define CERR_ITR( A ) OUTPUT_ITR( cerr , A ) << endl #define COUT_ITR( A ) cout << "出力： "; OUTPUT_ITR( cout , A ) << endl #else #pragma GCC optimize ( "O3" ) #pragma GCC optimize ( "unroll-loops" ) #pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" ) #define REPEAT_MAIN( BOUND ) START_MAIN; CEXPR( int , bound_test_case_num , BOUND ); int test_case_num = 1; if CE( bound_test_case_num > 1 ){ SET_ASSERT( test_case_num , 1 , bound_test_case_num ); } FINISH_MAIN #define DEXPR( LL , BOUND , VALUE , DEBUG_VALUE ) CEXPR( LL , BOUND , VALUE ) #define ASSERT( A , MIN , MAX ) AS( ( MIN ) <= A && A <= ( MAX ) ) #define SET_ASSERT( A , MIN , MAX ) SET_LL( A ); ASSERT( A , MIN , MAX ) #define SOLVE_ONLY #define CERR( ... ) #define COUT( ... ) VariadicCout( cout , __VA_ARGS__ ) << ENDL #define CERR_A( A , N ) #define COUT_A( A , N ) OUTPUT_ARRAY( cout , A , N ) << ENDL #define CERR_ITR( A ) #define COUT_ITR( A ) OUTPUT_ITR( cout , A ) << ENDL #endif #ifdef REACTIVE #define ENDL endl #else #define ENDL "\n" #endif #ifdef USE_GETLINE #define SET_LL( A ) { GETLINE( A ## _str ); A = stoll( A ## _str ); } #define GETLINE_SEPARATE( SEPARATOR , ... ) SOLVE_ONLY; string __VA_ARGS__; VariadicGetline( cin , SEPARATOR , __VA_ARGS__ ) #define GETLINE( ... ) SOLVE_ONLY; GETLINE_SEPARATE( '\n' , __VA_ARGS__ ) #else #define SET_LL( A ) cin >> A #define CIN( LL , ... ) SOLVE_ONLY; LL __VA_ARGS__; VariadicCin( cin , __VA_ARGS__ ) #define SET_A( A , N ) SOLVE_ONLY; FOR( VARIABLE_FOR_CIN_A , 0 , N ){ cin >> A[VARIABLE_FOR_CIN_A]; } #define CIN_A( LL , A , N ) VE A( N ); SET_A( A , 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 FINISH_MAIN REPEAT( test_case_num ){ if CE( bound_test_case_num > 1 ){ CERR( "testcase " , VARIABLE_FOR_REPEAT_test_case_num , ":" ); } Solve(); CERR( "" ); } } #define START_WATCH chrono::system_clock::time_point watch = chrono::system_clock::now() #define CURRENT_TIME static_cast( chrono::duration_cast( chrono::system_clock::now() - watch ).count() / 1000.0 ) #define CHECK_WATCH( TL_MS ) ( CURRENT_TIME < TL_MS - 100.0 ) #define CEXPR( LL , BOUND , VALUE ) CE LL BOUND = VALUE #define CIN_ASSERT( A , MIN , MAX ) decldecay_t( MAX ) A; SET_ASSERT( A , MIN , MAX ) #define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( decldecay_t( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ ) #define FOREQ( VAR , INITIAL , FINAL ) for( decldecay_t( FINAL ) VAR = INITIAL ; VAR <= FINAL ; VAR ++ ) #define FOREQINV( VAR , INITIAL , FINAL ) for( decldecay_t( INITIAL ) VAR = INITIAL ; VAR + 1 > FINAL ; VAR -- ) #define AUTO_ITR( ARRAY ) auto itr_ ## ARRAY = ARRAY .BE() , end_ ## ARRAY = ARRAY .EN() #define FOR_ITR( ARRAY ) for( AUTO_ITR( ARRAY ) , itr = itr_ ## ARRAY ; itr_ ## ARRAY != end_ ## ARRAY ; itr_ ## ARRAY ++ , itr++ ) #define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT_ ## HOW_MANY_TIMES , 0 , HOW_MANY_TIMES ) #define SET_PRECISION( DECIMAL_DIGITS ) cout << fixed << setprecision( DECIMAL_DIGITS ) #define OUTPUT_ARRAY( OS , A , N ) FOR( VARIABLE_FOR_OUTPUT_ARRAY , 0 , N ){ OS << A[VARIABLE_FOR_OUTPUT_ARRAY] << (VARIABLE_FOR_OUTPUT_ARRAY==N-1?"":" "); } OS #define OUTPUT_ITR( OS , A ) { auto ITERATOR_FOR_OUTPUT_ITR = A.BE() , EN_FOR_OUTPUT_ITR = A.EN(); bool VARIABLE_FOR_OUTPUT_ITR = ITERATOR_FOR_COUT_ITR != END_FOR_COUT_ITR; WH( VARIABLE_FOR_OUTPUT_ITR ){ OS << *ITERATOR_FOR_COUT_ITR; ( VARIABLE_FOR_OUTPUT_ITR = ++ITERATOR_FOR_COUT_ITR != END_FOR_COUT_ITR ) ? OS : OS << " "; } } OS #define RETURN( ... ) SOLVE_ONLY; COUT( __VA_ARGS__ ); RE #define COMPARE( ... ) auto naive = Naive( __VA_ARGS__ ); auto answer = Answer( __VA_ARGS__ ); bool match = naive == answer; COUT( "(" , #__VA_ARGS__ , ") == (" , __VA_ARGS__ , ") : Naive == " , naive , match ? "==" : "!=" , answer , "== Answer" ); if( !match ){ RE; } // 圧縮用 #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 PW Power #define MO move #define TH this #define CRI CO int& #define CRUI CO uint& #define CRL CO ll& #define ST_AS static_assert #define reMO_CO remove_const #define is_COructible_v is_constructible_v #define rBE rbegin #define reSZ // 型のエイリアス #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; TE US T2 = pair; TE US T3 = tuple; TE US T4 = tuple; US path = pair; // 入出力用 TE IN basic_istream& VariadicCin( basic_istream& is ) { RE is; } TE IN basic_istream& VariadicCin( basic_istream& is , Arg& arg , ARGS&... args ) { RE VariadicCin( is >> arg , args... ); } TE IN basic_istream& VariadicGetline( basic_istream& is , CO char& separator ) { RE is; } TE IN basic_istream& VariadicGetline( basic_istream& is , CO char& separator , Arg& arg , ARGS&... args ) { RE VariadicGetline( getline( is , arg , separator ) , separator , args... ); } TE IN basic_ostream& operator<<( basic_ostream& os , CO VE& arg ) { auto BE = arg.BE() , EN = arg.EN(); auto itr = BE; WH( itr != EN ){ ( itr == BE ? os : os << " " ) << *itr; itr++; } RE os; } TE IN basic_ostream& VariadicCout( basic_ostream& os , CO Arg& arg ) { RE os << arg; } TE IN basic_ostream& VariadicCout( basic_ostream& os , CO Arg1& arg1 , CO Arg2& arg2 , CO ARGS&... args ) { RE VariadicCout( os << arg1 << " " , arg2 , args... ); } // 算術用 TE CE T PositiveBaseResidue( CO T& a , CO T& p ){ RE a >= 0 ? a % p : p - 1 - ( ( - ( a + 1 ) ) % p ); } TE CE T Residue( CO T& a , CO T& p ){ RE PositiveBaseResidue( a , p < 0 ? -p : p ); } TE CE T PositiveBaseQuotient( CO T& a , CO T& p ){ RE ( a - PositiveBaseResidue( a , p ) ) / p; } TE CE T Quotient( CO T& a , CO T& p ){ RE p < 0 ? PositiveBaseQuotient( -a , -p ) : PositiveBaseQuotient( a , p ); } #define POWER( ANSWER , ARGUMENT , EXPONENT ) \ ST_AS( ! is_same::value && ! is_same::value ); \ decldecay_t( ARGUMENT ) ANSWER{ 1 }; \ { \ decldecay_t( ARGUMENT ) ARGUMENT_FOR_SQUARE_FOR_POWER = ( ARGUMENT ); \ decldecay_t( EXPONENT ) EXPONENT_FOR_SQUARE_FOR_POWER = ( EXPONENT ); \ WH( EXPONENT_FOR_SQUARE_FOR_POWER != 0 ){ \ if( EXPONENT_FOR_SQUARE_FOR_POWER % 2 == 1 ){ \ ANSWER *= ARGUMENT_FOR_SQUARE_FOR_POWER; \ } \ ARGUMENT_FOR_SQUARE_FOR_POWER *= ARGUMENT_FOR_SQUARE_FOR_POWER; \ EXPONENT_FOR_SQUARE_FOR_POWER /= 2; \ } \ } \ #define POWER_MOD( ANSWER , ARGUMENT , EXPONENT , MODULO ) \ ll ANSWER{ 1 }; \ { \ ll ARGUMENT_FOR_SQUARE_FOR_POWER = ( ( ARGUMENT ) % ( MODULO ) ) % ( MODULO ); \ ARGUMENT_FOR_SQUARE_FOR_POWER < 0 ? ARGUMENT_FOR_SQUARE_FOR_POWER += ( MODULO ) : ARGUMENT_FOR_SQUARE_FOR_POWER; \ decldecay_t( EXPONENT ) EXPONENT_FOR_SQUARE_FOR_POWER = ( EXPONENT ); \ WH( EXPONENT_FOR_SQUARE_FOR_POWER != 0 ){ \ if( EXPONENT_FOR_SQUARE_FOR_POWER % 2 == 1 ){ \ ANSWER = ( ANSWER * ARGUMENT_FOR_SQUARE_FOR_POWER ) % ( MODULO ); \ } \ ARGUMENT_FOR_SQUARE_FOR_POWER = ( ARGUMENT_FOR_SQUARE_FOR_POWER * ARGUMENT_FOR_SQUARE_FOR_POWER ) % ( MODULO ); \ EXPONENT_FOR_SQUARE_FOR_POWER /= 2; \ } \ } \ #define FACTORIAL_MOD( ANSWER , ANSWER_INV , INVERSE , MAX_INDEX , CE_LENGTH , MODULO ) \ ll ANSWER[CE_LENGTH]; \ ll ANSWER_INV[CE_LENGTH]; \ ll INVERSE[CE_LENGTH]; \ { \ ll VARIABLE_FOR_PRODUCT_FOR_FACTORIAL = 1; \ ANSWER[0] = VARIABLE_FOR_PRODUCT_FOR_FACTORIAL; \ FOREQ( i , 1 , MAX_INDEX ){ \ ANSWER[i] = ( VARIABLE_FOR_PRODUCT_FOR_FACTORIAL *= i ) %= ( MODULO ); \ } \ ANSWER_INV[0] = ANSWER_INV[1] = INVERSE[1] = VARIABLE_FOR_PRODUCT_FOR_FACTORIAL = 1; \ FOREQ( i , 2 , MAX_INDEX ){ \ ANSWER_INV[i] = ( VARIABLE_FOR_PRODUCT_FOR_FACTORIAL *= INVERSE[i] = ( MODULO ) - ( ( ( ( MODULO ) / i ) * INVERSE[ ( MODULO ) % i ] ) % ( MODULO ) ) ) %= ( MODULO ); \ } \ } \ // 二分探索用 // EXPRESSIONがANSWERの広義単調関数の時、EXPRESSION >= CO_TARGETの整数解を格納。 #define BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , DESIRED_INEQUALITY , CO_TARGET , INEQUALITY_FOR_CHECK , UPDATE_U , UPDATE_L , UPDATE_ANSWER ) \ ST_AS( ! is_same::value && ! is_same::value ); \ ll ANSWER = MINIMUM; \ { \ ll L_BS = MINIMUM; \ ll U_BS = MAXIMUM; \ ANSWER = UPDATE_ANSWER; \ ll EXPRESSION_BS; \ CO ll CO_TARGET_BS = ( CO_TARGET ); \ ll DIFFERENCE_BS; \ WH( L_BS < U_BS ){ \ DIFFERENCE_BS = ( EXPRESSION_BS = ( EXPRESSION ) ) - CO_TARGET_BS; \ CERR( "二分探索中：" , "L_BS =" , L_BS , "<=" , #ANSWER , "=" , ANSWER , "<=" , U_BS , "= U_BS :" , #EXPRESSION , "-" , #CO_TARGET , "=" , EXPRESSION_BS , "-" , CO_TARGET_BS , "=" , DIFFERENCE_BS ); \ if( DIFFERENCE_BS INEQUALITY_FOR_CHECK 0 ){ \ U_BS = UPDATE_U; \ } else { \ L_BS = UPDATE_L; \ } \ ANSWER = UPDATE_ANSWER; \ } \ if( L_BS > U_BS ){ \ CERR( "二分探索失敗：" , "L_BS =" , L_BS , ">" , U_BS , "= U_BS :" , #ANSWER , ":=" , #MAXIMUM , "+ 1 =" , MAXIMUM + 1 ); \ CERR( "二分探索マクロにミスがある可能性があります。変更前の版に戻してください。" ); \ ANSWER = MAXIMUM + 1; \ } else { \ CERR( "二分探索終了：" , "L_BS =" , L_BS , "<=" , #ANSWER , "=" , ANSWER , "<=" , U_BS , "= U_BS" ); \ CERR( "二分探索が成功したかを確認するために" , #EXPRESSION , "を計算します。" ); \ CERR( "成功判定が不要な場合はこの計算を削除しても構いません。" ); \ EXPRESSION_BS = ( EXPRESSION ); \ CERR( "二分探索結果：" , #EXPRESSION , "=" , EXPRESSION_BS , ( EXPRESSION_BS > CO_TARGET_BS ? ">" : EXPRESSION_BS < CO_TARGET_BS ? "<" : "=" ) , CO_TARGET_BS ); \ if( EXPRESSION_BS DESIRED_INEQUALITY CO_TARGET_BS ){ \ CERR( "二分探索成功：" , #ANSWER , ":=" , ANSWER ); \ } else { \ CERR( "二分探索失敗：" , #ANSWER , ":=" , #MAXIMUM , "+ 1 =" , MAXIMUM + 1 ); \ CERR( "単調でないか、単調増加性と単調減少性を逆にしてしまったか、探索範囲内に解が存在しません。" ); \ ANSWER = MAXIMUM + 1; \ } \ } \ } \ // 単調増加の時にEXPRESSION >= CO_TARGETの最小解を格納。 #define BS1( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , >= , CO_TARGET , >= , ANSWER , ANSWER + 1 , ( L_BS + U_BS ) / 2 ) \ // 単調増加の時にEXPRESSION <= CO_TARGETの最大解を格納。 #define BS2( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , <= , CO_TARGET , > , ANSWER - 1 , ANSWER , ( L_BS + 1 + U_BS ) / 2 ) \ // 単調減少の時にEXPRESSION >= CO_TARGETの最大解を格納。 #define BS3( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , >= , CO_TARGET , < , ANSWER - 1 , ANSWER , ( L_BS + 1 + U_BS ) / 2 ) \ // 単調減少の時にEXPRESSION <= CO_TARGETの最小解を格納。 #define BS4( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , CO_TARGET ) \ BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , <= , CO_TARGET , <= , ANSWER , ANSWER + 1 , ( L_BS + U_BS ) / 2 ) \ // t以下の値が存在すればその最大値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MaximumLeq( set& S , CO T& t ) { CO auto EN = S.EN(); if( S.empty() ){ RE EN; } auto itr = S.upper_bound( t ); RE itr == EN ? S.find( *( S.rBE() ) ) : itr == S.BE() ? EN : --itr; } // t未満の値が存在すればその最大値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MaximumLt( set& S , CO T& t ) { CO auto EN = S.EN(); if( S.empty() ){ RE EN; } auto itr = S.lower_bound( t ); RE itr == EN ? S.find( *( S.rBE() ) ) : itr == S.BE() ? EN : --itr; } // t以上の値が存在すればその最小値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MinimumGeq( set& S , CO T& t ) { RE S.lower_bound( t ); } // tより大きい値が存在すればその最小値のiterator、存在しなければend()を返す。 TE IN TY set::iterator MinimumGt( set& S , CO T& t ) { RE S.upper_bound( t ); } // データ構造用 TE TY V> IN V OP+( CO V& a0 , CO V& a1 ) { if( a0.empty() ){ RE a1; } if( a1.empty() ){ RE a0; } AS( a0.SZ() == a1.SZ() ); V answer{}; for( auto itr0 = a0.BE() , itr1 = a1.BE() , EN0 = a0.EN(); itr0 != EN0 ; itr0++ , itr1++ ){ answer.push_back( *itr0 + *itr1 ); } RE answer; } TE IN pair OP+( CO pair& t0 , CO pair& t1 ) { RE { t0.first + t1.first , t0.second + t1.second }; } TE IN tuple OP+( CO tuple& t0 , CO tuple& t1 ) { RE { get<0>( t0 ) + get<0>( t1 ) , get<1>( t0 ) + get<1>( t1 ) , get<2>( t0 ) + get<2>( t1 ) }; } TE IN tuple OP+( CO tuple& t0 , CO tuple& t1 ) { RE { get<0>( t0 ) + get<0>( t1 ) , get<1>( t0 ) + get<1>( t1 ) , get<2>( t0 ) + get<2>( t1 ) , get<3>( t0 ) + get<3>( t1 ) }; } TE IN T Add( CO T& t0 , CO T& t1 ) { RE t0 + t1; } TE IN T XorAdd( CO T& t0 , CO T& t1 ){ RE t0 ^ t1; } TE IN T Multiply( CO T& t0 , CO T& t1 ) { RE t0 * t1; } TE IN CO T& Zero() { ST CO T z{}; RE z; } TE IN CO T& One() { ST CO T o = 1; RE o; }\ TE IN T AddInv( CO T& t ) { RE -t; } TE IN T Id( CO T& v ) { RE v; } TE IN T Min( CO T& a , CO T& b ){ RE a < b ? a : b; } TE IN T Max( CO T& a , CO T& b ){ RE a < b ? b : a; } // グリッド問題用 int H , W , H_minus , W_minus , HW; VE> non_wall; IN T2 EnumHW( CRI v ) { RE { v / W , v % W }; } IN int EnumHW_inv( CRI h , CRI w ) { RE h * W + w; } CO string direction[4] = {"U","R","D","L"}; // (i,j)->(k,h)の方向番号を取得 IN int DirectionNumberOnGrid( CRI i , CRI j , CRI k , CRI h ){RE ik?0:jh?3:(AS(false),-1);} // v->wの方向番号を取得 IN int DirectionNumberOnGrid( CRI v , CRI w ){auto [i,j]=EnumHW(v);auto [k,h]=EnumHW(w);RE DirectionNumberOnGrid(i,j,k,h);} // 方向番号の反転U<->D、R<->L IN int ReverseDirectionNumberOnGrid( CRI n ){AS(0<=n&&n<4);RE(n+2)%4;} IN VO SetEdgeOnGrid( CO string& Si , CRI i , LI ( &e )[] , CO char& walkable = '.' ){FOR(j,0,W){if(Si[j]==walkable){int v = EnumHW_inv(i,j);if(i>0){e[EnumHW_inv(i-1,j)].push_back(v);}if(i+10){e[EnumHW_inv(i,j-1)].push_back(v);}if(j+1 ( &e )[] , CO char& walkable = '.' ){FOR(j,0,W){if(Si[j]==walkable){CO int v=EnumHW_inv(i,j);if(i>0){e[EnumHW_inv(i-1,j)].push_back({v,1});}if(i+10){e[EnumHW_inv(i,j-1)].push_back({v,1});}if(j+1>& non_wall , CO char& walkable = '.' , CO char& unwalkable = '#' ){non_wall.push_back(VE(W));auto& non_wall_i=non_wall[i];FOR(j,0,W){non_wall_i[j]=Si[j]==walkable?true:(assert(Si[j]==unwalkable),false);}} // デバッグ用 #ifdef DEBUG IN VO AlertAbort( int n ) { CERR( "abort関数が呼ばれました。assertマクロのメッセージが出力されていない場合はオーバーフローの有無を確認をしてください。" ); } VO AutoCheck( int& exec_mode , CO bool& use_getline ); IN VO Solve(); IN VO Experiment(); IN VO SmallTest(); IN VO RandomTest(); ll GetRand( CRL Rand_min , CRL Rand_max ); IN VO BreakPoint( CRI LINE ) {} int exec_mode; CEXPR( int , solve_mode , 0 ); CEXPR( int , sample_debug_mode , 1 ); CEXPR( int , submission_debug_mode , 2 ); CEXPR( int , library_search_mode , 3 ); CEXPR( int , experiment_mode , 4 ); CEXPR( int , small_test_mode , 5 ); CEXPR( int , random_test_mode , 6 ); #ifdef USE_GETLINE CEXPR( bool , use_getline , true ); #else CEXPR( bool , use_getline , false ); #endif #else ll GetRand( CRL Rand_min , CRL Rand_max ) { ll answer = time( NULL ); RE answer * rand() % ( Rand_max + 1 - Rand_min ) + Rand_min; } #endif // VVV 常設ライブラリは以下に挿入する。 // Map // c:/Users/user/Documents/Programming/Mathematics/Function/Map/compress.txt 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 Map = conditional_t>,unordered_map,conditional_t,map,VO>>; // Algebra // c:/Users/user/Documents/Programming/Mathematics/Algebra/compress.txt #define DC_OF_CPOINT(POINT)IN CO U& POINT()CO NE #define DC_OF_POINT(POINT)IN U& POINT() NE #define DF_OF_CPOINT(POINT)TE IN CO U& VirtualPointedSet::POINT()CO NE{RE Point();} #define DF_OF_POINT(POINT)TE IN U& VirtualPointedSet::POINT()NE{RE Point();} TE CL VirtualPointedSet{PU:virtual CO U& Point()CO NE = 0;virtual U& Point() NE = 0;DC_OF_CPOINT(Unit);DC_OF_CPOINT(Zero);DC_OF_CPOINT(One);DC_OF_CPOINT(Infty);DC_OF_CPOINT(size);DC_OF_POINT(init);DC_OF_POINT(root);};TE CL PointedSet:virtual PU VirtualPointedSet{PU:U m_b_U;IN PointedSet(CO U& b_u = U());IN CO U& Point()CO NE;IN U& Point() NE;};TE CL VirtualNSet{PU:virtual U Transfer(CO U& u)= 0;IN U Inverse(CO U& u);};TE CL AbstractNSet:virtual PU VirtualNSet{PU:F_U& m_f_U;IN AbstractNSet(F_U& f_U);IN U Transfer(CO U& u);};TE CL VirtualMagma{PU:virtual U Product(CO U& u0,CO U& u1)= 0;IN U Sum(CO U& u0,CO U& u1);};TE CL AbstractMagma:virtual PU VirtualMagma{PU:M_U& m_m_U;IN AbstractMagma(M_U& m_U);IN U Product(CO U& u0,CO U& u1);}; TE IN PointedSet::PointedSet(CO U& b_U):m_b_U(b_U){}TE IN CO U& PointedSet::Point()CO NE{RE m_b_U;}TE IN U& PointedSet::Point()NE{RE m_b_U;}DF_OF_CPOINT(Unit);DF_OF_CPOINT(Zero);DF_OF_CPOINT(One);DF_OF_CPOINT(Infty);DF_OF_CPOINT(size);DF_OF_POINT(init);DF_OF_POINT(root);TE IN AbstractNSet::AbstractNSet(F_U& f_U):m_f_U(f_U){ST_AS(is_invocable_r_v);}TE IN U AbstractNSet::Transfer(CO U& u){RE m_f_U(u);}TE IN U VirtualNSet::Inverse(CO U& u){RE Transfer(u);}TE IN AbstractMagma::AbstractMagma(M_U& m_U):m_m_U(m_U){ST_AS(is_invocable_r_v);}TE IN U AbstractMagma::Product(CO U& u0,CO U& u1){RE m_m_U(u0,u1);}TE IN U VirtualMagma::Sum(CO U& u0,CO U& u1){RE Product(u0,u1);} TE CL VirtualMonoid:virtual PU VirtualMagma,virtual PU VirtualPointedSet{};TE CL AdditiveMonoid:virtual PU VirtualMonoid,PU PointedSet{PU:IN U Product(CO U& u0,CO U& u1);};TE CL MultiplicativeMonoid:virtual PU VirtualMonoid,PU PointedSet{PU:IN MultiplicativeMonoid(CO U& e_U);IN U Product(CO U& u0,CO U& u1);};TE CL AbstractMonoid:virtual PU VirtualMonoid,PU AbstractMagma,PU PointedSet{PU:IN AbstractMonoid(M_U& m_U,CO U& e_U);IN U Product(CO U& u0,CO U& u1);}; TE IN MultiplicativeMonoid::MultiplicativeMonoid(CO U& e_U):PointedSet(e_U){}TE IN AbstractMonoid::AbstractMonoid(M_U& m_U,CO U& e_U):AbstractMagma(m_U),PointedSet(e_U){}TE IN U AdditiveMonoid::Product(CO U& u0,CO U& u1){RE u0 + u1;}TE IN U MultiplicativeMonoid::Product(CO U& u0,CO U& u1){RE u0 * u1;}TE IN U AbstractMonoid::Product(CO U& u0,CO U& u1){RE m_m_U(u0,u1);} TE CL VirtualGroup:virtual PU VirtualMonoid,virtual PU VirtualPointedSet,virtual PU VirtualNSet{};TE CL AdditiveGroup:virtual PU VirtualGroup,PU AdditiveMonoid{PU:IN U Transfer(CO U& u);};TE CL AbstractGroup:virtual PU VirtualGroup,PU AbstractMonoid,PU AbstractNSet{PU:IN AbstractGroup(M_U& m_U,CO U& e_U,I_U& i_U);IN U Transfer(CO U& u);};TE IN AbstractGroup::AbstractGroup(M_U& m_U,CO U& e_U,I_U& i_U):AbstractMonoid(m_U,e_U),AbstractNSet(i_U){}TE IN U AbstractGroup::Transfer(CO U& u){RE m_i_U(u);}TE IN U AdditiveGroup::Transfer(CO U& u){RE -u;} TE CL VirtualRing{PU:GROUP m_R0;MONOID m_R1;IN VirtualRing(GROUP R0,MONOID R1);IN U Sum(CO U& u0,CO U& u1);IN CO U& Zero()CO NE;IN U Inverse(CO U& u);IN U Product(CO U& u0,CO U& u1);IN CO U& One()CO NE;IN GROUP& AdditiveGroup()NE;IN MONOID& MultiplicativeMonoid()NE;};TE CL Ring:virtual PU VirtualRing,MultiplicativeMonoid>{PU:IN Ring(CO U& one_U);};TE CL AbstractRing:virtual PU VirtualRing,AbstractMonoid>{PU:IN AbstractRing(A_U& a_U,CO U& z_U,I_U& i_U,M_U& m_U,CO U& e_U);}; TE IN VirtualRing::VirtualRing(GROUP R0,MONOID R1):m_R0(MO(R0)),m_R1(MO(R1)){}TE IN Ring::Ring(CO U& one_U):VirtualRing,MultiplicativeMonoid>(AdditiveGroup(),MultiplicativeMonoid(one_U)){}TE IN AbstractRing::AbstractRing(A_U& a_U,CO U& z_U,I_U& i_U,M_U& m_U,CO U& e_U):VirtualRing,AbstractMonoid>(AbstractGroup(a_U,z_U,i_U),AbstractMonoid(m_U,e_U)){}TE IN U VirtualRing::Sum(CO U& u0,CO U& u1){RE m_R0.Sum(u0,u1);}TE IN CO U& VirtualRing::Zero()CO NE{RE m_R0.Zero();}TE IN U VirtualRing::Inverse(CO U& u){RE m_R0.Inverse(u);}TE IN U VirtualRing::Product(CO U& u0,CO U& u1){RE m_R1.Product(u0,u1);}TE IN CO U& VirtualRing::One()CO NE{RE m_R1.One();}TE IN GROUP& VirtualRing::AdditiveGroup()NE{RE m_R0;}TE IN MONOID& VirtualRing::MultiplicativeMonoid()NE{RE m_R1;} // Graph // c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/compress.txt #define SFINAE_FOR_GRAPH TY T,TY E,enable_if_t,void*> PTR TE CL VirtualGraph:PU PointedSet{PU:E m_edge;IN VirtualGraph(CRI SZ,E edge);virtual R1 Enumeration(CRI i)= 0;virtual R2 Enumeration_inv(CO T& t)= 0;IN VO Reset();IN E& edge()NE;IN ret_t Edge(CO T& t);US type = T;};TE CL Graph:virtual PU VirtualGraph{PU:IN Graph(CRI SZ,E edge);IN CRI Enumeration(CRI i);IN CRI Enumeration_inv(CRI t);TE IN Graph GetGraph(F edge)CO;};TE CL EnumerationGraph:virtual PU VirtualGraph,ret_t,E>{PU:Enum_T& m_enum_T;Enum_T_inv& m_enum_T_inv;IN EnumerationGraph(CRI SZ,Enum_T& enum_T,Enum_T_inv& enum_T_inv,E edge);IN ret_t Enumeration(CRI i);IN ret_t Enumeration_inv(CO T& t);TE IN EnumerationGraph GetGraph(F edge)CO;};TE EnumerationGraph(CRI SZ,Enum_T& enum_T,Enum_T_inv& enum_T_inv,E edge)-> EnumerationGraph()(0)),Enum_T,Enum_T_inv,E>;TE CL MemorisationGraph:virtual PU VirtualGraph{PU:int m_LE;VE m_memory;Map m_memory_inv;IN MemorisationGraph(CRI SZ,E edge);IN T Enumeration(CRI i);IN CRI Enumeration_inv(CO T& t);IN VO Reset();TE IN MemorisationGraph GetGraph(F edge)CO;};TE MemorisationGraph(CRI SZ,E edge)-> MemorisationGraph()().back()),E>;TE MemorisationGraph(CRI SZ,E edge)-> MemorisationGraph(declval()().back())),E>; TE IN VirtualGraph::VirtualGraph(CRI SZ,E edge):PointedSet(SZ),m_edge(MO(edge)){ST_AS(is_COructible_v && is_COructible_v && is_invocable_v);}TE IN Graph::Graph(CRI SZ,E edge):VirtualGraph(SZ,MO(edge)){}TE IN EnumerationGraph::EnumerationGraph(CRI SZ,Enum_T& enum_T,Enum_T_inv& enum_T_inv,E edge):VirtualGraph,ret_t,E>(SZ,MO(edge)),m_enum_T(enum_T),m_enum_T_inv(enum_T_inv){}TE IN MemorisationGraph::MemorisationGraph(CRI SZ,E edge):VirtualGraph(SZ,MO(edge)),m_LE(),m_memory(),m_memory_inv(){}TE IN E& VirtualGraph::edge()NE{RE m_edge;}TE IN ret_t VirtualGraph::Edge(CO T& t){RE m_edge(t);}TE IN CRI Graph::Enumeration(CRI i){RE i;}TE IN ret_t EnumerationGraph::Enumeration(CRI i){RE m_enum_T(i);}TE IN T MemorisationGraph::Enumeration(CRI i){AS(0 <= i && i < m_LE);RE m_memory[i];}TE IN CRI Graph::Enumeration_inv(CRI i){RE i;}TE IN ret_t EnumerationGraph::Enumeration_inv(CO T& t){RE m_enum_T_inv(t);}TE IN CRI MemorisationGraph::Enumeration_inv(CO T& t){if(m_memory_inv.count(t)== 0){AS(m_LE < TH->SZ());m_memory.push_back(t);RE m_memory_inv[t]= m_LE++;}RE m_memory_inv[t];}TE VO VirtualGraph::Reset(){}TE IN VO MemorisationGraph::Reset(){m_LE = 0;m_memory.clear();m_memory_inv.clear();}TE TE IN Graph Graph::GetGraph(F edge)CO{RE Graph(TH->SZ(),MO(edge));}TE TE IN EnumerationGraph EnumerationGraph::GetGraph(F edge)CO{RE EnumerationGraph(TH->SZ(),m_enum_T,m_enum_T_inv,MO(edge));}TE TE IN MemorisationGraph MemorisationGraph::GetGraph(F edge)CO{RE MemorisationGraph(TH->SZ(),MO(edge));} // ConstexprModulo // c:/Users/user/Documents/Programming/Mathematics/Arithmetic/Mod/ConstexprModulo/compress.txt CEXPR(uint,P,998244353);TE CE INT& RS(INT& n)NE{RE n < 0?((((++n)*= -1)%= M)*= -1)+= M - 1:n %= M;}TE CE uint& RS(uint& n)NE{RE n %= M;}TE CE ull& RS(ull& n)NE{RE n %= M;}TE CE INT& RSP(INT& n)NE{CE CO uint trunc =(1 << 23)- 1;INT n_u = n >> 23;n &= trunc;INT n_uq =(n_u / 7)/ 17;n_u -= n_uq * 119;n += n_u << 23;RE n < n_uq?n += P - n_uq:n -= n_uq;}TE <> CE ull& RS(ull& n)NE{CE CO ull Pull = P;CE CO ull Pull2 =(Pull - 1)*(Pull - 1);RE RSP(n > Pull2?n -= Pull2:n);}TE CE INT RS(INT&& n)NE{RE MO(RS(n));}TE CE INT RS(CO INT& n)NE{RE RS(INT(n));} #define SFINAE_FOR_MOD(DEFAULT)TY T,enable_if_t>>* DEFAULT #define DC_OF_CM_FOR_MOD(FUNC)CE bool OP FUNC(CO Mod& n)CO NE #define DC_OF_AR_FOR_MOD(FUNC)CE Mod OP FUNC(CO Mod& n)CO NE;TE CE Mod OP FUNC(T&& n)CO NE; #define DF_OF_CM_FOR_MOD(FUNC)TE CE bool Mod::OP FUNC(CO Mod& n)CO NE{RE m_n FUNC n.m_n;} #define DF_OF_AR_FOR_MOD(FUNC,FORMULA)TE