#957498 (C++17) No.2642 Don't cut line!

提出ソース
結果

問題	No.2642 Don't cut line!
ユーザー	👑 p-adic
提出日時	2024-03-04 07:39:34
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	57,516 bytes
コンパイル時間	4,768 ms
コンパイル使用メモリ	281,764 KB
実行使用メモリ	45,588 KB
最終ジャッジ日時	2024-09-29 17:20:29
合計ジャッジ時間	11,892 ms
ジャッジサーバーID （参考情報）	judge1 / judge5
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	226 ms 45,460 KB
testcase_02	AC	237 ms 45,460 KB
testcase_03	AC	217 ms 45,588 KB
testcase_04	AC	235 ms 45,460 KB
testcase_05	AC	191 ms 45,412 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	120 ms 23,956 KB
testcase_17	AC	148 ms 39,764 KB
testcase_18	AC	169 ms 42,884 KB
testcase_19	AC	113 ms 32,592 KB
testcase_20	AC	76 ms 18,068 KB
testcase_21	AC	84 ms 15,796 KB
testcase_22	AC	91 ms 18,556 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	1 ms 6,820 KB
testcase_34	AC	2 ms 6,816 KB
testcase_35	AC	2 ms 6,820 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#ifndef INCLUDE_MODE
  #define INCLUDE_MODE
  // #define REACTIVE
  // #define USE_GETLINE
#endif

#ifdef INCLUDE_MAIN

IN VO Solve()
{
  CIN( int , N , M );
  CIN( ll , C );
  vector<list<T3<int>>> e0( N );
  vector<T2<int>> E{};
  vector<int> W{};
  vector<int> p{};
  FOR( j , 0 , M ){
    CIN( ll , uj , vj , wj , pj ); uj--; vj--;
    e0[uj].push_back( { vj , wj , j } );
    E.push_back( { uj , vj } );
    W.push_back( wj );
    p.push_back( pj );
  }
  Graph graph0{ N , Get( e0 ) };
  auto [T,num] = Kruscal( graph0 , E );
  assert( num == 1 );
  vector<list<path>> e1( N );
  ll sum = 0;
  for( auto& t : T ){
    auto& [uj,vj] = E[t];
    e1[uj].push_back( { vj , W[t] } ); e1[vj].push_back( { uj , W[t] } );
    sum += W[t];
  }
  if( sum > C ){
    RETURN( -1 );
  }
  Graph graph1{ N , Get( e1 ) };
  DepthFirstSearchOnWeightedTree dfswt{ graph1 , MaxSemilattice{ 0 } , 0 , 17 };
  int answer = 0;
  FOR( j , 0 , M ){
    if( answer < p[j] ){
      auto& [uj,vj] = E[j];
      auto [k,w_uj,w_vj] = dfswt.WLCA( uj , vj );
      if( sum + W[j] - max( w_uj , w_vj ) <= C ){
	answer = p[j];
      }
    }
  }
  COUT( answer );
}
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 <TY U,TY GROUP>CL AbstractUnionFindForest{PU:GROUP m_M;int m_node_SZ;int m_root_SZ;VE<int> m_pred;VE<int> m_height;VE<U> m_w;IN AbstractUnionFindForest(CRI SZ,GROUP M);CRI RootOfNode(CRI num);TE <TE <TY...> TY V> VO SetRoot(V<int>& a)CO;IN U Potential(CRI num0,CRI num1);IN CRI SZ(CO bool& node = true)CO NE;bool Graft(CRI num0,CRI num1,CO U& w = 0);};TE <TY GROUP> AbstractUnionFindForest(CRI SZ,GROUP M)-> AbstractUnionFindForest<inner_t<GROUP>,GROUP>;TE <TY U = int>CL UnionFindForest:PU AbstractUnionFindForest<U,AdditiveGroup<U>>{PU:IN UnionFindForest(CRI SZ);};
TE <TY U,TY GROUP> IN AbstractUnionFindForest<U,GROUP>::AbstractUnionFindForest(CRI SZ,GROUP M):m_M(MO(M)),m_node_SZ(SZ),m_root_SZ(m_node_SZ),m_pred(m_node_SZ),m_height(m_node_SZ,1),m_w(m_node_SZ,m_M.Zero()){for(int i = 0;i < m_node_SZ;i++){m_pred[i]= i;}}TE <TY U> IN UnionFindForest<U>::UnionFindForest(CRI SZ):AbstractUnionFindForest<U,AdditiveGroup<U>>(SZ,AdditiveGroup<U>()){}TE <TY U,TY GROUP>CRI AbstractUnionFindForest<U,GROUP>::RootOfNode(CRI num){int& pred1 = m_pred[num];WH(true){int& pred2 = m_pred[pred1];if(pred1 == pred2){break;}m_w[num]= m_M.Sum(m_w[num],m_w[pred1]= m_M.Sum(m_w[pred1],m_w[pred2]));pred1 = pred2 = m_pred[pred2];}RE pred1;}TE <TY U,TY GROUP> TE <TE <TY...> TY V>VO AbstractUnionFindForest<U,GROUP>::SetRoot(V<int>& a)CO{a.clear();for(int i = 0;i < m_node_SZ;i++){if(i == m_pred[i]){a.push_back(i);}}RE;}TE <TY U,TY GROUP>U AbstractUnionFindForest<U,GROUP>::Potential(CRI num0,CRI num1){AS(num0 < m_node_SZ && num1 < m_node_SZ);CRI root0 = RootOfNode(num0);CRI root1 = RootOfNode(num1);AS(root0 == root1);RE m_M.Sum(m_w[num0],m_M.Inverse(m_w[num1]));}TE <TY U,TY GROUP> IN CRI AbstractUnionFindForest<U,GROUP>::SZ(CO bool& node)CO NE{RE node?m_node_SZ:m_root_SZ;}TE <TY U,TY GROUP>bool AbstractUnionFindForest<U,GROUP>::Graft(CRI num0,CRI num1,CO U& w){AS(num0 < m_node_SZ && num1 < m_node_SZ);CRI root0 = RootOfNode(num0);CRI root1 = RootOfNode(num1);if(root0 == root1){RE Potential(num0,num1)== w;}int& height0 = m_height[root0];CRI height1 = m_height[root1];CO int* p_reMOd_root;CO int* p_reMOd_node;CO int* p_kept_root;if(height0 < height1){p_reMOd_root = &root0;p_reMOd_node = &num0;p_kept_root = &root1;m_w[*p_reMOd_root]= m_M.Sum(m_w[*p_reMOd_root],m_M.Sum(m_M.Sum(m_w[num1],w),m_M.Inverse(m_w[num0])));}else{if(height0 == height1){height0++;}p_reMOd_root = &root1;p_reMOd_node = &num1;p_kept_root = &root0;m_w[*p_reMOd_root]= m_M.Sum(m_w[*p_reMOd_root],m_M.Sum(m_M.Inverse(m_M.Sum(m_w[num1],w)),m_w[num0]));}if(*p_reMOd_node != *p_reMOd_root){m_w[*p_reMOd_node]= m_M.Sum(m_w[*p_reMOd_node],m_w[*p_reMOd_root]);}m_pred[*p_reMOd_node]= m_pred[*p_reMOd_root]= *p_kept_root;m_root_SZ--;RE true;}

// GRAPHは有向グラフG=(V_G,E_G)に相当する型。
// ただし辺Eは写像T -> ( T \times U \times int \times ... )^{< \omega}に相当し、
// その値の第3成分は辺番号を表す。

// 入力の範囲内で要件
// (1) Uはbool operator<(const U&,const U&)に関して全順序である。
// (2) EはE_Gの番号付けである。
// を満たす場合にのみサポート。

