#ifndef INCLUDE_MODE #define INCLUDE_MODE // #define REACTIVE // #define USE_GETLINE #endif #ifdef INCLUDE_MAIN IN VO Solve() { CIN( int , N , M ); H = 316; W = 1e5; HW = H * W; auto edge = [&]( const T2& v ){ const int& x = get<0>( v ); const int A = get<1>( v ) + x; return A < W ? vector>{ { x , A } } : vector>{}; }; EnumerationGraph graph{ HW , EnumHW , EnumHW_inv , move( edge ) }; auto prev = [&]( const int& i ){ auto&& [x,A] = EnumHW( i ); return A >= x ? i - x : -1; }; AbstractDifferenceSequence ds{ move( graph ) , move( prev ) , AdditiveGroup() }; vector C( W ); REPEAT( N ){ CIN( int , L , R , X , Y ); int Z; if( X < H ){ ( ( Y < ( Z = L % X ) ? L += X : L ) -= Z ) += Y; ( ( Y <= ( Z = R % X ) ? R : R -= X ) -= Z ) += Y; --L; ( --R ) += X; ds.SubtreeAdd( { X , L } , vector>( R < W ? 1 : 0 , { X , R } ) , 1 ); } else { ( ( Y < ( Z = L % X ) ? L : L -= X ) -= Z ) += Y; --L; --R; while( ( L += X ) <= R ){ ++C[L]; } } } REPEAT( M ){ CIN( int , A ); int answer = C[--A]; FOR( X , 1 , H ){ answer += ds[ { X , A } ]; } COUT( answer ); } } REPEAT_MAIN(1); #else // INCLUDE_MAIN #ifdef INCLUDE_SUB // COMPAREに使用。圧縮時は削除する。 ll Naive( ll N , ll M , ll 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 ); // } // } // } } // 圧縮時は中身だけ削除する。 IN VO RandomTest() { // CEXPR( int , bound_N , 1e5 ); CIN_ASSERT( N , 1 , bound_N ); // CEXPR( ll , bound_M , 1e18 ); CIN_ASSERT( M , 1 , bound_M ); // CEXPR( ll , bound_K , 1e9 ); CIN_ASSERT( K , 1 , bound_K ); // COMPARE( N , M , N ); } #define INCLUDE_MAIN #include __FILE__ #else // INCLUDE_SUB #ifdef INCLUDE_LIBRARY /* C-x 3 C-x o C-x C-fによるファイル操作用 BFS (5KB) c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/BreadthFirstSearch/compress.txt CoordinateCompress (3KB) c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/CoordinateCompress/compress.txt DFSOnTree (11KB) c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/DepthFirstSearch/Tree/a.hpp Divisor (4KB) c:/Users/user/Documents/Programming/Mathematics/Arithmetic/Prime/Divisor/compress.txt IntervalAddBIT (9KB) c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/AffineSpace/BIT/IntervalAdd/compress.txt Polynomial (21KB) c:/Users/user/Documents/Programming/Mathematics/Polynomial/compress.txt UnionFind (3KB) c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/UnionFindForest/compress.txt */ // VVV 常設でないライブラリは以下に挿入する。 #ifdef DEBUG #include "c:/Users/user/Documents/Programming/Mathematics/SetTheory/DirectProduct/AffineSpace/DifferenceSequence/a_Body.hpp" #else CL LinearEdge{PU:int m_SZ;bool m_directed;IN LinearEdge(CRI SZ,CO bool& directed = true);IN VE OP()(CRI t);};CL LinearGraph:PU Graph{PU:IN LinearGraph(CRI SZ,CO bool& directed = true);}; IN LinearEdge::LinearEdge(CRI SZ,CO bool& directed):m_SZ(SZ),m_directed(directed){}IN VE LinearEdge::OP()(CRI t){VE AN{};if(!m_directed && t > 0){AN.push_back(t - 1);}if(t + 1 < m_SZ){AN.push_back(t + 1);}RE AN;}IN LinearGraph::LinearGraph(CRI SZ,CO bool& directed):Graph(SZ,LinearEdge(SZ,directed)){} CL LinearPrev{PU:IN int OP()(CRI i);};IN int LinearPrev::OP()(CRI i){RE i - 1;} TE VE> TopologicalSort(ACYCLIC_GRAPH& G){CRI SZ = G.SZ();VE> AN(SZ);VE edged(SZ),fixed(SZ);int num = SZ - 1;for(int i = 0;i < SZ;i++){if(!fixed[i]){VE> dfs ={{i}};WH(!dfs.empty()){auto& e = dfs.back();if(e.empty()){dfs.pop_back();}else{CRI j = e.back();if(fixed[j]){e.pop_back();}else{auto&& t = G.Enumeration(j);if(edged[j]){fixed[j]= true;AN[num--]= t;e.pop_back();}else{edged[j]= true;auto&& edge_t = G.Edge(t);VE edge_j{};for(auto& u:edge_t){auto&& k = G.Enumeration_inv(u);if(!fixed[k]){edge_j.push_back(k);}}dfs.push_back(MO(edge_j));}}}}}}RE AN;} TE tuple>,VE,VE,VE>> TopologicalSortedForest(DIRECTED_FOREST& G){VE> ts = TopologicalSort(G);CRI SZ = G.SZ();VE ts_inv(SZ);VE prev(SZ,-1);VE> edge(SZ);for(int i = SZ - 1;i >= 0;i--){auto& t = ts[i];auto&& edge_t = G.Edge(t);auto& edge_i = edge[i];edge_i.reserve(edge_t.SZ());for(auto& u:edge_t){CRI j = ts_inv[G.Enumeration_inv(u)];prev[j]= i;edge_i.push_back(j);}ts_inv[G.Enumeration_inv(t)]= i;}RE{MO(ts),MO(ts_inv),MO(prev),MO(edge)};} TE tuple>,VE,VE,VE>> TopologicalSortedTree(UNDIRECTED_TREE& G,CO inner_t& root){CRI SZ = G.SZ();US T = inner_t;VE> edge(SZ);VE dfs{root};WH(!dfs.empty()){CO T t = dfs.back();dfs.pop_back();auto& edge_i = edge[G.Enumeration_inv(t)];auto&& edge_t = G.Edge(t);for(auto& u:edge_t){auto&& j = G.Enumeration_inv(u);if(edge[j].empty()){edge_i.push_back(u);dfs.push_back(u);}}}auto G_dir = G.GetGraph([&](CO T& t)-> CO VE&{RE edge[G.Enumeration_inv(t)];});RE TopologicalSortedForest(G_dir);} TE CL AbstractDifferenceSequence{PU:FOREST m_G;PREV m_prev;GROUP m_M;VE m_a;int m_degree;IN AbstractDifferenceSequence(FOREST G,PREV prev,GROUP M,int degree = 1);IN AbstractDifferenceSequence(FOREST G,PREV prev,GROUP M,VE a,int degree = 0);TE IN VO Initialise(Args&&... args);IN VO Set(CO T& t,CO U& u,CRI degree = 0);IN VO Add(CO T& t,CO U& u,CRI degree = 0);IN VO FinalSegmentAdd(CO T& t_start,CO U& u,CRI degree = 0);IN VO SubtreeAdd(CO T& t_start,CO VE& t_outisde,CO U& u,CRI degree = 0);IN U OP[](CO T& t);IN CO U& Get(CO T& t,CRI degree = 0);IN CO U& InitialSegmentSum(CO T& t_final,CRI degree = 0);IN U IntervalSum(CO T& t_start,CO T& t_final,CRI degree = 0);IN AbstractDifferenceSequence(FOREST& G,PREV& prev,GROUP& M,VE a,int degree,int dummy);IN VO Shift(CRI degree);IN VO Shift(CRI degree_min,CRI degree_max);VO Integrate();VO Differentiate();};TE AbstractDifferenceSequence(FOREST G,PREV orev,GROUP M,Args&&... args)-> AbstractDifferenceSequence,FOREST,PREV,inner_t,GROUP>;TE CL DifferenceSequence:VI PU AbstractDifferenceSequence>{PU:IN DifferenceSequence(CRI SZ = 0,int degree = 1);IN DifferenceSequence(VE a,int degree = 0);IN VO IntervalAdd(CRI t_start,CRI t_final,CO U& u,CRI degree = 0);IN DifferenceSequence(CRI SZ,VE& a,int degree);}; TE IN AbstractDifferenceSequence::AbstractDifferenceSequence(FOREST G,PREV prev,GROUP M,int degree):AbstractDifferenceSequence(G,prev,M,VE(G.SZ(),M.Zero()),MO(degree),0){}TE IN AbstractDifferenceSequence::AbstractDifferenceSequence(FOREST& G,PREV& prev,GROUP& M,VE a,int degree,int dummy):AbstractDifferenceSequence(MO(G),MO(prev),MO(M),MO(a),MO(degree)){}TE IN AbstractDifferenceSequence::AbstractDifferenceSequence(FOREST G,PREV prev,GROUP M,VE a,int degree):m_G(MO(G)),m_prev(MO(prev)),m_M(MO(M)),m_a(MO(a)),m_degree(MO(degree)){ST_AS(is_invocable_r_v);}TE IN DifferenceSequence::DifferenceSequence(CRI SZ,int degree):DifferenceSequence(VE(SZ),MO(degree)){}TE IN DifferenceSequence::DifferenceSequence(VE a,int degree):DifferenceSequence(a.SZ(),a,MO(degree)){}TE IN DifferenceSequence::DifferenceSequence(CRI SZ,VE& a,int degree):AbstractDifferenceSequence>(LinearGraph(SZ,true),LinearPrev(),AdditiveGroup(),MO(a),MO(degree)){}TE TE IN VO AbstractDifferenceSequence::Initialise(Args&&... args){AbstractDifferenceSequence temp{m_G,m_M,MO(args)...};m_a = MO(temp.m_a);m_degree = temp.m_degree;}TE IN VO AbstractDifferenceSequence::Set(CO T& t,CO U& u,CRI degree){Add(t,m_M.Sum(m_M.Inverse(OP[](t)),u),degree);}TE IN VO AbstractDifferenceSequence::Add(CO T& t,CO U& u,CRI degree){if(u == m_M.Zero()){RE;}Shift(degree,degree + 1);auto&& i = m_G.Enumeration_inv(t);m_a[i]= m_M.Sum(MO(m_a[i]),u);if(m_degree > degree){CO U u_inv = m_M.Inverse(u);auto&& edge_t = m_G.Edge(t);for(auto& t_child:edge_t){U& m_a_t_child = m_a[m_G.Enumeration_inv(t_child)];m_a_t_child = m_M.Sum(MO(m_a_t_child),u_inv);}}}TE IN VO AbstractDifferenceSequence::FinalSegmentAdd(CO T& t_start,CO U& u,CRI degree){if(u == m_M.Zero()){RE;}Shift(degree + 1);U& m_a_i = m_a[m_G.Enumeration_inv(t_start)];m_a_i = m_M.Sum(MO(m_a_i),u);}TE IN VO AbstractDifferenceSequence::SubtreeAdd(CO T& t_start,CO VE& t_outsides,CO U& u,CRI degree){FinalSegmentAdd(t_start,u,degree);CO U u_inv = m_M.Inverse(u);for(auto& t_outside:t_outsides){FinalSegmentAdd(t_outside,u_inv,degree);}}TE IN VO DifferenceSequence::IntervalAdd(CRI t_start,CRI t_final,CO U& u,CRI degree){if(t_start <= t_final){TH->SubtreeAdd(t_start,VE(t_final + 1 < TH->m_G.SZ()?1:0,t_final + 1),u,degree);}}TE IN U AbstractDifferenceSequence::OP[](CO T& t){RE IntervalSum(t,t,0);}TE IN CO U& AbstractDifferenceSequence::Get(CO T& t,CRI degree){Shift(degree);RE m_a[m_G.Enumeration_inv(t)];}TE IN CO U& AbstractDifferenceSequence::InitialSegmentSum(CO T& t_final,CRI degree){RE Get(t_final,degree - 1);}TE IN U AbstractDifferenceSequence::IntervalSum(CO T& t_start,CO T& t_final,CRI degree){U AN = InitialSegmentSum(t_final,degree);auto&& i_prev = m_prev(m_G.Enumeration_inv(t_start));i_prev != -1?AN = m_M.Sum(MO(AN),m_M.Inverse(m_a[i_prev])):AN;RE AN;}TE IN VO AbstractDifferenceSequence::Shift(CRI degree){Shift(degree,degree);}TE IN VO AbstractDifferenceSequence::Shift(CRI degree_min,CRI degree_max){WH(m_degree < degree_min){Differentiate();}WH(m_degree > degree_max){Integrate();}}TE IN VO AbstractDifferenceSequence::Integrate(){m_degree--;CRI SZ = m_G.SZ();for(int i = 0;i < SZ;i++){auto&& edge_i = m_G.Edge(m_G.Enumeration(i));for(auto& t_child:edge_i){U& m_a_t_child = m_a[m_G.Enumeration_inv(t_child)];m_a_t_child = m_M.Sum(MO(m_a_t_child),m_a[i]);}}}TE IN VO AbstractDifferenceSequence::Differentiate(){m_degree++;for(int i = m_G.SZ()- 1;i >= 0;i--){CO U m_a_i_inv = m_M.Inverse(m_a[i]);auto&& edge_i = m_G.Edge(m_G.Enumeration(i));for(auto& t_child:edge_i){U& m_a_t_child = m_a[m_G.Enumeration_inv(t_child)];m_a_t_child = m_M.Sum(MO(m_a_t_child),m_a_i_inv);}}} #endif // AAA 常設でないライブラリは以上に挿入する。 #define INCLUDE_SUB #include __FILE__ #else // INCLUDE_LIBRARY #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( N , ... ) SOLVE_ONLY; VariadicResize( N , __VA_ARGS__ ); FOR( VARIABLE_FOR_SET_A , 0 , N ){ VariadicSet( cin , VARIABLE_FOR_SET_A , __VA_ARGS__ ); } #define CIN_A( LL , N , ... ) VE __VA_ARGS__; SET_A( N , __VA_ARGS__ ); #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 SET_A_ASSERT( A , N , MIN , MAX ) FOR( VARIABLE_FOR_SET_A , 0 , N ){ SET_ASSERT( A[VARIABLE_FOR_SET_A] , MIN , MAX ); } #define CIN_ASSERT( A , MIN , MAX ) decldecay_t( MAX ) A; SET_ASSERT( A , MIN , MAX ) #define CIN_A_ASSERT( A , N , MIN , MAX ) vector A( N ); SET_A_ASSERT( A , N , 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 CE T PositiveBaseModulo(T a,CO T& p){RE MO(a < 0?((((++a)*= -1)%= p)*= -1)+= p - 1:a < p?a:a %= p);} TE CE T Modulo(T a,CO T& p){RE PositiveBaseRS(MO(a),p < 0?-p:p);} TE CE T PositiveBaseQuotient(CO T& a,CO T& p){RE(a - PositiveBaseModulo(a,p))/ p;} TE CE T Quotient(CO T& a,CO T& p){RE p < 0?PositiveBaseQuotient(-a,-p):PositiveBaseQuotient(a,p);} // 二分探索用 // 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 , "=" , EXPRESSION_BS , DIFFERENCE_BS > 0 ? ">" : DIFFERENCE_BS < 0 ? "<" : "=" , CO_TARGET_BS , "=" , #CO_TARGET ); \ 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 ) // 尺取り法用 // VAR_TPA_LとVAR_TPA_RをINITで初期化し、VAR_TPA_RがCONTINUE_CONDITIONを満たす限り、 // 閉区間[VAR_TPA_L,VAR_TPA_R]が条件ON_CONDITIONを満たすか否かを判定し、 // trueになるかVAR_TAR_LがVAR_TAR_Rに追い付くまでVAR_TPA_Lの更新操作UPDATE_Lを繰り返し、 // その後VAR_TPA_Rの更新操作UPDATE_Rを行う。 // ON_CONDITIONがtrueとなる極大閉区間とその時点でのINFOをANSWERに格納する。 #define TPA( ANSWER , VAR_TPA , INIT , CONTINUE_CONDITION , UPDATE_L , UPDATE_R , ON_CONDITION , INFO ) \ VE> ANSWER{}; \ { \ auto init_TPA = INIT; \ decldecay_t( ANSWER.front() ) ANSWER ## _temp = { init_TPA , init_TPA , INFO }; \ auto ANSWER ## _prev = ANSWER ## _temp; \ auto& VAR_TPA ## _L = get<0>( ANSWER ## _temp ); \ auto& VAR_TPA ## _R = get<1>( ANSWER ## _temp ); \ auto& VAR_TPA ## _info = get<2>( ANSWER ## _temp ); \ bool on_TPA_prev = false; \ WH( true ){ \ bool continuing = CONTINUE_CONDITION; \ bool on_TPA = continuing && ( ON_CONDITION ); \ CERR( continuing ? "尺取り中" : "尺取り終了" , "： [L,R] = [" , VAR_TPA ## _L , "," , VAR_TPA ## _R , "] ," , on_TPA_prev ? "on" : "off" , "->" , on_TPA ? "on" : "off" , ", info =" , VAR_TPA ## _info ); \ if( on_TPA_prev && ! on_TPA ){ \ ANSWER.push_back( ANSWER ## _prev ); \ } \ if( continuing ){ \ if( on_TPA || VAR_TPA ## _L == VAR_TPA ## _R ){ \ ANSWER ## _prev = ANSWER ## _temp; \ UPDATE_R; \ } else { \ UPDATE_L; \ } \ } else { \ break; \ } \ on_TPA_prev = on_TPA; \ } \ } \ // データ構造用 TE TY V> IN auto OP+(CO V& a0,CO V& a1)-> decldecay_t((declval>().push_back(declval()),a0)){if(a0.empty()){RE a1;}if(a1.empty()){RE a0;}AS(a0.SZ()== a1.SZ());V AN{};for(auto IT0 = a0.BE(),IT1 = a1.BE(),EN0 = a0.EN();IT0 != EN0;IT0++,IT1++){AN.push_back(*IT0 + *IT1);}RE AN;} 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 Addition(CO T& t0,CO T& t1){RE t0 + t1;} TE IN T Xor(CO T& t0,CO T& t1){RE t0 ^ t1;} TE IN T MU(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 AdditionInv(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){RE[&](CRI i = 0){RE a[i];};} TE IN VE id(CRI SZ){VE AN(SZ);FOR(i,0,SZ){AN[i]= i;}RE AN;} // グリッド問題用 int H,W,H_minus,W_minus,HW; VE wall_str;VE > non_wall; char walkable = '.',unwalkable = '#'; IN T2 EnumHW(CRI v){RE{v / W,v % W};} IN int EnumHW_inv(CO T2& ij){auto&[i,j]= ij;RE i * W + j;} CO string direction[4]={"U","R","D","L"}; IN int DirectionNumberOnGrid(CRI i,CRI j,CRI k,CRI h){RE ik?0:jh?3:(AS(false),-1);} IN int DirectionNumberOnGrid(CRI v,CRI w){auto[i,j]=EnumHW(v);auto[k,h]=EnumHW(w);RE DirectionNumberOnGrid(i,j,k,h);} IN int ReverseDirectionNumberOnGrid(CRI n){AS(0<=n&&n<4);RE(n+2)%4;} IN VE EdgeOnGrid(CRI v){VEAN{};auto[i,j]=EnumHW(v);if(i>0&&wall_str[i-1][j]==walkable){AN.push_back(EnumHW_inv({i-1,j}));}if(i+10&&wall_str[i][j-1]==walkable){AN.push_back(EnumHW_inv({i,j-1}));}if(j+1 WeightedEdgeOnGrid(CRI v){VEAN{};auto[i,j]=EnumHW(v);if(i>0&&wall_str[i-1][j]==walkable){AN.push_back({EnumHW_inv({i-1,j}),1});}if(i+10&&wall_str[i][j-1]==walkable){AN.push_back({EnumHW_inv({i,j-1}),1});}if(j+1& S){if(S.empty()){S.reSZ(H);}cin>>S[i];AS(int(S[i].SZ())==W);} IN VO SetWallOnGrid(CRI i,VE>& b){if(b.empty()){b.reSZ(H,VE(W));}auto&S_i=wall_str[i];auto&b_i=b[i];FOR(j,0,W){b_i[j]=S_i[j]==walkable?false:(AS(S_i[j]==unwalkable),true);}} // VVV 常設ライブラリは以下に挿入する。 #ifdef DEBUG #include "C:/Users/user/Documents/Programming/Contest/Template/include/a_Body.hpp" #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 , VALUE1 , VALUE2 ) CEXPR( LL , BOUND , VALUE1 ) #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 // StdStream（2KB） #define DF_OF_COUT_FOR_VE(V)TE IN basic_ostream& OP<<(basic_ostream& os,CO V& arg) {auto BE = arg.BE(),EN = arg.EN();auto IT = BE;WH(IT != EN){(IT == BE?os:os << " ")<< *IT;IT++;}RE os;} 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& VariadicSet(basic_istream& is,CRI i){RE is;}TE IN basic_istream& VariadicSet(basic_istream& is,CRI i,Arg& arg,ARGS&... args){RE VariadicSet(is >> arg[i],i,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...);}DF_OF_COUT_FOR_VE(VE);DF_OF_COUT_FOR_VE(LI);DF_OF_COUT_FOR_VE(set);DF_OF_COUT_FOR_VE(unordered_set);TE IN basic_ostream& OP<<(basic_ostream& os,CO pair& arg){RE os << arg.first << " " << arg.second;}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...);} // Vector（1KB） IN void VariadicResize(CRI SZ){}TE IN void VariadicResize(CRI SZ,Arg& arg,ARGS&... args){arg.reSZ(SZ);VariadicResize(SZ,args...);} // Random（1KB） ll GetRand(CRI Rand_min,CRI Rand_max){ll AN = time(NULL);RE AN * rand()%(Rand_max + 1 - Rand_min)+ Rand_min;} // Set (1KB) 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 TY MOD>struct hash>{IN size_t OP()(CO MOD& n)CO;};TE TY PAIR>struct hash>{IN size_t OP()(CO PAIR& n)CO;};TE struct hash>{IN size_t OP()(CO tuple& n)CO;}; TE US Set = conditional_t>,unordered_set,conditional_t,set,VO>>;TE US Map = conditional_t>,unordered_map,conditional_t,map,VO>>; TE TY MOD> IN size_t hash>::OP()(CO MOD& n)CO{ST CO hash h;RE h(n.RP());}TE TY PAIR> IN size_t hash>::OP()(CO PAIR& n)CO{ST CO size_t seed = GetRand(1e3,1e8);ST CO hash h0;ST CO hash h1;RE(h0(get<0>(n))+ seed)^ h1(get<1>(n));}TE IN size_t hash>::OP()(CO tuple& n)CO{ST CO size_t seed = GetRand(1e3,1e8);ST CO hash> h01;ST CO hash h2;RE(h01({get<0>(n),get<1>(n)})+ seed)^ h2(get<2>(n));} // Algebra (4KB) #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(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(U u0,CO U& u1)= 0;IN U Sum(U u0,CO U& u1);};TE CL AdditiveMagma:VI PU VirtualMagma{PU:IN U Product(U u0,CO U& u1);};TE CL MultiplicativeMagma:VI PU VirtualMagma{PU:IN U Product(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(U u0,CO U& u1);}; TE IN PointedSet::PointedSet(U b_U):m_b_U(MO(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(U u0,CO U& u1){RE MO(u0 += u1);}TE IN U MultiplicativeMagma::Product(U u0,CO U& u1){RE MO(u0 *= u1);}TE IN U AbstractMagma::Product(U u0,CO U& u1){RE m_m_U(MO(u0),u1);}TE IN U VirtualMagma::Sum(U u0,CO U& u1){RE Product(MO(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(U e_U);};TE CL AbstractMonoid:VI PU VirtualMonoid,PU AbstractMagma,PU PointedSet{PU:IN AbstractMonoid(M_U m_U,U e_U);};TE IN MultiplicativeMonoid::MultiplicativeMonoid(U e_U):PointedSet(MO(e_U)){}TE IN AbstractMonoid::AbstractMonoid(M_U m_U,U e_U):AbstractMagma(MO(m_U)),PointedSet(MO(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,U e_U,I_U i_U);};TE IN AbstractGroup::AbstractGroup(M_U m_U,U e_U,I_U i_U):AbstractMonoid(MO(m_U),MO(e_U)),AbstractNSet(MO(i_U)){}TE IN U AdditiveGroup::Transfer(CO U& u){RE -u;} // Graph (5KB) TE CL VirtualGraph:VI PU UnderlyingSet{PU:VI R1 Enumeration(CRI i)= 0;IN R2 Enumeration_inv(CO T& t);TE IN R2 Enumeration_inv(CO PATH& p);IN VO Reset();VI CRI SZ()CO NE = 0;VI E& edge()NE = 0;VI ret_t Edge(CO T& t)= 0;TE IN ret_t Edge(CO PATH& p);ST IN CO T& Vertex(CO T& t)NE;TE ST IN CO T& Vertex(CO PATH& e)NE;VI R2 Enumeration_inv_Body(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);TE IN Graph GetGraph(F edge)CO;IN CRI Enumeration_inv_Body(CRI t);};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);TE IN EnumerationGraph GetGraph(F edge)CO;IN ret_t Enumeration_inv_Body(CO T& t);};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 VO Reset();TE IN MemorisationGraph GetGraph(F edge)CO;IN CRI Enumeration_inv_Body(CO T& t);};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 R2 VirtualGraph::Enumeration_inv(CO T& t){RE Enumeration_inv_Body(t);}TE TE IN R2 VirtualGraph::Enumeration_inv(CO PATH& p){RE Enumeration_inv_Body(get<0>(p));}TE IN CRI Graph::Enumeration_inv_Body(CRI i){RE i;}TE IN ret_t EnumerationGraph::Enumeration_inv_Body(CO T& t){RE m_enum_T_inv(t);}TE IN CRI MemorisationGraph::Enumeration_inv_Body(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 IN CRI EdgeImplimentation