結果
問題 | No.3003 多項式の割り算 〜hard〜 |
ユーザー |
👑 |
提出日時 | 2025-01-11 17:56:48 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 29,018 bytes |
コンパイル時間 | 12,579 ms |
コンパイル使用メモリ | 283,180 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2025-01-11 18:02:35 |
合計ジャッジ時間 | 13,820 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
// 入力制約/フォーマットチェック#ifndef INCLUDE_MODE#define INCLUDE_MODE// #define REACTIVE#define USE_GETLINE#endif#ifdef INCLUDE_MAINvoid Solve(){CEXPR( ll , bound , 1e18 );GETLINE_COUNT( AB_str , 2 , ' ' );STOI( AB_str , A , -bound , bound );STOI( AB_str , B , 0 , bound );B %= 3;if( B == 0 ){RETURN( 0 , A );} else if( B == 1 ){RETURN( A , 0 );}RETURN( -A , -A );}REPEAT_MAIN(1);#else // INCLUDE_MAIN#ifdef INCLUDE_LIBRARY// https://github.com/p-adic/cpp// VVV ライブラリは以下に挿入する。redefinitionを避けるため圧縮元はincludeしない。/* 圧縮用 */#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 IS basic_istream<char,Traits>#define OS basic_ostream<char,Traits>#define ST_AS static_assert#define reMO_CO remove_const#define is_COructible_v is_constructible_v#define rBE rbegin// AAA ライブラリは以上に挿入する。#define INCLUDE_MAIN#include __FILE__#else // INCLUDE_LIBRARY#ifdef DEBUG#define _GLIBCXX_DEBUG#define DEXPR( LL , BOUND , VALUE1 , VALUE2 ) CEXPR( LL , BOUND , VALUE2 )#define SIGNAL signal( SIGABRT , &AlertAbort );#define ASSERT( A , MIN , MAX ) CERR( "ASSERTチェック: " , ( MIN ) , ( ( MIN ) <= A ? "<=" : ">" ) , A , ( A <= ( MAX ) ? "<=" : ">" ) , ( MAX )); assert( ( MIN ) <= A && A <= ( MAX ) )#define COUT( ... ) VariadicCout( cout << "出力:" , __VA_ARGS__ ) << endl#define COUTNS( ... ) VariadicCoutNonSep( cout , __VA_ARGS__ ) << flush#define CERR( ... ) VariadicCout( cerr , __VA_ARGS__ ) << endl#define CERRNS( ... ) VariadicCout( cerr , __VA_ARGS__ ) << flush#define COUT_A( A , N ) OUTPUT_ARRAY( cout << "出力:" , A , N ) << endl#define CERR_A( A , N ) OUTPUT_ARRAY( cerr , A , N ) << endlint exec_mode = 0;#else#pragma GCC optimize ( "O3" )#pragma GCC optimize ( "unroll-loops" )#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )#define SIGNAL#define DEXPR( LL , BOUND , VALUE1 , VALUE2 ) CEXPR( LL , BOUND , VALUE1 )#define ASSERT( A , MIN , MAX ) assert( ( MIN ) <= A && A <= ( MAX ) )#define COUT( ... ) VariadicCout( cout , __VA_ARGS__ ) << ENDL#define COUTNS( ... ) VariadicCoutNonSep( cout , __VA_ARGS__ )#define CERR( ... )#define CERRNS( ... )#define COUT_A( A , N ) OUTPUT_ARRAY( cout , A , N ) << ENDL#define CERR_A( A , N )#endif#ifdef REACTIVE#ifdef DEBUG#define RSET( A , ... ) A = __VA_ARGS__#else#define RSET( A , ... ) cin >> A#endif#define RCIN( LL , A , ... ) LL A; RSET( A , __VA_ARGS__ )#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 , ... ) string __VA_ARGS__; VariadicGetline( cin , SEPARATOR , __VA_ARGS__ )#define GETLINE( ... ) GETLINE_SEPARATE( '\n' , __VA_ARGS__ )#else#define SET_LL( A ) cin >> A#define CIN( LL , ... ) LL __VA_ARGS__; VariadicCin( cin , __VA_ARGS__ )#define SET_A( I , N , ... ) VariadicResize( N + I , __VA_ARGS__ ); FOR( VARIABLE_FOR_SET_A , 0 , N ){ VariadicSet( cin , VARIABLE_FOR_SET_A + I ,__VA_ARGS__ ); }#define CIN_A( LL , I , N , ... ) vector<LL> __VA_ARGS__; SET_A( I , N , __VA_ARGS__ )#define CIN_AA( LL , I0 , N0 , I1 , N1 , VAR ) vector<vector<LL>> VAR( N0 + I0 ); FOR( VARIABLE_FOR_CIN_AA , 0 , N0 ){ SET_A( I1 , N1 ,VAR[VARIABLE_FOR_CIN_AA + I0] ); }#endif#include <bits/stdc++.h>using namespace std;#define REPEAT_MAIN( BOUND ) int main(){ ios_base::sync_with_stdio( false ); cin.tie( nullptr ); SIGNAL; CEXPR( int , bound_test_case_num , BOUND );int test_case_num = 1; if constexpr( bound_test_case_num > 1 ){ CERR( "テストケースの個数を入力してください。" ); SET_ASSERT( test_case_num , 1 ,bound_test_case_num ); } FOR( test_case , 0 , test_case_num ){ if constexpr( bound_test_case_num > 1 ){ CERR( "testcase" , test_case , ":" ); }Solve(); CERR( "" ); } CHECK_REDUNDANT_INPUT; }#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 ) constexpr LL BOUND = VALUE#define SET_ASSERT( A , MIN , MAX ) SET_LL( A ); ASSERT( A , MIN , MAX )#define SET_A_ASSERT( I , N , A , MIN , MAX ) FOR( VARIABLE_FOR_SET_A , 0 , N ){ SET_ASSERT( A[VARIABLE_FOR_SET_A + I] , MIN , MAX ); }#define SET_AA_ASSERT( I0 , N0 , I1 , N1 , A , MIN , MAX ) FOR( VARIABLE_FOR_SET_AA0 , 0 , N0 ){ FOR( VARIABLE_FOR_SET_AA1 , 0 , N1 ){ SET_ASSERT(A[VARIABLE_FOR_SET_AA0 + I0][VARIABLE_FOR_SET_AA1 + I1] , MIN , MAX ); } }#define CIN_ASSERT( A , MIN , MAX ) decldecay_t( MAX ) A; SET_ASSERT( A , MIN , MAX )#define CIN_A_ASSERT( I , N , A , MIN , MAX ) vector<decldecay_t( MAX )> A( N + I ); SET_A_ASSERT( I , N , A , MIN , MAX )#define CIN_AA_ASSERT( I0 , N0 , I1 , N1 , A , MIN , MAX ) vector A( N0 + I0 , vector<decldecay_t( MAX )>( N1 + I1 ) ); SET_AA_ASSERT( I0 , N0 , I1 ,N1 , A , MIN , MAX )#define SET_MAX( A , X ) A = max( A , decltype( A )( X ) )#define SET_MIN( A , X ) A = min( A , decltype( A )( X ) )#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 ITR( ARRAY ) auto begin_ ## ARRAY = ARRAY .BE() , itr_ ## ARRAY = begin_ ## ARRAY , end_ ## ARRAY = ARRAY .EN()#define FOR_ITR( ARRAY ) for( ITR( ARRAY ) , itr = itr_ ## ARRAY ; itr_ ## ARRAY != end_ ## ARRAY ; itr_ ## ARRAY ++ , itr++ )#define RUN( ARRAY , ... ) for( auto&& __VA_ARGS__ : ARRAY )#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES )#define SET_PRECISION( DECIMAL_DIGITS ) cout << fixed << setprecision( DECIMAL_DIGITS )#define RETURN( ... ) COUT( __VA_ARGS__ ); return// 型のエイリアス#define decldecay_t( VAR ) decay_t<decltype( VAR )>template <typename F , typename...Args> using ret_t = decltype( declval<F>()( declval<Args>()... ) );template <typename T> using inner_t = typename T::type;using uint = unsigned int;using ll = long long;using ull = unsigned long long;using ld = long double;using lld = __float128;template <typename INT> using T2 = pair<INT,INT>;template <typename INT> using T3 = tuple<INT,INT,INT>;template <typename INT> using T4 = tuple<INT,INT,INT,INT>;using path = pair<int,ll>;/* VVV 常設ライブラリの非圧縮版は以下に挿入する。*/// Randomll GetRand( const int& Rand_min , const int& Rand_max ) { assert( Rand_min <= Rand_max ); ll answer = time( NULL ); return answer * rand() % (Rand_max + 1 - Rand_min ) + Rand_min; }// Set#define DECLARATION_OF_HASH( ... ) \struct hash<__VA_ARGS__> \{ \\inline size_t operator()( const __VA_ARGS__& n ) const; \\}; \class is_ordered{private:is_ordered() = delete;template <typename T> static constexpr auto Check( const T& t ) -> decltype( t < t , true_type() );static constexpr false_type Check( ... );public:template <typename T> static constexpr const bool value = is_same_v< decltype( Check( declval<T>() ) ) , true_type >;};template <typename T>using Set = conditional_t<is_constructible_v<unordered_set<T>>,unordered_set<T>,conditional_t<is_ordered::value<T>,set<T>,void>>;// Tuple#define DECLARATION_OF_ARITHMETIC_FOR_TUPLE( OPR ) \template <typename T , typename U , template <typename...> typename V> inline auto operator OPR ## =( V<T,U>& t0 , const V<T,U>& t1 ) -> decltype(( get<0>( t0 ) , t0 ) )&; \template <typename T , typename U , typename V> inline tuple<T,U,V>& operator OPR ## =( tuple<T,U,V>& t0 , const tuple<T,U,V>& t1 ); \template <typename T , typename U , typename V , typename W> inline tuple<T,U,V,W>& operator OPR ## =( tuple<T,U,V,W>& t0 , const tuple<T,U,V,W>&t1 ); \template <typename ARG , typename T , typename U , template <typename...> typename V> inline auto operator OPR ## =( V<T,U>& t0 , const ARG& t1 )-> decltype( ( get<0>( t0 ) , t0 ) )&; \template <typename ARG , typename T , typename U , typename V> inline tuple<T,U,V>& operator OPR ## =( tuple<T,U,V>& t0 , const ARG& t1 ); \template <typename ARG , typename T , typename U , typename V , typename W> inline tuple<T,U,V,W>& operator OPR ## =( tuple<T,U,V,W>& t0 , constARG& t1 ); \template <template <typename...> typename V , typename...ARGS , typename ARG> inline auto operator OPR( const V<ARGS...>& t0 , const ARG& t1 ) ->decldecay_t( ( get<0>( t0 ) , t0 ) ) \#define DEFINITION_OF_ARITHMETIC_FOR_TUPLE( OPR ) \template <typename T , typename U , template <typename...> typename V> inline auto operator OPR ## =( V<T,U>& t0 , const V<T,U>& t1 ) -> decltype(( get<0>( t0 ) , t0 ) )& { get<0>( t0 ) OPR ## = get<0>( t1 ); get<1>( t0 ) OPR ## = get<1>( t1 ); return t0; } \template <typename T , typename U , typename V> inline tuple<T,U,V>& operator OPR ## =( tuple<T,U,V>& t0 , const tuple<T,U,V>& t1 ) { get<0>( t0 )OPR ## = get<0>( t1 ); get<1>( t0 ) OPR ## = get<1>( t1 ); get<2>( t0 ) OPR ## = get<2>( t1 ); return t0; } \template <typename T , typename U , typename V , typename W> inline tuple<T,U,V,W>& operator OPR ## =( tuple<T,U,V,W>& t0 , const tuple<T,U,V,W>&t1 ) { get<0>( t0 ) OPR ## = get<0>( t1 ); get<1>( t0 ) OPR ## = get<1>( t1 ); get<2>( t0 ) OPR ## = get<2>( t1 ); get<3>( t0 ) OPR ## = get<3>( t1 ); return t0; } \template <typename ARG , typename T , typename U , template <typename...> typename V> inline auto operator OPR ## =( V<T,U>& t0 , const ARG& t1 )-> decltype( ( get<0>( t0 ) , t0 ) )& { get<0>( t0 ) OPR ## = t1; get<1>( t0 ) OPR ## = t1; return t0; } \template <typename ARG , typename T , typename U , typename V> inline tuple<T,U,V>& operator OPR ## =( tuple<T,U,V>& t0 , const ARG& t1 ) { get<0>(t0 ) OPR ## = t1; get<1>( t0 ) OPR ## = t1; get<2>( t0 ) OPR ## = t1; return t0; } \template <typename ARG , typename T , typename U , typename V , typename W> inline tuple<T,U,V,W>& operator OPR ## =( tuple<T,U,V,W>& t0 , constARG& t1 ) { get<0>( t0 ) OPR ## = t1; get<1>( t0 ) OPR ## = t1; get<2>( t0 ) OPR ## = t1; get<3>( t0 ) OPR ## = t1; return t0; } \template <template <typename...> typename V , typename...ARGS , typename ARG> inline auto operator OPR( const V<ARGS...>& t0 , const ARG& t1 ) ->decldecay_t( ( get<0>( t0 ) , t0 ) ) { auto t = t0; return move( t OPR ## = t1 ); } \#define DECLARATION_OF_INCREMENT_FOR_TUPLE( INCR ) \template <typename T , typename U , template <typename...> typename V> inline auto operator INCR( V<T,U>& t ) -> decltype( ( get<0>( t ) , t ) )&;\template <typename T , typename U , typename V> inline tuple<T,U,V>& operator INCR ( tuple<T,U,V>& t ); \template <typename T , typename U , typename V , typename W> inline tuple<T,U,V,W>& operator INCR ( tuple<T,U,V,W>& t ); \#define DEFINITION_OF_INCREMENT_FOR_TUPLE( INCR ) \template <typename T , typename U , template <typename...> typename V> inline auto operator INCR( V<T,U>& t ) -> decltype( ( get<0>( t ) , t ) )& {INCR get<0>( t ); INCR get<1>( t ); return t; } \template <typename T , typename U , typename V> inline tuple<T,U,V>& operator INCR ( tuple<T,U,V>& t ) { INCR get<0>( t ); INCR get<1>( t ); INCRget<2>( t ); return t; } \template <typename T , typename U , typename V , typename W> inline tuple<T,U,V,W>& operator INCR ( tuple<T,U,V,W>& t ) { INCR get<0>( t ); INCRget<1>( t ); INCR get<2>( t ); INCR get<3>( t ); return t; } \DEFINITION_OF_ARITHMETIC_FOR_TUPLE( + );DEFINITION_OF_ARITHMETIC_FOR_TUPLE( - );DEFINITION_OF_ARITHMETIC_FOR_TUPLE( * );DEFINITION_OF_ARITHMETIC_FOR_TUPLE( / );DEFINITION_OF_ARITHMETIC_FOR_TUPLE( % );DEFINITION_OF_INCREMENT_FOR_TUPLE( ++ );DEFINITION_OF_INCREMENT_FOR_TUPLE( -- );template <class Traits , typename T> inline basic_istream<char,Traits>& operator>>( basic_istream<char,Traits>& is , tuple<T>& arg ){ return is >>get<0>( arg ); }template <class Traits , typename T , typename U , template <typename...> typename V> inline auto operator>>( basic_istream<char,Traits>& is , V<T,U>& arg ) -> decltype((get<0>(arg),is))& { return is >> get<0>( arg ) >> get<1>( arg ); }template <class Traits , typename T , typename U , typename V> inline basic_istream<char,Traits>& operator>>( basic_istream<char,Traits>& is , tuple<T,U,V>& arg ) { return is >> get<0>( arg ) >> get<1>( arg ) >> get<2>( arg ); }template <class Traits , typename T , typename U , typename V , typename W> inline basic_istream<char,Traits>& operator>>( basic_istream<char,Traits>& is , tuple<T,U,V,W>& arg ) { return is >> get<0>( arg ) >> get<1>( arg ) >> get<2>( arg ) >> get<3>( arg ); }template <class Traits , typename T> inline basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , const tuple<T>& arg ) { returnos << get<0>( arg ); }template <class Traits , typename T , typename U , template <typename...> typename V> inline auto operator<<( basic_ostream<char,Traits>& os , constV<T,U>& arg ) -> decltype((get<0>(arg),os))& { return os << get<0>( arg ) << " " << get<1>( arg ); }template <class Traits , typename T , typename U , typename V> inline basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , consttuple<T,U,V>& arg ) { return os << get<0>( arg ) << " " << get<1>( arg ) << " " << get<2>( arg ); }template <class Traits , typename T , typename U , typename V , typename W> inline basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , const tuple<T,U,V,W>& arg ) { return os << get<0>( arg ) << " " << get<1>( arg ) << " " << get<2>( arg ) << " " << get<3>( arg ); }#define DEFINITION_OF_HASH_FOR_TUPLE( PAIR ) \template <typename T , typename U> inline size_t hash<PAIR<T,U>>::operator()( const PAIR<T,U>& n ) const { static const size_t seed = ( GetRand(1e3 , 1e8 ) << 1 ) | 1; static const hash<T> h0; static const hash<U> h1; return ( h0( get<0>( n ) ) * seed ) ^ h1( get<1>( n ) ); } \template <typename T> DECLARATION_OF_HASH( tuple<T> );template <typename T , typename U> DECLARATION_OF_HASH( pair<T,U> );template <typename T , typename U> DECLARATION_OF_HASH( tuple<T,U> );template <typename T , typename U , typename V> DECLARATION_OF_HASH( tuple<T,U,V> );template <typename T , typename U , typename V , typename W> DECLARATION_OF_HASH( tuple<T,U,V,W> );template <typename T> inline size_t hash<tuple<T>>::operator()( const tuple<T>& n ) const { static const hash<T> h; return h(get<0>( n ) ); }DEFINITION_OF_HASH_FOR_TUPLE( pair );DEFINITION_OF_HASH_FOR_TUPLE( tuple );template <typename T , typename U , typename V> inline size_t hash<tuple<T,U,V>>::operator()( const tuple<T,U,V>& n ) const { static const size_tseed = ( GetRand( 1e3 , 1e8 ) << 1 ) | 1; static const hash<pair<T,U>> h01; static const hash<V> h2; return ( h01( { get<0>( n ) , get<1>( n ) }) * seed ) ^ h2( get<2>( n ) ); }template <typename T , typename U , typename V , typename W> inline size_t hash<tuple<T,U,V,W>>::operator()( const tuple<T,U,V,W>& n ) const { staticconst size_t seed = ( GetRand( 1e3 , 1e8 ) << 1 ) | 1; static const hash<pair<T,U>> h01; static const hash<pair<V,W>> h23; return ( h01( { get<0>( n ) , get<1>( n ) } ) * seed ) ^ h23( { get<2>( n ) , get<3>( n ) } ); }// Vector#define DECLARATION_OF_ARITHMETIC_FOR_VECTOR( V , OPR ) \template <typename T> inline V<T>& operator OPR ## = ( V<T>& a , const T& t ); \template <typename T> inline V<T>& operator OPR ## = ( V<T>& a0 , const V<T>& a1 ); \template <typename T , typename U> inline V<T> operator OPR( V<T> a , const U& u ); \#define DEFINITION_OF_ARITHMETIC_FOR_VECTOR( V , OPR ) \template <typename T> inline V<T>& operator OPR ## = ( V<T>& a , const T& t ) { for( auto& s : a ){ s OPR ## = t; } return a; } \template <typename T> inline V<T>& operator OPR ## = ( V<T>& a0 , const V<T>& a1 ) { assert( a0.size() <= a1.size() ); auto itr0 = a0.begin() ,end0 = a0.end(); auto itr1 = a1.begin(); while( itr0 != end0 ){ *( itr0++ ) OPR ## = *( itr1++ ); } return a0; } \template <typename T , typename U> inline V<T> operator OPR( V<T> a , const U& u ) { return move( a OPR ## = u ); } \#define DECLARATION_OF_INCREMENT_FOR_VECTOR( V , INCR ) \template <typename T> inline V<T>& operator INCR( V<T>& a ); \#define DEFINITION_OF_INCREMENT_FOR_VECTOR( V , INCR ) \template <typename T> inline V<T>& operator INCR( V<T>& a ) { for( auto& i : a ){ INCR i; } return a; } \#define DECLARATION_OF_ARITHMETICS_FOR_VECTOR( V ) \DECLARATION_OF_ARITHMETIC_FOR_VECTOR( V , + ); \DECLARATION_OF_ARITHMETIC_FOR_VECTOR( V , - ); \DECLARATION_OF_ARITHMETIC_FOR_VECTOR( V , * ); \DECLARATION_OF_ARITHMETIC_FOR_VECTOR( V , / ); \DECLARATION_OF_ARITHMETIC_FOR_VECTOR( V , % ); \DECLARATION_OF_INCREMENT_FOR_VECTOR( V , ++ ); \DECLARATION_OF_INCREMENT_FOR_VECTOR( V , -- ); \template <typename T> inline V<T> operator*( const T& scalar , V<T> v ) \#define DEFINITION_OF_ARITHMETICS_FOR_VECTOR( V ) \DEFINITION_OF_ARITHMETIC_FOR_VECTOR( V , + ); \DEFINITION_OF_ARITHMETIC_FOR_VECTOR( V , - ); \DEFINITION_OF_ARITHMETIC_FOR_VECTOR( V , * ); \DEFINITION_OF_ARITHMETIC_FOR_VECTOR( V , / ); \DEFINITION_OF_ARITHMETIC_FOR_VECTOR( V , % ); \DEFINITION_OF_INCREMENT_FOR_VECTOR( V , ++ ); \DEFINITION_OF_INCREMENT_FOR_VECTOR( V , -- ); \template <typename T> inline V<T> operator*( const T& scalar , V<T> v ) { for( auto& t : v ){ t *= scalar; } return move( v ); } \DEFINITION_OF_ARITHMETICS_FOR_VECTOR( vector );DEFINITION_OF_ARITHMETICS_FOR_VECTOR( list );template <typename V> inline auto Get( V& a ) { return [&]( const int& i = 0 ) -> const decldecay_t( a[0] )& { return a[i]; }; }template <typename T = int> inline vector<T> id( const int& size ) { vector<T> answer( size ); for( int i = 0 ; i < size ; i++ ){ answer[i] = i; }return answer; }template <typename T> inline void Sort( vector<T>& a , const bool& reversed = false ) { if( reversed ){ static auto comp = []( const T& t0 , const T&t1 ) { return t1 < t0; }; sort( a.begin() , a.end() , comp ); } else { sort( a.begin() , a.end() ); } }template <typename T0 , typename T1> inline void Sort( vector<T0>& a , vector<T1>& b , const bool& reversed = false ) { const int size = a.size();assert( size == int( b.size() ) ); vector<pair<T0,T1>> v( size ); for( int i = 0 ; i < size ; i++ ){ v[i] = { move( a[i] ) , move( b[i] ) }; }Sort( v , reversed ); for( int i = 0 ; i < size ; i++ ){ a[i] = move( v[i].first ); b[i] = move( v[i].second ); } }template <typename T> inline vector<int> IndexSort( const vector<T>& a , const bool& reversed = false ) { auto index = id<int>( a.size() ); if(reversed ){ sort( index.begin() , index.end() , [&]( const int& i , const int& j ) { return a[j] < a[i]; } ); } else { sort( index.begin() ,index.end() , [&]( const int& i , const int& j ) { return a[i] < a[j]; } ); } return index; }#define DECLARATION_OF_COUT_FOR_VECTOR( V ) template <class Traits , typename Arg> inline basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , const V<Arg>& arg )#define DEFINITION_OF_COUT_FOR_VECTOR( V ) template <class Traits , typename Arg> inline basic_ostream<char,Traits>& operator<<( basic_ostream<char,Traits>& os , const V<Arg>& arg ) { auto begin = arg.begin() , end = arg.end(); auto itr = begin; while( itr != end ){ ( itr == begin ? os : os<< " " ) << *itr; itr++; } return os; }DEFINITION_OF_COUT_FOR_VECTOR( vector );DEFINITION_OF_COUT_FOR_VECTOR( list );DEFINITION_OF_COUT_FOR_VECTOR( set );DEFINITION_OF_COUT_FOR_VECTOR( unordered_set );inline void VariadicResize( const int& size ) {}template <typename Arg , typename... ARGS> inline void VariadicResize( const int& size , Arg& arg , ARGS&... args ) { arg.resize( size );VariadicResize( size , args... ); }// Map#define DECLARATION_OF_ARITHMETIC_FOR_MAP( MAP , OPR ) \template <typename T , typename U> inline MAP<T,U>& operator OPR ## = ( MAP<T,U>& a , const pair<T,U>& v ); \template <typename T , typename U> inline MAP<T,U>& operator OPR ## = ( MAP<T,U>& a0 , const MAP<T,U>& a1 ); \template <typename T , typename U , typename ARG> inline MAP<T,U> operator OPR( MAP<T,U> a , const ARG& arg ); \#define DEFINITION_OF_ARITHMETIC_FOR_MAP( MAP , OPR ) \template <typename T , typename U> inline MAP<T,U>& operator OPR ## = ( MAP<T,U>& a , const pair<T,U>& v ) { a[v.first] OPR ## = v.second; return a; } \template <typename T , typename U> inline MAP<T,U>& operator OPR ## = ( MAP<T,U>& a0 , const MAP<T,U>& a1 ) { for( auto& [t,u] : a1 ){ a0[t] OPR ##= u; } return a0; } \template <typename T , typename U , typename ARG> inline MAP<T,U> operator OPR( MAP<T,U> a , const ARG& arg ) { return move( a OPR ## = arg ); } \#define DECLARATION_OF_ARITHMETICS_FOR_MAP( MAP ) \DECLARATION_OF_ARITHMETIC_FOR_MAP( MAP , + ); \DECLARATION_OF_ARITHMETIC_FOR_MAP( MAP , - ); \DECLARATION_OF_ARITHMETIC_FOR_MAP( MAP , * ); \DECLARATION_OF_ARITHMETIC_FOR_MAP( MAP , / ); \DECLARATION_OF_ARITHMETIC_FOR_MAP( MAP , % ); \#define DEFINITION_OF_ARITHMETICS_FOR_MAP( MAP ) \DEFINITION_OF_ARITHMETIC_FOR_MAP( MAP , + ); \DEFINITION_OF_ARITHMETIC_FOR_MAP( MAP , - ); \DEFINITION_OF_ARITHMETIC_FOR_MAP( MAP , * ); \DEFINITION_OF_ARITHMETIC_FOR_MAP( MAP , / ); \DEFINITION_OF_ARITHMETIC_FOR_MAP( MAP , % ); \template <typename T , typename U>using Map = conditional_t<is_constructible_v<unordered_map<T,int>>,unordered_map<T,U>,conditional_t<is_ordered::value<T>,map<T,U>,void>>;DEFINITION_OF_ARITHMETICS_FOR_MAP( map );DEFINITION_OF_ARITHMETICS_FOR_MAP( unordered_map );// StdStreamtemplate <class Traits> inline basic_istream<char,Traits>& VariadicCin( basic_istream<char,Traits>& is ) { return is; }template <class Traits , typename Arg , typename... ARGS> inline basic_istream<char,Traits>& VariadicCin( basic_istream<char,Traits>& is , Arg& arg ,ARGS&... args ) { return VariadicCin( is >> arg , args... ); }template <class Traits> inline basic_istream<char,Traits>& VariadicSet( basic_istream<char,Traits>& is , const int& i ) { return is; }template <class Traits , typename Arg , typename... ARGS> inline basic_istream<char,Traits>& VariadicSet( basic_istream<char,Traits>& is , const int&i , Arg& arg , ARGS&... args ) { return VariadicSet( is >> arg[i] , i , args... ); }template <class Traits> inline basic_istream<char,Traits>& VariadicGetline( basic_istream<char,Traits>& is , const char& separator ) { return is; }template <class Traits , typename Arg , typename... ARGS> inline basic_istream<char,Traits>& VariadicGetline( basic_istream<char,Traits>& is , constchar& separator , Arg& arg , ARGS&... args ) { return VariadicGetline( getline( is , arg , separator ) , separator , args... ); }template <class Traits , typename Arg> inline basic_ostream<char,Traits>& VariadicCout( basic_ostream<char,Traits>& os , Arg&& arg ) { return os <<forward<Arg>( arg ); }template <class Traits , typename Arg1 , typename Arg2 , typename... ARGS> inline basic_ostream<char,Traits>& VariadicCout( basic_ostream<char,Traits>& os , Arg1&& arg1 , Arg2&& arg2 , ARGS&&... args ) { return VariadicCout( os << forward<Arg1>( arg1 ) << " " , forward<Arg2>( arg2 ) , forward<ARGS>( args )... ); }template <class Traits , typename Arg> inline basic_ostream<char,Traits>& VariadicCoutNonSep( basic_ostream<char,Traits>& os , Arg&& arg ) { returnos << forward<Arg>( arg ); }template <class Traits , typename Arg1 , typename Arg2 , typename... ARGS> inline basic_ostream<char,Traits>& VariadicCoutNonSep( basic_ostream<char,Traits>& os , Arg1&& arg1 , Arg2&& arg2 , ARGS&&... args ) { return VariadicCoutNonSep( os << forward<Arg1>( arg1 ) , forward<Arg2>( arg2 ) ,forward<ARGS>( args )... ); }template <class Traits , typename ARRAY> inline basic_ostream<char,Traits>& CoutArray( basic_ostream<char,Traits>& os , const int& i_start , constint& i_ulim , ARRAY&& a ) { for( int i = i_start ; i < i_ulim ; i++ ){ ( i == i_start ? os : ( os << " " ) ) << a[i]; } return os; }/* AAA 常設ライブラリの非圧縮版は以上に挿入する。*/// デバッグ用#ifdef DEBUGinline void AlertAbort( int n ) { CERR("abort関数が呼ばれました。assertマクロのメッセージが出力されていない場合はオーバーフローの有無を確認をしてください。" ); }#endif// 入力フォーマットチェック用// 1行中の変数の個数をSEPARATOR区切りで確認#define GETLINE_COUNT( S , VARIABLE_NUMBER , SEPARATOR ) GETLINE( S ); int VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S = 0; intVARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S = S.size(); { int size = S.size(); int count = 0; for( int i = 0 ; i < size ; i++ ){ if( S[i] ==SEPARATOR ){ count++; } } assert( VARIABLE_NUMBER == 0 ? size == 0 : count + 1 == VARIABLE_NUMBER ); }// 余計な入力の有無を確認#if defined( DEBUG ) || defined( REACTIVE )#define CHECK_REDUNDANT_INPUT#else#ifdef USE_GETLINE#define CHECK_REDUNDANT_INPUT string VARIABLE_FOR_CHECK_REDUNDANT_INPUT = ""; getline( cin , VARIABLE_FOR_CHECK_REDUNDANT_INPUT ); assert(VARIABLE_FOR_CHECK_REDUNDANT_INPUT == "" ); assert( ! cin )#else#define CHECK_REDUNDANT_INPUT string VARIABLE_FOR_CHECK_REDUNDANT_INPUT = ""; cin >> VARIABLE_FOR_CHECK_REDUNDANT_INPUT; assert(VARIABLE_FOR_CHECK_REDUNDANT_INPUT == "" ); assert( ! cin )#endif#endif// MIN <= N <= MAXを満たすNをSから構築#define STOI( S , N , MIN , MAX ) decldecay_t( MAX ) N = 0; decldecay_t( MAX ) BOUND ## N = max( decldecay_t( MAX )( abs( MIN ) ) , abs( MAX ) ); {bool VARIABLE_FOR_POSITIVITY_FOR_GETLINE = true; assert( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ); if( S.substr( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S , 1 ) == "-" ){ VARIABLE_FOR_POSITIVITY_FOR_GETLINE = false;VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S ++; assert( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ); }assert( S.substr( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S , 1 ) != " " ); string VARIABLE_FOR_LETTER_FOR_GETLINE{}; intVARIABLE_FOR_DIGIT_FOR_GETLINE{}; while( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ? (VARIABLE_FOR_LETTER_FOR_GETLINE = S.substr( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S , 1 ) ) != " " : false ){ VARIABLE_FOR_DIGIT_FOR_GETLINE =stoi( VARIABLE_FOR_LETTER_FOR_GETLINE ); assert( N < BOUND ## N / 10 ? true : N == BOUND ## N / 10 && VARIABLE_FOR_DIGIT_FOR_GETLINE <= BOUND ##N % 10 ); N = N * 10 + VARIABLE_FOR_DIGIT_FOR_GETLINE; VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S ++; } if( ! VARIABLE_FOR_POSITIVITY_FOR_GETLINE){ N *= -1; } if( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ){ VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S++; } ASSERT( N , MIN , MAX ); }#define STOI_A( S , I , N , A , MIN , MAX ) vector<decldecay_t( MAX )> A( N + I ); FOR( VARIABLE_FOR_STOI_A , 0 , N ){ STOI( S , A##_VARIABLE_FOR_STOI_A , MIN , MAX ); A[VARIABLE_FOR_STOI_A + I] = A ##_VARIABLE_FOR_STOI_A; }// Sをstring SEPARATORで区切りTを構築#define SEPARATE( S , T , SEPARATOR ) string T{}; { assert( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ); intVARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S_prev = VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S; assert( S.substr( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_## S , 1 ) != SEPARATOR ); string VARIABLE_FOR_LETTER_FOR_GETLINE{}; while( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S <VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ? ( VARIABLE_FOR_LETTER_FOR_GETLINE = S.substr( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S , 1 ) ) !=SEPARATOR : false ){ VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S ++; } T = S.substr( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S_prev ,VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S - VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S_prev ); if( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S <VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ){ VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S ++; } }#define INCLUDE_LIBRARY#include __FILE__#endif // INCLUDE_LIBRARY#endif // INCLUDE_MAIN