// O(|E_G|(α(|V_G| + log_2 |E_G|)))でGの無向化の、answerに対応する辺集合を含む全域森のうち
// 重み（の<に関して全順序モノイドをなす可換モノイド構造に関する総和）が最小な全域森の
// {辺番号の配列,連結成分の個数}を返す。
// そのような全域森が存在しない（answerが閉路を含む）場合は{answer,-1}を返す。
template <typename GRAPH> inline pair<vector<int>,int> Kruscal( GRAPH& G , const vector<pair<int,int>>& E , vector<int> answer = {} );

// OnはE_Gの{0,1}彩色on:int（辺番号）-> {0,1}に相当する型。

// 入力の範囲内で要件
// (1) E_sortedはE_GをUの順序に関してソートしたものである。
// を満たす場合にのみサポート。

// O(|E_G| α(|V_G|))でonで1に色付けされるGの辺のみからなる部分グラフの無向化の、
// answerに対応する辺集合を含む全域森のうち重み（の<に関して全順序モノイドをなす
// 可換モノイド構造に関する総和）が最小な全域森の{辺番号の配列,連結成分の個数}を返す。
// そのような全域森が存在しない（answerが閉路を含むか0に色付けされる辺を含む）場合は
// {answer,-1}を返す。
template <typename On> pair<vector<int>,int> Kruscal( const int& V , const vector<pair<int,int>>& E , const list<tuple<int,int,int>>& E_sorted , const On& on , vector<int> answer = {} );

template <typename GRAPH>
list<tuple<int,int,int>> SortedEdge( GRAPH& G , const vector<pair<int,int>>& E )
{

  using PATH = decldecay_t( declval<GRAPH>().edge()(0).back() );
  using T = inner_t<GRAPH>;
  using U = decldecay_t( get<1>( declval<PATH>() ) );
  static_assert( is_same_v<T,decldecay_t( get<0>( declval<PATH>() ) )> && is_same_v<int,decldecay_t( get<2>( declval<PATH>() ) )> );
  const int& V = G.size();
  list<pair<U,int>> weight{};

  for( int i = 0 ; i < V ; i++ ){

    auto&& t = G.Enumeration( i );
    auto&& edge_i = G.Edge( t );

    for( auto& edge_ij : edge_i ){

      weight.push_back( { get<1>( edge_ij ) , get<2>( edge_ij ) } );

    }

  }

  weight.sort();
  list<tuple<int,int,int>> E_sorted{};

  for( auto& weight_n : weight ){

    int& n = weight_n.second;
    auto& [i,j] = E[n];
    E_sorted.push_back( { i , j , n } );

  }

  return E_sorted;

}

template <typename On>
pair<vector<int>,int> Kruscal( const int& V , const vector<pair<int,int>>& E , const list<tuple<int,int,int>>& E_sorted ,const On& on , vector<int> answer )
{
  
  static_assert( is_invocable_r_v<bool,On,int> );
  UnionFindForest<> uff{ V };

  for( auto& n : answer ){

    auto& [i,j] = E[n];
    
    if( ! on( n ) || uff.RootOfNode( i ) == uff.RootOfNode( j ) ){

      return { {} , -1 };

    } else {
      
      uff.Graft( i , j );

    }
    
  }
  
  answer.reserve( V - 1 );

  for( auto& [i,j,n] : E_sorted ){

    if( on( n ) ){

      if( uff.RootOfNode( i ) != uff.RootOfNode( j ) ){

	uff.Graft( i , j );
	answer.push_back( n );

      }

    }

  }

  return { move( answer ) , int( uff.size( false ) ) };  

}

template <typename GRAPH> inline pair<vector<int>,int> Kruscal( GRAPH& G , const vector<pair<int,int>>& E , vector<int> answer ) { return Kruscal( G.size() , E , SortedEdge( G , E ) , [&]( const int& ) { return true; } , answer ); }

TE <TY T,TY GRAPH>CL VirtualBreadthFirstSearch{PU:GRAPH& m_G;T m_not_found;bool m_initialised;LI<T> m_next;VE<bool> m_found;VE<T> m_prev;IN VirtualBreadthFirstSearch(GRAPH& G,CO T& not_found);TE <TY Arg> IN VirtualBreadthFirstSearch(GRAPH& G,CO T& not_found,Arg&& init);IN VO Initialise();IN VO Initialise(CO T& init);IN VO Initialise(LI<T> inits);IN VO Shift(CO T& init);IN VO Shift(LI<T> inits);IN CRI SZ()CO NE;IN VE<bool>::reference found(CO T& t);IN CO T& prev(CO T& t);IN T Next();VE<int> GetDistance();VO SetConnectedComponent(VE<int>& cc_num,int& count);VI VO Push(LI<T>& next,CO T& t)= 0;TE <TY PATH> IN VO Push(LI<T>& next,CO PATH& p);};
TE <TY T,TY GRAPH> IN VirtualBreadthFirstSearch<T,GRAPH>::VirtualBreadthFirstSearch(GRAPH& G,CO T& not_found):m_G(G),m_not_found(not_found),m_initialised(false),m_next(),m_found(),m_prev(){}TE <TY T,TY GRAPH> TE <TY Arg> IN VirtualBreadthFirstSearch<T,GRAPH>::VirtualBreadthFirstSearch(GRAPH& G,CO T& not_found,Arg&& init):VirtualBreadthFirstSearch<T,GRAPH>(G,not_found){Initialise(forward<Arg>(init));}TE <TY T,TY GRAPH> IN VO VirtualBreadthFirstSearch<T,GRAPH>::Initialise(){m_initialised = true;CRI V = SZ();m_next.clear();m_found = VE<bool>(V);m_prev = VE<T>(V,m_not_found);}TE <TY T,TY GRAPH> IN VO VirtualBreadthFirstSearch<T,GRAPH>::Initialise(CO T& init){auto&& i = m_G.Enumeration_inv(init);AS(0 <= i && i < SZ());Initialise();m_next.push_back(init);m_found[i]= true;}TE <TY T,TY GRAPH> IN VO VirtualBreadthFirstSearch<T,GRAPH>::Initialise(LI<T> inits){Initialise();m_next = MO(inits);CRI V = SZ();for(auto IT = m_next.BE(),EN = m_next.EN();IT != EN;IT++){auto&& i = m_G.Enumeration_inv(*IT);AS(0 <= i && i < V);m_found[i]= true;}}TE <TY T,TY GRAPH> IN VO VirtualBreadthFirstSearch<T,GRAPH>::Shift(CO T& init){if(m_initialised){CRI V = SZ();auto&& i = m_G.Enumeration_inv(init);AS(0 <= i && i < V);m_next.clear();if(! m_found[i]){m_next.push_back(init);m_found[i]= true;}}else{Initialise(init);}}TE <TY T,TY GRAPH> IN VO VirtualBreadthFirstSearch<T,GRAPH>::Shift(LI<T> inits){if(m_initialised){m_next.clear();CRI V = SZ();for(auto IT = m_next.BE(),EN = m_next.EN();IT != EN;IT++){auto&& i = m_G.Enumeration_inv(*IT);AS(0 <= i && i < V);if(! m_found[i]){m_next.push_back(*IT);m_found[i]= true;}}}else{Initialise(MO(inits));}}TE <TY T,TY GRAPH> IN CRI VirtualBreadthFirstSearch<T,GRAPH>::SZ()CO NE{RE m_G.SZ();}TE <TY T,TY GRAPH> IN VE<bool>::reference VirtualBreadthFirstSearch<T,GRAPH>::found(CO T& t){auto&& i = m_G.Enumeration_inv(t);AS(0 <= i && i < SZ());if(!m_initialised){Initialise();}RE m_found[i];}TE <TY T,TY GRAPH> IN CO T& VirtualBreadthFirstSearch<T,GRAPH>::prev(CO T& t){auto&& i = m_G.Enumeration_inv(t);AS(0 <= i && i < SZ());if(!m_initialised){Initialise();}RE m_prev[i];}TE <TY T,TY GRAPH> IN T VirtualBreadthFirstSearch<T,GRAPH>::Next(){if(m_next.empty()){RE m_not_found;}CO T t_curr = m_next.front();m_next.pop_front();auto&& edge = m_G.Edge(t_curr);for(auto& t:edge){auto&& i = m_G.Enumeration_inv(t);auto&& found_i = m_found[i];if(! found_i){Push(m_next,t);m_prev[i]= t_curr;found_i = true;}}RE t_curr;}TE <TY T,TY GRAPH>VE<int> VirtualBreadthFirstSearch<T,GRAPH>::GetDistance(){ST_AS(is_same_v<T,int> && is_same_v<GRAPH,Graph<decldecay_t(m_G.edge())>>);VE<int> depth{};depth = VE<int>(SZ(),-1);for(auto IT = m_next.BE(),EN = m_next.EN();IT != EN;IT++){depth[*IT]= 0;}int i;WH((i = Next())!= m_not_found){int& depth_i = depth[i];depth_i == -1?depth_i = depth[prev(i)]+ 1:depth_i;}RE depth;}TE <TY T,TY GRAPH>VO VirtualBreadthFirstSearch<T,GRAPH>::SetConnectedComponent(VE<int>& cc_num,int& count){ST_AS(is_same_v<T,int> && is_same_v<GRAPH,Graph<decldecay_t(m_G.edge())>>);CRI V = SZ();cc_num = VE<int>(V,-1);count = 0;for(int i = 0;i < V;i++){if(cc_num[i]== -1){Shift(i);int j = Next();if(j != m_not_found){WH(j != m_not_found){AS(cc_num[j]== -1);cc_num[j]= count;j = Next();}count++;}}}RE;}TE <TY T,TY GRAPH> TE <TY PATH> IN VO VirtualBreadthFirstSearch<T,GRAPH>::Push(LI<T>& next,CO PATH& p){Push(next,get<0>(p));}

