#ifndef INCLUDE_MODE #define INCLUDE_MODE // #define REACTIVE // #define USE_GETLINE #endif #ifdef INCLUDE_MAIN IN VO Solve() { // // 数 // // DEXPR( ll , bound_N , 1e5 , 10 ); CIN_ASSERT( N , 1 , bound_N ); // CIN( ll , N , M , K ); // ll answer = 0; // RETURN( answer ); // // 配列 // using value_type = ll; // // using value_type = MP; // CIN( int , N ); // CIN_A( value_type , A , N ); CIN_A( value_type , B , N ); // // vector A( N ) , B( N ); FOR( i , 0 , N ){ cin >> A[i] >> B[i]; } // // 文字列 // CIN( int , N ); CIN( string , S , T ); // // 順列 // CIN( int , N ); vector A( N ) , A_inv( N ); // FOR( i , 0 , N ){ cin >> A[i]; A_inv[--A[i]] = i; } // // グラフ // CIN( int , N , M ); // // CIN( int , N ); int M = N - 1; // vector> e( N ); // // UnionFindForest uff{ N }; // FOR( j , 0 , M ){ // CIN( int , uj , vj ); uj--; vj--; // e[uj].push_back( vj ); e[vj].push_back( uj ); // // uff.Graft( uj , vj ); // } // Graph graph{ N , Get( e ) }; // BreadthFirstSearch bfs{ graph , 0 }; // // DepthFirstSearchOnTree dfst{ graph , 0 }; // 重み付きグラフ CIN( int , N , M , K ); CIN_A( int , S , K + 1 ); FOREQ( k , 0 , K ){ S[k]--; } // CIN( int , N ); int M = N - 1; vector> e( N ); // UnionFindForest uff{ N }; vector> d( N ); FOR( i , 0 , N ){ d[i].resize( N , 1e18 ); d[i][i] = 0; } FOR( j , 0 , M ){ CIN( ll , uj , vj , wj ); uj--; vj--; d[uj][vj] = d[vj][uj] = wj; // e[uj].push_back( { vj , wj } ); e[vj].push_back( { uj , wj } ); // uff.Graft( uj , vj , wj ); } // auto edge = [&]( const int& i ){ // list answer = e[i]; // return answer; // }; // Graph graph{ N , edge }; // Dijkstra dijk{ graph }; vector> weight; FloydWarshall( AdditiveTropicalSemirng( ll( 1e18 ) ) , d , weight ); vector init( K ); FOR( k , 0 , K ){ init[k] = weight[S[k]][S[k+1]]; } BIT bit{ init }; // 一般のクエリ CIN( int , Q ); // vector> query( Q ); FOR( q , 0 , Q ){ // CIN( ll , x , y ); x--; y--; // COUT( x + y ); CIN( int , type ); if( type == 1 ){ CIN( ll , x , y ); y--; S[x] = y; if( x > 0 ){ bit.Set( x - 1 , weight[S[x-1]][S[x]] ); } if( x + 1 < N ){ bit.Set( x , weight[S[x]][S[x+1]] ); } // query[q] = { type , x , y }; } else if( type == 2 ){ CIN( ll , x , y ); // query[q] = { type , x , y }; COUT( bit.IntervalSum( x , y - 1 ) ); } } // sort( query , query + Q ); // FOR( q , 0 , Q ){ // auto& [type,x,y] = query[q]; // } // // グリッド // // DEXPR( int , bound_H , 2e3 , 30 ); CEXPR( int , bound_W , bound_H ); // // ST_AS( ll( bound_H ) * bound_W < ll( 1 ) << 31 ); // // CEXPR( int , bound_HW , bound_H * bound_W ); // // SET_ASSERT( H , 1 , bound_H ); SET_ASSERT( W , 1 , bound_W ); // cin >> H >> W; H_minus = H - 1; W_minus = W - 1; HW = H * W; // vector S( H ); // // vector> e( HW ); // FOR( i , 0 , H ){ // cin >> S[i]; // // SetEdgeOnGrid( S[i] , i , e ); // // SetWallOnGrid( S[i] , i , non_wall ); // } // // {h,w}へデコード: EnumHW( v ) // // {h,w}をコード: EnumHW_inv( h , w ); // // (i,j)->(k,h)の方向番号を取得: DirectionNumberOnGrid( i , j , k , h ); // // v->wの方向番号を取得: DirectionNumberOnGrid( v , w ); // // 方向番号の反転U<->D、R<->L: ReverseDirectionNumberOnGrid( n ); } REPEAT_MAIN(1); #else // INCLUDE_MAIN #ifdef INCLUDE_SUB // 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 */ // VVV 常設でないライブラリは以下に挿入する。 TE CL VirtualSemirng{PU:VI U Sum(CO U& u0,CO U& u1)= 0;VI CO U& Zero()CO NE = 0;VI U Product(CO U& u0,CO U& u1)= 0;VI MONOID& AdditiveMonoid()NE = 0;VI SEMIGROUP& MultiplicativeSemigroup()NE = 0;US type = U;};TE CL AbstractSemirng:VI PU VirtualSemirng{PU:MONOID m_R0;SEMIGROUP m_R1;IN AbstractSemirng(MONOID R0,SEMIGROUP R1);IN U Sum(CO U& u0,CO U& u1);IN CO U& Zero()CO NE;IN U Product(CO U& u0,CO U& u1);IN MONOID& AdditiveMonoid()NE;IN SEMIGROUP& MultiplicativeSemigroup()NE;};TE CL Semirng:PU AbstractSemirng,MultiplicativeMagma>{PU:IN Semirng();}; TE IN AbstractSemirng::AbstractSemirng(MONOID R0,SEMIGROUP R1):m_R0(MO(R0)),m_R1(MO(R1)){}TE IN Semirng::Semirng():AbstractSemirng,MultiplicativeMagma>(AdditiveMonoid(),MultiplicativeMagma()){}TE IN U AbstractSemirng::Sum(CO U& u0,CO U& u1){RE m_R0.Sum(u0,u1);}TE IN CO U& AbstractSemirng::Zero()CO NE{RE m_R0.Zero();}TE IN U AbstractSemirng::Product(CO U& u0,CO U& u1){RE m_R1.Product(u0,u1);}TE IN MONOID& AbstractSemirng::AdditiveMonoid()NE{RE m_R0;}TE IN SEMIGROUP& AbstractSemirng::MultiplicativeSemigroup()NE{RE m_R1;} TE CL VirtualMeetSemilattice:VI PU VirtualMonoid{PU:IN U Meet(CO U& u0,CO U& u1);};TE CL MinSemilattice:VI PU VirtualMeetSemilattice,PU PointedSet{PU:IN MinSemilattice(CO U& infty_U);IN U Product(CO U& u0,CO U& u1);};TE CL MaxSemilattice:VI PU VirtualMeetSemilattice,PU PointedSet{PU:IN MaxSemilattice(CO U& zero_U);IN U Product(CO U& u0,CO U& u1);}; TE IN U VirtualMeetSemilattice::Meet(CO U& u0,CO U& u1){RE TH->Product(u0,u1);}TE IN MinSemilattice::MinSemilattice(CO U& infty_U):PointedSet(infty_U){}TE IN MaxSemilattice::MaxSemilattice(CO U& zero_U):PointedSet(zero_U){}TE IN U MinSemilattice::Product(CO U& u0,CO U& u1){RE u0 < u1?u0:u1;} TE IN U MaxSemilattice::Product(CO U& u0,CO U& u1){RE u1 < u0?u0:u1;} TE CL VirtualMeetSemirng:VI PU VirtualSemirng{PU:IN CO U& Infty();IN U Meet(CO U& u0,CO U& u1);};TE CL AbstractTropicalSemirng:VI PU VirtualMeetSemirng,SEMIGROUP>,PU AbstractSemirng,SEMIGROUP>{PU:IN AbstractTropicalSemirng(CO U& infty_U,SEMIGROUP M);IN U Product(CO U& u0,CO U& u1);};TE CL AdditiveTropicalSemirng:PU AbstractTropicalSemirng>{PU:IN AdditiveTropicalSemirng(CO U& infty_U);};TE CL MultiplicativeTropicalSemirng:PU AbstractTropicalSemirng>{PU:IN MultiplicativeTropicalSemirng(CO U& infty_U);}; TE IN AbstractTropicalSemirng::AbstractTropicalSemirng(CO U& infty_U,SEMIGROUP M):AbstractSemirng,SEMIGROUP>(MinSemilattice(infty_U),MO(M)){}TE IN AdditiveTropicalSemirng::AdditiveTropicalSemirng(CO U& infty_U):AbstractTropicalSemirng>(infty_U,AdditiveMagma()){}TE IN MultiplicativeTropicalSemirng::MultiplicativeTropicalSemirng(CO U& infty_U):AbstractTropicalSemirng>(infty_U,MultiplicativeMagma()){}TE IN CO U& VirtualMeetSemirng::Infty(){RE TH->Zero();}TE IN U VirtualMeetSemirng::Meet(CO U& u0,CO U& u1){RE TH->Sum(u0,u1);}TE IN U AbstractTropicalSemirng::Product(CO U& u0,CO U& u1){CO U& infty = TH->Infty();RE u0 < infty && u1 < infty?TH->MultiplicativeSemigroup().Product(u0,u1):infty;} TE VO FloydWarshall(IDEMPOTENT_SEMIRNG R,CO VE>& d,VE>& weight){CO int SZ = d.SZ();AS(SZ > 0?SZ == int(d[0].SZ()):true);weight = d;CO U& infty = R.Infty();for(int k = 0;k < SZ;k++){auto& weight_k = weight[k];for(int i = 0;i < SZ;i++){auto& weight_i = weight[i];CO U& weight_ik = weight_i[k];if(i != k && weight_ik != infty){for(int j = 0;j < SZ;j++){CO U& weight_kj = weight_k[j];if(i != j && k != j && weight_kj != infty){U& weight_ij = weight_i[j];weight_ij = R.Meet(weight_ij,R.Product(weight_ik,weight_kj));}}}}}RE;}TE VO FloydWarshall(TROPICAL_SEMIRNG R,CO VE>& d,VE>& weight,VE>& path){CO int SZ = d.SZ();AS(SZ > 0?SZ == int(d[0].SZ()):true);weight = d;path = VE>(SZ,VE(SZ,-1));CO U& infty = R.Infty();for(int k = 0;k < SZ;k++){auto& weight_k = weight[k];for(int i = 0;i < SZ;i++){auto& weight_i = weight[i];auto& path_i = path[i];CO U& weight_ik = weight_i[k];if(i != k && weight_ik != infty){for(int j = 0;j < SZ;j++){CO U& weight_kj = weight_k[j];if(i != j && k != j && weight_kj != infty){U& weight_ij = weight_i[j];U weight_curr = R.Product(weight_ik,weight_kj);if(weight_ij > weight_curr){weight_ij = MO(weight_curr);path_i[j]= k;}}}}}}RE;} TE CL AbstractBIT{PU:ABELIAN_GROUP m_M;int m_SZ;VE m_fenwick;int m_PW;IN AbstractBIT(ABELIAN_GROUP M,CRI SZ = 0);IN AbstractBIT(ABELIAN_GROUP M,CO VE& a);TE IN VO Reset(CO Args&... args);IN VO Set(CRI i,CO U& u);IN AbstractBIT& OP+=(CO VE& a);VO Add(CRI i,CO U& u);IN CRI SZ()CO NE;IN U OP[](CRI i)CO;IN U Get(CRI i)CO;IN CO U& LSBSegmentSum(CRI j)CO;U InitialSegmentSum(CRI i_final);IN U IntervalSum(CRI i_start,CRI i_final);int BinarySearch(CO U& u);IN int BinarySearch(CRI i_start,CO U& u);IN VO Initialise();};TE AbstractBIT(ABELIAN_GROUP M,CO Args&... args)-> AbstractBIT,ABELIAN_GROUP>;TE CL BIT:PU AbstractBIT>{PU:TE IN BIT(CO Args&... args);};TE BIT(CO VE& a)-> BIT; TE IN AbstractBIT::AbstractBIT(ABELIAN_GROUP M,CRI SZ):m_M(MO(M)),m_SZ(SZ),m_fenwick(m_SZ + 1,m_M.Zero()),m_PW(1){Initialise();}TE IN AbstractBIT::AbstractBIT(ABELIAN_GROUP M,CO VE& a):m_M(MO(M)),m_SZ(a.SZ()),m_fenwick(m_SZ + 1,m_M.Zero()),m_PW(1){Initialise();for(int j = 1;j <= m_SZ;j++){U& fenwick_j = m_fenwick[j];int i = j - 1;fenwick_j = a[i];int i_lim = j -(j & -j);WH(i > i_lim){fenwick_j = m_M.Sum(fenwick_j,m_fenwick[i]);i -=(i & -i);}}}TE IN VO AbstractBIT::Initialise(){ST_AS(is_same_v>);WH(m_PW < m_SZ){m_PW <<= 1;}}TE TE IN BIT::BIT(CO Args&... args):AbstractBIT>(AdditiveGroup(),args...){ST_AS(!is_same_v);}TE TE IN VO AbstractBIT::Reset(CO Args&... args){*TH = AbstractBIT(MO(m_M),args...);}TE IN VO AbstractBIT::Set(CRI i,CO U& u){Add(i,m_M.Sum(m_M.Inverse(IntervalSum(i,i)),u));}TE IN AbstractBIT& AbstractBIT::OP+=(CO VE& a){AbstractBIT a_copy{m_M,a};AS(m_SZ == a_copy.m_SZ);for(int j = 1;j <= m_SZ;j++){m_fenwick[j]= m_M.Sum(m_fenwick[j],a.m_fenwick[j]);}RE *TH;}TE VO AbstractBIT::Add(CRI i,CO U& u){int j = i + 1;WH(j <= m_SZ){U& m_fenwick_j = m_fenwick[j];m_fenwick_j = m_M.Sum(m_fenwick_j,u);j +=(j & -j);}RE;}TE IN CRI AbstractBIT::SZ()CO NE{RE m_SZ;}TE IN U AbstractBIT::OP[](CRI i)CO{AS(i < m_SZ);RE IntervalSum(i,i);}TE IN U AbstractBIT::Get(CRI i)CO{RE OP[](i);}TE IN CO U& AbstractBIT::LSBSegmentSum(CRI j)CO{AS(0 < j && j <= m_SZ);RE m_fenwick[j];}TE U AbstractBIT::InitialSegmentSum(CRI i_final){U sum = m_M.Zero();int j = min(i_final + 1,m_SZ);WH(j > 0){sum = m_M.Sum(sum,m_fenwick[j]);j -= j & -j;}RE sum;}TE IN U AbstractBIT::IntervalSum(CRI i_start,CRI i_final){RE m_M.Sum(m_M.Inverse(InitialSegmentSum(i_start - 1)),InitialSegmentSum(i_final));}TE int AbstractBIT::BinarySearch(CO U& u){int j = 0;int PW = m_PW;U sum = m_M.Zero();U sum_next = sum;WH(PW > 0){int j_next = j | PW;if(j_next < m_SZ){sum_next = m_M.Sum(sum_next,m_fenwick[j_next]);if(sum_next < u){sum = sum_next;j = j_next;}else{sum_next = sum;}}PW >>= 1;}RE j;}TE IN int AbstractBIT::BinarySearch(CRI i_start,CO U& u){RE max(i_start,m_M.Sum(BinarySearch(InitialSegmentSum(i_start - 1),u)));} // 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 VI virtual #define ST_AS static_assert #define reMO_CO remove_const #define is_COructible_v is_constructible_v #define rBE rbegin #define reSZ resize // 型のエイリアス #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; } TE TY V> IN auto Get( CO V& a ) { return [&]( CRI i = 0 ){ RE a[i]; }; } // グリッド問題用 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 , VE>& 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 UnderlyingSet{PU:US type = U;};TE CL VirtualPointedSet:VI PU UnderlyingSet{PU:VI CO U& Point()CO NE = 0;VI U& Point()NE = 0;DC_OF_CPOINT(Unit);DC_OF_CPOINT(Zero);DC_OF_CPOINT(One);DC_OF_CPOINT(Infty);DC_OF_POINT(init);DC_OF_POINT(root);};TE CL PointedSet:VI 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:VI PU UnderlyingSet{PU:VI U Transfer(CO U& u)= 0;IN U Inverse(CO U& u);};TE CL AbstractNSet:VI PU VirtualNSet{PU:F_U m_f_U;IN AbstractNSet(F_U f_U);IN U Transfer(CO U& u);};TE CL VirtualMagma:VI PU UnderlyingSet{PU:VI U Product(CO U& u0,CO U& u1)= 0;IN U Sum(CO U& u0,CO U& u1);};TE CL AdditiveMagma:VI PU VirtualMagma{PU:IN U Product(CO U& u0,CO U& u1);};TE CL MultiplicativeMagma:VI PU VirtualMagma{PU:IN U Product(CO U& u0,CO U& u1);};TE CL AbstractMagma:VI 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_POINT(init);DF_OF_POINT(root);TE IN AbstractNSet::AbstractNSet(F_U f_U):m_f_U(MO(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(MO(m_U)){ST_AS(is_invocable_r_v);}TE IN U AdditiveMagma::Product(CO U& u0,CO U& u1){RE u0 + u1;}TE IN U MultiplicativeMagma::Product(CO U& u0,CO U& u1){RE u0 * u1;}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:VI PU VirtualMagma,VI PU VirtualPointedSet{};TE CL AdditiveMonoid:VI PU VirtualMonoid,PU AdditiveMagma,PU PointedSet{};TE CL MultiplicativeMonoid:VI PU VirtualMonoid,PU MultiplicativeMagma,PU PointedSet{PU:IN MultiplicativeMonoid(CO U& e_U);};TE CL AbstractMonoid:VI PU VirtualMonoid,PU AbstractMagma,PU PointedSet{PU:IN AbstractMonoid(M_U m_U,CO U& e_U);}; TE IN MultiplicativeMonoid::MultiplicativeMonoid(CO U& e_U):PointedSet(e_U){}TE IN AbstractMonoid::AbstractMonoid(M_U m_U,CO U& e_U):AbstractMagma(MO(m_U)),PointedSet(e_U){} TE CL VirtualGroup:VI PU VirtualMonoid,VI PU VirtualPointedSet,VI PU VirtualNSet{};TE CL AdditiveGroup:VI PU VirtualGroup,PU AdditiveMonoid{PU:IN U Transfer(CO U& u);};TE CL AbstractGroup:VI 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(MO(m_U),e_U),AbstractNSet(MO(i_U)){}TE IN U AbstractGroup::Transfer(CO U& u){RE TH->m_i_U(u);}TE IN U AdditiveGroup::Transfer(CO U& u){RE -u;} // Graph // c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/compress.txt TE CL VirtualGraph:VI PU UnderlyingSet{PU:VI R1 Enumeration(CRI i)= 0;VI R2 Enumeration_inv(CO T& t)= 0;IN VO Reset();VI CRI SZ()CO NE = 0;VI E& edge()NE = 0;VI ret_t Edge(CO T& t)= 0;};TE CL EdgeImplimentation:VI PU VirtualGraph{PU:int m_SZ;E m_edge;IN EdgeImplimentation(CRI SZ,E edge);IN CRI SZ()CO NE;IN E& edge()NE;IN ret_t Edge(CO T& t);};TE CL Graph:PU EdgeImplimentation{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:PU EdgeImplimentation,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:PU EdgeImplimentation{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 EdgeImplimentation::EdgeImplimentation(CRI SZ,E edge):m_SZ(SZ),m_edge(MO(edge)){ST_AS(is_COructible_v && is_COructible_v && is_invocable_v);}TE IN Graph::Graph(CRI SZ,E edge):EdgeImplimentation(SZ,MO(edge)){}TE IN EnumerationGraph::EnumerationGraph(CRI SZ,Enum_T enum_T,Enum_T_inv enum_T_inv,E edge):EdgeImplimentation,ret_t,E>(SZ,MO(edge)),m_enum_T(MO(enum_T)),m_enum_T_inv(MO(enum_T_inv)){}TE IN MemorisationGraph::MemorisationGraph(CRI SZ,E edge):EdgeImplimentation(SZ,MO(edge)),m_LE(),m_memory(),m_memory_inv(){ST_AS(is_invocable_v && is_invocable_v);}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