TE <TY T,TY GRAPH>CL DepthFirstSearch:PU VirtualBreadthFirstSearch<T,GRAPH>{PU:TE <TY...Args> IN DepthFirstSearch(GRAPH& G,CO T& not_found,Args&&... args);IN VO Push(LI<T>& next,CO T& t);};
TE <TY T,TY GRAPH> TE <TY...Args> IN DepthFirstSearch<T,GRAPH>::DepthFirstSearch(GRAPH& G,CO T& not_found,Args&&... args):VirtualBreadthFirstSearch<T,GRAPH>(G,not_found,forward<Args>(args)...){}TE <TY T,TY GRAPH> IN VO DepthFirstSearch<T,GRAPH>::Push(LI<T>& next,CO T& t){next.push_front(t);}

TE <TY TREE>CL DepthFirstSearchOnTree:PU DepthFirstSearch<int,TREE>{PU:VE<int> m_node_num;VE<VE<int>> m_children;VE<int> m_children_num;bool m_set_children;VE<int> m_depth;bool m_set_depth;VE<int> m_height_max;VE<int> m_height_min;bool m_set_height;VE<int> m_heaviness;bool m_set_heaviness;int m_digit;VE<VE<int>> m_doubling;bool m_set_doubling;IN DepthFirstSearchOnTree(TREE& T,CRI root = 0,CRI digit = 0);IN VO Initialise()= delete;IN VO Initialise(CRI init)= delete;IN VO Shift(CRI init)= delete;IN CRI Root()CO;IN CRI Parent(CRI i);IN CO VE<int>& Children(CRI i);IN CRI Depth(CRI i);IN CRI Height(CRI i,CO bool& maximum = true);IN CRI Heaviness(CRI i);IN CRI NodeNumber(CRI i,CO bool& reversed = false)CO;IN CRI ChildrenNumber(CRI i);int Ancestor(int i,int n);IN int LCA(int i,int j);int LCA(int i,int j,int& i_prev,int& j_prev);TE <TY F> ret_t<F> RootingDP(F& f);TE <TY U,TY COMM_MONOID,TY F,TY G> VO RerootingDP(COMM_MONOID M,F& f,G& g,VE<U>& d);VO SetChildren();VO SetDepth();VO SetHeight();VO SetHeaviness();VO SetDoubling();};
TE <TY TREE> IN DepthFirstSearchOnTree<TREE>::DepthFirstSearchOnTree(TREE& T,CRI root,CRI digit):DepthFirstSearch<int,TREE>(T,-1,root),m_node_num(TH->SZ()),m_children(),m_set_children(),m_depth(),m_set_depth(),m_height_max(),m_height_min(),m_set_height(),m_heaviness(),m_set_heaviness(),m_digit(digit),m_doubling(m_digit),m_set_doubling(){ST_AS(is_same_v<TREE,Graph<decldecay_t(declval<TREE>().edge())>>);CRI V = TH->SZ();for(int n = 0;n < V;n++){AS((m_node_num[n]= TH->Next())!= -1);}AS(TH->Next()== -1);}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::Root()CO{RE TH->Point();}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::Parent(CRI i){RE TH->prev(i);}TE <TY TREE> IN CO VE<int>& DepthFirstSearchOnTree<TREE>::Children(CRI i){if(! m_set_children){SetChildren();}RE m_children[i];}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::Depth(CRI i){if(!m_set_depth){SetDepth();}RE m_depth[i];}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::Height(CRI i,CO bool& maximum){if(!m_set_height){SetHeight();}RE(maximum?m_height_max:m_height_min)[i];}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::Heaviness(CRI i){if(!m_set_heaviness){SetHeaviness();}RE m_heaviness[i];}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::NodeNumber(CRI i,CO bool& reversed)CO{CRI V = TH->SZ();AS(i < V);RE m_node_num[reversed?V - 1 - i:i];}TE <TY TREE> IN CRI DepthFirstSearchOnTree<TREE>::ChildrenNumber(CRI i){if(! m_set_children){SetChildren();}RE m_children_num[i];}TE <TY TREE>int DepthFirstSearchOnTree<TREE>::Ancestor(int i,int n){if(!m_set_doubling){SetDoubling();}AS((n >> m_digit)== 0);int d = 0;WH(n != 0){AS((n & 1)== 1?(i = m_doubling[d][i])!= -1:true);d++;n >>= 1;}RE i;}TE <TY TREE> IN int DepthFirstSearchOnTree<TREE>::LCA(int i,int j){int i_prev;int j_prev;RE LCA(i,j,i_prev,j_prev);}TE <TY TREE>int DepthFirstSearchOnTree<TREE>::LCA(int i,int j,int& i_prev,int& j_prev){i_prev = j_prev = -1;CO int diff = Depth(i)- Depth(j);AS(diff > 0?(i = Parent(i_prev = Ancestor(i,diff - 1)))!= -1:diff < 0?(j = Parent(j_prev = Ancestor(j,- diff - 1)))!= -1:true);if(i != j){if(!m_set_doubling){SetDoubling();}int d = m_digit;WH(--d >= 0){AS(m_doubling[d][i]!= m_doubling[d][j]?(i = m_doubling[d][i])!= -1 &&(j = m_doubling[d][j])!= -1:true);}AS((i = Parent(i_prev = i))==(j = Parent(j_prev = j)));}RE i;}TE <TY TREE>VO DepthFirstSearchOnTree<TREE>::SetChildren(){AS(!m_set_children);m_set_children = true;CRI V = TH->SZ();m_children.reSZ(V);m_children_num.reSZ(V);for(int i = 0;i < V;i++){CRI j = Parent(i);if(j == -1){m_children_num[i]= -1;}else{m_children_num[i]= m_children[j].SZ();m_children[j].push_back(i);}}RE;}TE <TY TREE>VO DepthFirstSearchOnTree<TREE>::SetDepth(){AS(!m_set_depth);m_set_depth = true;CRI V = TH->SZ();m_depth.reSZ(V);for(int n = 1;n < V;n++){CRI i = m_node_num[n];CRI j = Parent(i);AS(j != -1);m_depth[i]+= m_depth[j]+ 1;}RE;}TE <TY TREE>VO DepthFirstSearchOnTree<TREE>::SetHeight(){AS(!m_set_height);m_set_height = true;CRI V = TH->SZ();m_height_max.reSZ(V);m_height_min.reSZ(V);for(int n = V - 1;n > 0;n--){CRI i = m_node_num[n];CRI j = Parent(i);AS(j != -1);m_height_max[j]= max(m_height_max[j],m_height_max[i]+ 1);m_height_min[j]= m_height_min[j]== 0?m_height_min[i]+ 1:min(m_height_min[j],m_height_min[i]+ 1);}RE;}TE <TY TREE>VO DepthFirstSearchOnTree<TREE>::SetHeaviness(){AS(!m_set_heaviness);m_set_heaviness = true;CRI V = TH->SZ();m_heaviness.reSZ(V);for(int n = V - 1;n > 0;n--){CRI i = m_node_num[n];CRI j = Parent(i);AS(j != -1);m_heaviness[j]+= m_heaviness[i]+ 1;}RE;}TE <TY TREE>VO DepthFirstSearchOnTree<TREE>::SetDoubling(){AS(!m_set_doubling);m_set_doubling = true;CRI V = TH->SZ();{m_doubling[0].reserve(V);for(int i = 0;i < V;i++){m_doubling[0].push_back(Parent(i));}}for(int d = 1;d < m_digit;d++){m_doubling[d].reserve(V);for(int i = 0;i < V;i++){m_doubling[d].push_back(m_doubling[d-1][i]== -1?-1:m_doubling[d-1][m_doubling[d-1][i]]);}}RE;}TE <TY TREE> TE <TY F>ret_t<F> DepthFirstSearchOnTree<TREE>::RootingDP(F& f){US U = ret_t<F>;ST_AS(is_invocable_r_v<U,F,LI<U>,int>);if(! m_set_children){SetChildren();}CRI V = TH->SZ();VE<LI<U>> children_value(V);U temp;for(int n = 0;n < V;n++){CRI i = NodeNumber(n,true);CRI j = Parent(i);temp = f(children_value[i],i);if(j != -1){children_value[j].push_back(temp);}}RE temp;}TE <TY TREE> TE <TY U,TY COMM_MONOID,TY F,TY G>VO DepthFirstSearchOnTree<TREE>::RerootingDP(COMM_MONOID M,F& f,G& g,VE<U>& d){ST_AS(is_same_v<U,inner_t<COMM_MONOID>> && is_invocable_r_v<U,F,U,int> && is_invocable_r_v<U,G,U,bool,int,int>);if(! m_set_children){SetChildren();}CRI V = TH->SZ();CO U& e = M.Unit();d.reSZ(V);VE<VE<U>> children_value(V);VE<VE<U>> l_sum(V);VE<VE<U>> r_sum(V);for(int i = 0;i < V;i++){children_value[i].reSZ(m_children[i].SZ());}for(int n = 0;n < V;n++){CRI i = NodeNumber(n,true);CO VE<U>& children_value_i = children_value[i];CO int SZ_i = children_value_i.SZ();U temp = e;l_sum[i].reserve(SZ_i + 1);l_sum[i].push_back(temp);for(int m = 0;m < SZ_i;m++){l_sum[i].push_back(temp = M.Product(temp,g(children_value_i[m],true,i,m_children[i][m])));}CRI j = Parent(i);if(j != -1){children_value[j][m_children_num[i]]= f(temp,i);}temp = e;r_sum[i].reSZ(SZ_i);for(int m = 1;m <= SZ_i;m++){r_sum[i][SZ_i - m]= temp;temp = M.Product(g(children_value_i[SZ_i - m],true,i,m_children[i][SZ_i - m]),temp);}}for(int n = 1;n < V;n++){CRI i = NodeNumber(n);CRI j = Parent(i);CRI k = ChildrenNumber(i);CO int SZ_i = r_sum[i].SZ();CO U rest_i = g(f(M.Product(l_sum[j][k],r_sum[j][k]),j),false,i,j);for(int m = 0;m <= SZ_i;m++){l_sum[i][m]= M.Product(rest_i,l_sum[i][m]);}}for(int i = 0;i < V;i++){d[i]= f(l_sum[i].back(),i);}RE;}

TE <TY TREE,TY U,TY MONOID>CL DepthFirstSearchOnWeightedTree:PU DepthFirstSearchOnTree<TREE>{PU:MONOID m_M;VE<U> m_wprev;VE<U> m_wdepth_r;VE<U> m_wdepth_l;bool m_set_wdepth;VE<U> m_wheight_max_r;VE<U> m_wheight_max_l;VE<U> m_wheight_min_r;VE<U> m_wheight_min_l;bool m_set_wheight;VE<U> m_wheaviness;bool m_set_wheaviness;VE<VE<tuple<int,U,U>>> m_wdoubling;bool m_set_wdoubling;IN DepthFirstSearchOnWeightedTree(TREE& T,MONOID M,CRI root = 0,CRI digit = 0);IN CO U& WDepth(CRI i,CO bool& right = true);IN CO U& WHeight(CRI i,CO bool& maximum = true,CO bool& right = true);IN CO U& WHeaviness(CRI i);pair<int,U> WAncestor(int i,int n,CO bool& right = true);tuple<int,U,U> WLCA(int i,int j);tuple<int,U,U> WLCA(int i,int j,int& i_prev,int& j_prev);VO SetWDepth();VO SetWHeight();VO SetWHeaviness();VO SetWDoubling();};TE <TY TREE,TY MONOID,TY...Args> DepthFirstSearchOnWeightedTree(TREE& T,MONOID M,CO Args&... args)-> DepthFirstSearchOnWeightedTree<TREE,inner_t<MONOID>,MONOID>;
TE <TY TREE,TY U,TY MONOID> IN DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::DepthFirstSearchOnWeightedTree(TREE& T,MONOID M,CRI root,CRI digit):DepthFirstSearchOnTree<TREE>(T,root,digit),m_M(MO(M)),m_wprev(TH->SZ(),m_M.One()),m_wdepth_r(),m_wdepth_l(),m_set_wdepth(),m_wheight_max_r(),m_wheight_max_l(),m_wheight_min_r(),m_wheight_min_l(),m_set_wheight(),m_wheaviness(),m_set_wheaviness(),m_wdoubling(TH->m_digit),m_set_wdoubling(){ST_AS(is_same_v<U,inner_t<MONOID>>);CRI V = TH->SZ();for(int i = 0;i < V;i++){auto&& edge_i = TH->m_G.Edge(i);for(auto& p:edge_i){CRI j = get<0>(p);if(i == TH->Parent(j)){m_wprev[j]= get<1>(p);}}}}TE <TY TREE,TY U,TY MONOID> IN CO U& DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::WDepth(CRI i,CO bool& right){AS(i < TH->SZ());if(!m_set_wdepth){SetWDepth();}RE(right?m_wdepth_r:m_wdepth_l)[i];}TE <TY TREE,TY U,TY MONOID> IN CO U& DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::WHeight(CRI i,CO bool& maximum,CO bool& right){AS(i < TH->SZ());if(!m_set_wheight){SetWHeight();}RE(maximum?(right?m_wheight_max_r:m_wheight_max_l):(right?m_wheight_min_r:m_wheight_min_l))[i];}TE <TY TREE,TY U,TY MONOID> IN CO U& DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::WHeaviness(CRI i){AS(i < TH->SZ());if(!m_set_wheaviness){SetWHeaviness();}RE m_wheaviness[i];}TE <TY TREE,TY U,TY MONOID>pair<int,U> DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::WAncestor(int i,int n,CO bool& right){if(! m_set_wdoubling){SetWDoubling();}AS((n >> TH->m_digit)== 0);int d = 0;U temp = m_M.One();WH(n != 0){if((n & 1)== 1){auto&[j,u_r,u_l]= m_wdoubling[d][i];AS((i = j)!= -1);temp = right?m_M.Product(temp,u_r):m_M.Product(u_l,temp);}d++;n >>= 1;}RE{i,MO(temp)};}TE <TY TREE,TY U,TY MONOID> IN tuple<int,U,U> DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::WLCA(int i,int j){int i_prev;int j_prev;RE WLCA(i,j,i_prev,j_prev);}TE <TY TREE,TY U,TY MONOID>tuple<int,U,U> DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::WLCA(int i,int j,int& i_prev,int& j_prev){i_prev = j_prev = -1;CO int diff = TH->Depth(i)- TH->Depth(j);U u_ir = m_M.One();U u_jl = u_ir;if(diff > 0){auto[k,v]= WAncestor(i,diff - 1,true);AS((i = TH->Parent(i_prev = k))!= -1);u_ir = MO(v);}else if(diff < 0){auto[k,v]= WAncestor(j,- diff - 1,false);AS((j = TH->Parent(j_prev = k))!= -1);u_jl = MO(v);}if(i != j){if(!m_set_wdoubling){SetWDoubling();}int d = TH->m_digit;WH(--d >= 0){auto&[k_i,v_ir,v_il]= m_wdoubling[d][i];auto&[k_j,v_jr,v_jl]= m_wdoubling[d][j];if(k_i != k_j){AS((i = k_i)!= -1 &&(j = k_j)!= -1);u_ir = m_M.Product(u_ir,v_ir);u_jl = m_M.Product(v_jl,u_jl);}}u_ir = m_M.Product(u_ir,m_wprev[i]);u_jl = m_M.Product(m_wprev[j],u_jl);AS((i = TH->Parent(i_prev = i))==(j = TH->Parent(j_prev = j)));}RE{i,MO(u_ir),MO(u_jl)};}TE <TY TREE,TY U,TY MONOID>VO DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::SetWDepth(){AS(!m_set_wdepth);m_set_wdepth = true;CRI V = TH->SZ();CO U& one = m_M.One();m_wdepth_r.reSZ(V,one);m_wdepth_l.reSZ(V,one);for(int n = 1;n < V;n++){CRI i = TH->m_node_num[n];CRI j = TH->Parent(i);AS(j != -1);m_wdepth_r[i]= m_M.Product(m_wdepth_r[j],m_wprev[i]);m_wdepth_l[i]= m_M.Product(m_wprev[i],m_wdepth_l[j]);}RE;}TE <TY TREE,TY U,TY MONOID>VO DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::SetWHeight(){AS(!m_set_wheight);m_set_wheight = true;CRI V = TH->SZ();CO U& one = m_M.One();m_wheight_max_r.reSZ(V,one);m_wheight_max_l.reSZ(V,one);m_wheight_min_r.reSZ(V,one);m_wheight_min_l.reSZ(V,one);VE<bool> found(V);for(int n = V - 1;n > 0;n--){CRI i = TH->m_node_num[n];CRI j = TH->Parent(i);AS(j != -1);m_wheight_max_r[j]= max(m_wheight_max_r[j],m_M.Product(m_wheight_max_r[i],m_wprev[i]));m_wheight_max_l[j]= max(m_wheight_max_l[j],m_M.Product(m_wprev[i],m_wheight_max_l[i]));if(found[j]){m_wheight_min_r[j]= min(m_wheight_min_r[j],m_M.Product(m_wheight_min_r[i],m_wprev[i]));m_wheight_min_l[j]= min(m_wheight_min_l[j],m_M.Product(m_wprev[i],m_wheight_min_l[i]));}else{m_wheight_min_r[j]= m_M.Product(m_wheight_min_r[i],m_wprev[i]);m_wheight_min_l[j]= m_M.Product(m_wprev[i],m_wheight_min_l[i]);found[j]= true;}}RE;}TE <TY TREE,TY U,TY MONOID>VO DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::SetWHeaviness(){AS(!m_set_wheaviness);m_set_wheaviness = true;CRI V = TH->SZ();m_wheaviness.reSZ(V,m_M.One());for(int n = V - 1;n > 0;n--){CRI i = TH->m_node_num[n];CRI j = TH->Parent(i);AS(j != -1);m_wheaviness[j]= m_M.Product(m_wheaviness[j],m_M.Product(m_wheaviness[i],m_wprev[i]));}RE;}TE <TY TREE,TY U,TY MONOID>VO DepthFirstSearchOnWeightedTree<TREE,U,MONOID>::SetWDoubling(){AS(!m_set_wdoubling);m_set_wdoubling = true;CRI V = TH->SZ();{m_wdoubling[0].reserve(V);for(int i = 0;i < V;i++){m_wdoubling[0].push_back({TH->Parent(i),m_wprev[i],m_wprev[i]});}}for(int d = 1;d < TH->m_digit;d++){m_wdoubling[d].reserve(V);for(int i = 0;i < V;i++){auto[j,u_ir,u_il]= m_wdoubling[d-1][i];if(j != -1){auto&[k,v_jr,v_jl]= m_wdoubling[d-1][j];j = k;u_ir = m_M.Product(u_ir,v_jr);u_il = m_M.Product(v_jl,u_il);}m_wdoubling[d].push_back({j,u_ir,u_il});}}RE;}

TE <TY U>CL VirtualMeetSemilattice:VI PU VirtualMonoid<U>{PU:IN U Meet(CO U& u0,CO U& u1);};TE <TY U>CL MinSemilattice:VI PU VirtualMeetSemilattice<U>,PU PointedSet<U>{PU:IN MinSemilattice(CO U& infty_U);IN U Product(CO U& u0,CO U& u1);};TE <TY U>CL MaxSemilattice:VI PU VirtualMeetSemilattice<U>,PU PointedSet<U>{PU:IN MaxSemilattice(CO U& zero_U);IN U Product(CO U& u0,CO U& u1);};
TE <TY U> IN U VirtualMeetSemilattice<U>::Meet(CO U& u0,CO U& u1){RE TH->Product(u0,u1);}TE <TY U> IN MinSemilattice<U>::MinSemilattice(CO U& infty_U):PointedSet<U>(infty_U){}TE <TY U> IN MaxSemilattice<U>::MaxSemilattice(CO U& zero_U):PointedSet<U>(zero_U){}TE <TY U> IN U MinSemilattice<U>::Product(CO U& u0,CO U& u1){RE u0 < u1?u0:u1;}
TE <TY U> IN U MaxSemilattice<U>::Product(CO U& u0,CO U& u1){RE u1 < u0?u0:u1;}

// 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; }; CEXPR( int , bound_test_case_num , BOUND ); 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 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 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_SET_A , 0 , N ){ cin >> A[VARIABLE_FOR_SET_A]; }
  #define CIN_A( LL , A , N ) VE<LL> A( N ); SET_A( A , N );
#endif
#include <bits/stdc++.h>
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<double>( chrono::duration_cast<chrono::microseconds>( 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<decldecay_t( MAX )> 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<decltype( VAR )>
TE <TY F , TY...Args> US ret_t = decltype( declval<F>()( declval<Args>()... ) );
TE <TY T> 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 <TY INT> US T2 = pair<INT,INT>;
TE <TY INT> US T3 = tuple<INT,INT,INT>;
TE <TY INT> US T4 = tuple<INT,INT,INT,INT>;
US path = pair<int,ll>;

// 入出力用
TE <CL Traits> IN basic_istream<char,Traits>& VariadicCin( basic_istream<char,Traits>& is ) { RE is; }
TE <CL Traits , TY Arg , TY... ARGS> IN basic_istream<char,Traits>& VariadicCin( basic_istream<char,Traits>& is , Arg& arg , ARGS&... args ) { RE VariadicCin( is >> arg , args... ); }
TE <CL Traits> IN basic_istream<char,Traits>& VariadicGetline( basic_istream<char,Traits>& is , CO char& separator ) { RE is; }
TE <CL Traits , TY Arg , TY... ARGS> IN basic_istream<char,Traits>& VariadicGetline( basic_istream<char,Traits>& is , CO char& separator , Arg& arg , ARGS&... args ) { RE VariadicGetline( getline( is , arg , separator ) , separator , args... ); }
TE <CL Traits , TY Arg> IN basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , CO VE<Arg>& arg ) { auto BE = arg.BE() , EN = arg.EN(); auto itr = BE; WH( itr != EN ){ ( itr == BE ? os : os << " " ) << *itr; itr++; } RE os; }
TE <CL Traits , TY Arg1 , TY Arg2> IN basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , CO pair<Arg1,Arg2>& arg ) { RE os << arg.first << " " << arg.second; }
TE <CL Traits , TY Arg> IN basic_ostream<char,Traits>& VariadicCout( basic_ostream<char,Traits>& os , CO Arg& arg ) { RE os << arg; }
TE <CL Traits , TY Arg1 , TY Arg2 , TY... ARGS> IN basic_ostream<char,Traits>& VariadicCout( basic_ostream<char,Traits>& os , CO Arg1& arg1 , CO Arg2& arg2 , CO ARGS&... args ) { RE VariadicCout( os << arg1 << " " , arg2 , args... ); }

// 算術用
TE <TY T> CE T PositiveBaseResidue( CO T& a , CO T& p ){ RE a >= 0 ? a % p : p - 1 - ( ( - ( a + 1 ) ) % p ); }
TE <TY T> CE T Residue( CO T& a , CO T& p ){ RE PositiveBaseResidue( a , p < 0 ? -p : p ); }
TE <TY T> CE T PositiveBaseQuotient( CO T& a , CO T& p ){ RE ( a - PositiveBaseResidue( a , p ) ) / p; }
TE <TY T> 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<decldecay_t( ARGUMENT ),int>::value && ! is_same<decldecay_t( ARGUMENT ),uint>::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<decldecay_t( CO_TARGET ),uint>::value && ! is_same<decldecay_t( CO_TARGET ),ull>::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 <TY T> IN TY set<T>::iterator MaximumLeq( set<T>& 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 <TY T> IN TY set<T>::iterator MaximumLt( set<T>& 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 <TY T> IN TY set<T>::iterator MinimumGeq( set<T>& S , CO T& t ) { RE S.lower_bound( t ); }
// tより大きい値が存在すればその最小値のiterator、存在しなければend()を返す。
TE <TY T> IN TY set<T>::iterator MinimumGt( set<T>& S , CO T& t ) { RE S.upper_bound( t ); }

// 尺取り法用
// VAR_TPAがINITからUPDATEを繰り返しCONTINUE_CONDITIONを満たす限り、ON_CONDITIONを判定して
// trueならON、falseならOFFとなる。直近のONの区間を[VAR_TPA_L,VAR_TPA_R)で管理する。
#define TPA( VAR_TPA , INIT , UPDATE , CONTINUE_CONDITION , ON_CONDITION , ONON , ONOFF , OFFON , OFFOFF , FINISH ) \
  {									\
    auto VAR_TPA = INIT;						\
    auto VAR_TPA ## _L = VAR_TPA;					\
    auto VAR_TPA ## _R = VAR_TPA;					\
    bool on_TPA = false;						\
    int state_TPA = 3;							\
    WH( CONTINUE_CONDITION ){						\
      bool on_TPA_next = ON_CONDITION;					\
      state_TPA = ( ( on_TPA ? 1 : 0 ) << 1 ) | ( on_TPA_next ? 1 : 0 ); \
      CERR( "尺取り中： [L,R) = [" , VAR_TPA ## _L , "," , VAR_TPA ## _R , ") ," , #VAR_TPA , "=" , VAR_TPA , "," , ( ( state_TPA >> 1 ) & 1 ) == 1 ? "on" : "off" , " ->" , ( state_TPA & 1 ) == 1 ? "on" : "off" ); \
      if( state_TPA == 0 ){						\
	OFFOFF; VAR_TPA ## _L = VAR_TPA ## _R = VAR_TPA; UPDATE;	\
      } else if( state_TPA == 1 ){					\
	OFFON; VAR_TPA ## _L = VAR_TPA; UPDATE; VAR_TPA ## _R = VAR_TPA; \
      } else if( state_TPA == 2 ){					\
	ONOFF; VAR_TPA ## _L = VAR_TPA ## _R = VAR_TPA; UPDATE;		\
      } else {								\
	ONON; UPDATE; VAR_TPA ## _R = VAR_TPA;				\
      }									\
      on_TPA = on_TPA_next;						\
    }									\
    CERR( "尺取り終了： [L,R) = [" , VAR_TPA ## _L , "," , VAR_TPA ## _R , ") ," , #VAR_TPA , "=" , VAR_TPA ); \
    FINISH;								\
  }									\

// データ構造用
TE <TY T , TE <TY...> TY V> IN V<T> OP+( CO V<T>& a0 , CO V<T>& a1 ) { if( a0.empty() ){ RE a1; } if( a1.empty() ){ RE a0; } AS( a0.SZ() == a1.SZ() ); V<T> answer{}; for( auto itr0 = a0.BE() , itr1 = a1.BE() , EN0 = a0.EN(); itr0 != EN0 ; itr0++ , itr1++ ){ answer.push_back( *itr0 + *itr1 ); } RE answer; }
TE <TY T , TY U> IN pair<T,U> OP+( CO pair<T,U>& t0 , CO pair<T,U>& t1 ) { RE { t0.first + t1.first , t0.second + t1.second }; }
TE <TY T , TY U , TY V> IN tuple<T,U,V> OP+( CO tuple<T,U,V>& t0 , CO tuple<T,U,V>& t1 ) { RE { get<0>( t0 ) + get<0>( t1 ) , get<1>( t0 ) + get<1>( t1 ) , get<2>( t0 ) + get<2>( t1 ) }; }
TE <TY T , TY U , TY V , TY W> IN tuple<T,U,V,W> OP+( CO tuple<T,U,V,W>& t0 , CO tuple<T,U,V,W>& 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 <TY T> IN T Add( CO T& t0 , CO T& t1 ) { RE t0 + t1; }
TE <TY T> IN T XorAdd( CO T& t0 , CO T& t1 ){ RE t0 ^ t1; }
TE <TY T> IN T Multiply( CO T& t0 , CO T& t1 ) { RE t0 * t1; }
TE <TY T> IN CO T& Zero() { ST CO T z{}; RE z; }
TE <TY T> IN CO T& One() { ST CO T o = 1; RE o; }\
TE <TY T> IN T AddInv( CO T& t ) { RE -t; }
TE <TY T> IN T Id( CO T& v ) { RE v; }
TE <TY T> IN T Min( CO T& a , CO T& b ){ RE a < b ? a : b; }
TE <TY T> IN T Max( CO T& a , CO T& b ){ RE a < b ? b : a; }
TE <TY T , TE <TY...> TY V> IN auto Get( CO V<T>& a ) { return [&]( CRI i = 0 ){ RE a[i]; }; }

// グリッド問題用
int H , W , H_minus , W_minus , HW;
VE<VE<bool>> non_wall;
IN T2<int> EnumHW( CRI v ) { RE { v / W , v % W }; }
IN int EnumHW_inv( CO T2<int>& ij ) { auto& [i,j] = ij; RE i * W + j; }
CO string direction[4] = {"U","R","D","L"};
// (i,j)->(k,h)の方向番号を取得
IN int DirectionNumberOnGrid( CRI i , CRI j , CRI k , CRI h ){RE i<k?2:i>k?0:j<h?1:j>h?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<LI<int>>& 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+1<H){e[EnumHW_inv({i+1,j})].push_back(v);}if(j>0){e[EnumHW_inv({i,j-1})].push_back(v);}if(j+1<W){e[EnumHW_inv({i,j+1})].push_back(v);}}}}
IN VO SetEdgeOnGrid( CO string& Si , CRI i , VE<LI<path>>& 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+1<H){e[EnumHW_inv({i+1,j})].push_back({v,1});}if(j>0){e[EnumHW_inv({i,j-1})].push_back({v,1});}if(j+1<W){e[EnumHW_inv({i,j+1})].push_back({v,1});}}}}
IN VO SetWallOnGrid( CO string& Si , CRI i , VE<VE<bool>>& non_wall , CO char& walkable = '.'  , CO char& unwalkable = '#' ){non_wall.push_back(VE<bool>(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 <TY T> ST CE auto Check(CO T& t)-> decltype(t < t,true_type());ST CE false_type Check(...);TE <TY T> ST CE CO bool value = is_same_v< decltype(Check(declval<T>())),true_type >;};
TE <TY T , TY U>US Map = conditional_t<is_COructible_v<unordered_map<T,int>>,unordered_map<T,U>,conditional_t<is_ordered::value<T>,map<T,U>,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 <TY U> IN CO U& VirtualPointedSet<U>::POINT()CO NE{RE Point();}
#define DF_OF_POINT(POINT)TE <TY U> IN U& VirtualPointedSet<U>::POINT()NE{RE Point();}
TE <TY U>CL UnderlyingSet{PU:US type = U;};TE <TY U>CL VirtualPointedSet:VI PU UnderlyingSet<U>{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 <TY U>CL PointedSet:VI PU VirtualPointedSet<U>{PU:U m_b_U;IN PointedSet(CO U& b_u = U());IN CO U& Point()CO NE;IN U& Point()NE;};TE <TY U>CL VirtualNSet:VI PU UnderlyingSet<U>{PU:VI U Transfer(CO U& u)= 0;IN U Inverse(CO U& u);};TE <TY U,TY F_U>CL AbstractNSet:VI PU VirtualNSet<U>{PU:F_U m_f_U;IN AbstractNSet(F_U f_U);IN U Transfer(CO U& u);};TE <TY U>CL VirtualMagma:VI PU UnderlyingSet<U>{PU:VI U Product(CO U& u0,CO U& u1)= 0;IN U Sum(CO U& u0,CO U& u1);};TE <TY U = ll>CL AdditiveMagma:VI PU VirtualMagma<U>{PU:IN U Product(CO U& u0,CO U& u1);};TE <TY U = ll>CL MultiplicativeMagma:VI PU VirtualMagma<U>{PU:IN U Product(CO U& u0,CO U& u1);};TE <TY U,TY M_U>CL AbstractMagma:VI PU VirtualMagma<U>{PU:M_U m_m_U;IN AbstractMagma(M_U m_U);IN U Product(CO U& u0,CO U& u1);};
TE <TY U> IN PointedSet<U>::PointedSet(CO U& b_U):m_b_U(b_U){}TE <TY U> IN CO U& PointedSet<U>::Point()CO NE{RE m_b_U;}TE <TY U> IN U& PointedSet<U>::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 <TY U,TY F_U> IN AbstractNSet<U,F_U>::AbstractNSet(F_U f_U):m_f_U(MO(f_U)){ST_AS(is_invocable_r_v<U,F_U,U>);}TE <TY U,TY F_U> IN U AbstractNSet<U,F_U>::Transfer(CO U& u){RE m_f_U(u);}TE <TY U> IN U VirtualNSet<U>::Inverse(CO U& u){RE Transfer(u);}TE <TY U,TY M_U> IN AbstractMagma<U,M_U>::AbstractMagma(M_U m_U):m_m_U(MO(m_U)){ST_AS(is_invocable_r_v<U,M_U,U,U>);}TE <TY U> IN U AdditiveMagma<U>::Product(CO U& u0,CO U& u1){RE u0 + u1;}TE <TY U> IN U MultiplicativeMagma<U>::Product(CO U& u0,CO U& u1){RE u0 * u1;}TE <TY U,TY M_U> IN U AbstractMagma<U,M_U>::Product(CO U& u0,CO U& u1){RE m_m_U(u0,u1);}TE <TY U> IN U VirtualMagma<U>::Sum(CO U& u0,CO U& u1){RE Product(u0,u1);}

TE <TY U>CL VirtualMonoid:VI PU VirtualMagma<U>,VI PU VirtualPointedSet<U>{};TE <TY U = ll>CL AdditiveMonoid:VI PU VirtualMonoid<U>,PU AdditiveMagma<U>,PU PointedSet<U>{};TE <TY U = ll>CL MultiplicativeMonoid:VI PU VirtualMonoid<U>,PU MultiplicativeMagma<U>,PU PointedSet<U>{PU:IN MultiplicativeMonoid(CO U& e_U);};TE <TY U,TY M_U>CL AbstractMonoid:VI PU VirtualMonoid<U>,PU AbstractMagma<U,M_U>,PU PointedSet<U>{PU:IN AbstractMonoid(M_U m_U,CO U& e_U);};
TE <TY U> IN MultiplicativeMonoid<U>::MultiplicativeMonoid(CO U& e_U):PointedSet<U>(e_U){}TE <TY U,TY M_U> IN AbstractMonoid<U,M_U>::AbstractMonoid(M_U m_U,CO U& e_U):AbstractMagma<U,M_U>(MO(m_U)),PointedSet<U>(e_U){}

TE <TY U>CL VirtualGroup:VI PU VirtualMonoid<U>,VI PU VirtualPointedSet<U>,VI PU VirtualNSet<U>{};TE <TY U = ll>CL AdditiveGroup:VI PU VirtualGroup<U>,PU AdditiveMonoid<U>{PU:IN U Transfer(CO U& u);};TE <TY U,TY M_U,TY I_U>CL AbstractGroup:VI PU VirtualGroup<U>,PU AbstractMonoid<U,M_U>,PU AbstractNSet<U,I_U>{PU:IN AbstractGroup(M_U m_U,CO U& e_U,I_U i_U);};
TE <TY U,TY M_U,TY I_U> IN AbstractGroup<U,M_U,I_U>::AbstractGroup(M_U m_U,CO U& e_U,I_U i_U):AbstractMonoid<U,M_U>(MO(m_U),e_U),AbstractNSet<U,I_U>(MO(i_U)){}TE <TY U> IN U AdditiveGroup<U>::Transfer(CO U& u){RE -u;}

// Graph
// c:/Users/user/Documents/Programming/Mathematics/Geometry/Graph/compress.txt
TE <TY T,TY R1,TY R2,TY E>CL VirtualGraph:VI PU UnderlyingSet<T>{PU:VI R1 Enumeration(CRI i)= 0;IN R2 Enumeration_inv(CO T& t);TE <TY PATH> IN R2 Enumeration_inv(CO PATH& p);IN VO Reset();VI CRI SZ()CO NE = 0;VI E& edge()NE = 0;VI ret_t<E,T> Edge(CO T& t)= 0;VI IN R2 Enumeration_inv_Body(CO T& t)= 0;};TE <TY T,TY R1,TY R2,TY E>CL EdgeImplimentation:VI PU VirtualGraph<T,R1,R2,E>{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<E,T> Edge(CO T& t);};TE <TY E>CL Graph:PU EdgeImplimentation<int,CRI,CRI,E>{PU:IN Graph(CRI SZ,E edge);IN CRI Enumeration(CRI i);TE <TY F> IN Graph<F> GetGraph(F edge)CO;IN CRI Enumeration_inv_Body(CRI t);};TE <TY T,TY Enum_T,TY Enum_T_inv,TY E>CL EnumerationGraph:PU EdgeImplimentation<T,ret_t<Enum_T,int>,ret_t<Enum_T_inv,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<Enum_T,int> Enumeration(CRI i);TE <TY F> IN EnumerationGraph<T,Enum_T,Enum_T_inv,F> GetGraph(F edge)CO;IN ret_t<Enum_T_inv,T> Enumeration_inv_Body(CO T& t);};TE <TY Enum_T,TY Enum_T_inv,TY E> EnumerationGraph(CRI SZ,Enum_T enum_T,Enum_T_inv enum_T_inv,E edge)-> EnumerationGraph<decldecay_t(declval<Enum_T>()(0)),Enum_T,Enum_T_inv,E>;TE <TY T,TY E>CL MemorisationGraph:PU EdgeImplimentation<T,T,CRI,E>{PU:int m_LE;VE<T> m_memory;Map<T,int> m_memory_inv;IN MemorisationGraph(CRI SZ,E edge);IN T Enumeration(CRI i);IN VO Reset();TE <TY F> IN MemorisationGraph<T,F> GetGraph(F edge)CO;IN CRI Enumeration_inv_Body(CO T& t);};TE <TY E> MemorisationGraph(CRI SZ,E edge)-> MemorisationGraph<decldecay_t(declval<E>()().back()),E>;TE <TY E> MemorisationGraph(CRI SZ,E edge)-> MemorisationGraph<decldecay_t(get<0>(declval<E>()().back())),E>;
TE <TY T,TY R1,TY R2,TY E> IN EdgeImplimentation<T,R1,R2,E>::EdgeImplimentation(CRI SZ,E edge):m_SZ(SZ),m_edge(MO(edge)){ST_AS(is_COructible_v<T,R1> && is_COructible_v<int,R2> && is_invocable_v<E,T>);}TE <TY E> IN Graph<E>::Graph(CRI SZ,E edge):EdgeImplimentation<int,CRI,CRI,E>(SZ,MO(edge)){}TE <TY T,TY Enum_T,TY Enum_T_inv,TY E> IN EnumerationGraph<T,Enum_T,Enum_T_inv,E>::EnumerationGraph(CRI SZ,Enum_T enum_T,Enum_T_inv enum_T_inv,E edge):EdgeImplimentation<T,ret_t<Enum_T,int>,ret_t<Enum_T_inv,T>,E>(SZ,MO(edge)),m_enum_T(MO(enum_T)),m_enum_T_inv(MO(enum_T_inv)){}TE <TY T,TY E> IN MemorisationGraph<T,E>::MemorisationGraph(CRI SZ,E edge):EdgeImplimentation<T,T,CRI,E>(SZ,MO(edge)),m_LE(),m_memory(),m_memory_inv(){ST_AS(is_invocable_v<E> && is_invocable_v<E,T>);}TE <TY E> IN CRI Graph<E>::Enumeration(CRI i){RE i;}TE <TY T,TY Enum_T,TY Enum_T_inv,TY E> IN ret_t<Enum_T,int> EnumerationGraph<T,Enum_T,Enum_T_inv,E>::Enumeration(CRI i){RE m_enum_T(i);}TE <TY T,TY E> IN T MemorisationGraph<T,E>::Enumeration(CRI i){AS(0 <= i && i < m_LE);RE m_memory[i];}TE <TY T,TY R1,TY R2,TY E> IN R2 VirtualGraph<T,R1,R2,E>::Enumeration_inv(CO T& t){RE Enumeration_inv_Body(t);}TE <TY T,TY R1,TY R2,TY E> TE <TY PATH> IN R2 VirtualGraph<T,R1,R2,E>::Enumeration_inv(CO PATH& p){RE Enumeration_inv_Body(get<0>(p));}TE <TY E> IN CRI Graph<E>::Enumeration_inv_Body(CRI i){RE i;}TE <TY T,TY Enum_T,TY Enum_T_inv,TY E> IN ret_t<Enum_T_inv,T> EnumerationGraph<T,Enum_T,Enum_T_inv,E>::Enumeration_inv_Body(CO T& t){RE m_enum_T_inv(t);}TE <TY T,TY E> IN CRI MemorisationGraph<T,E>::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 <TY T,TY R1,TY R2,TY E> VO VirtualGraph<T,R1,R2,E>::Reset(){}TE <TY T,TY E> IN VO MemorisationGraph<T,E>::Reset(){m_LE = 0;m_memory.clear();m_memory_inv.clear();}TE <TY T,TY R1,TY R2,TY E> IN CRI EdgeImplimentation<T,R1,R2,E>::SZ()CO NE{RE m_SZ;}TE <TY T,TY R1,TY R2,TY E> IN E& EdgeImplimentation<T,R1,R2,E>::edge()NE{RE m_edge;}TE <TY T,TY R1,TY R2,TY E> IN ret_t<E,T> EdgeImplimentation<T,R1,R2,E>::Edge(CO T& t){RE m_edge(t);}TE <TY E> TE <TY F> IN Graph<F> Graph<E>::GetGraph(F edge)CO{RE Graph<F>(TH->SZ(),MO(edge));}TE <TY T,TY Enum_T,TY Enum_T_inv,TY E> TE <TY F> IN EnumerationGraph<T,Enum_T,Enum_T_inv,F> EnumerationGraph<T,Enum_T,Enum_T_inv,E>::GetGraph(F edge)CO{RE EnumerationGraph(TH->SZ(),m_enum_T,m_enum_T_inv,MO(edge));}TE <TY T,TY E> TE <TY F> IN MemorisationGraph<T,F> MemorisationGraph<T,E>::GetGraph(F edge)CO{RE MemorisationGraph(TH->SZ(),MO(edge));}
// AAA 常設ライブラリは以上に挿入する。

#define INCLUDE_LIBRARY
#include __FILE__

#endif // INCLUDE_LIBRARY

#endif // INCLUDE_SUB

#endif // INCLUDE_MAIN
yukicoder

結果

テストケース

ソースコード
