#907043 (C++17) No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат

提出ソース

結果

問題	No.2651 [Cherry 6th Tune B] $\mathbb{C}$omplex комбинат
ユーザー	👑 p-adic
提出日時	2023-08-23 12:22:04
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	114 ms / 2,500 ms
コード長	7,598 bytes
コンパイル時間	3,364 ms
コンパイル使用メモリ	217,856 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-15 05:37:22
合計ジャッジ時間	8,626 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	106 ms 5,248 KB
testcase_03	AC	105 ms 5,248 KB
testcase_04	AC	112 ms 5,248 KB
testcase_05	AC	105 ms 5,248 KB
testcase_06	AC	105 ms 5,248 KB
testcase_07	AC	105 ms 5,248 KB
testcase_08	AC	105 ms 5,248 KB
testcase_09	AC	105 ms 5,248 KB
testcase_10	AC	105 ms 5,248 KB
testcase_11	AC	106 ms 5,248 KB
testcase_12	AC	106 ms 5,248 KB
testcase_13	AC	106 ms 5,248 KB
testcase_14	AC	105 ms 5,248 KB
testcase_15	AC	106 ms 5,248 KB
testcase_16	AC	105 ms 5,248 KB
testcase_17	AC	105 ms 5,248 KB
testcase_18	AC	105 ms 5,248 KB
testcase_19	AC	105 ms 5,248 KB
testcase_20	AC	114 ms 5,248 KB
testcase_21	AC	33 ms 5,248 KB
testcase_22	AC	57 ms 5,248 KB
testcase_23	AC	72 ms 5,248 KB
testcase_24	AC	87 ms 5,248 KB
testcase_25	AC	8 ms 5,248 KB
testcase_26	AC	52 ms 5,248 KB
testcase_27	AC	104 ms 5,248 KB
testcase_28	AC	77 ms 5,248 KB
testcase_29	AC	34 ms 5,248 KB
testcase_30	AC	9 ms 5,248 KB
testcase_31	AC	87 ms 5,248 KB
testcase_32	AC	15 ms 5,248 KB
testcase_33	AC	79 ms 5,248 KB
testcase_34	AC	49 ms 5,248 KB
testcase_35	AC	95 ms 5,248 KB
testcase_36	AC	88 ms 5,248 KB
testcase_37	AC	104 ms 5,248 KB
testcase_38	AC	98 ms 5,248 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#ifdef DEBUG
  #define _GLIBCXX_DEBUG
  #define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ); signal( SIGABRT , &AlertAbort )
  #define DEXPR( LL , BOUND , VALUE , DEBUG_VALUE ) CEXPR( LL , BOUND , DEBUG_VALUE )
  #define CERR( MESSAGE ) cerr << MESSAGE << endl;
  #define COUT( ANSWER ) cout << "出力： " << ANSWER << endl
  #define ASSERT( A , MIN , MAX ) CERR( "ASSERTチェック： " << ( MIN ) << ( ( MIN ) <= A ? "<=" : ">" ) << A << ( A <= ( MAX ) ? "<=" : ">" ) << ( MAX ) ); assert( ( MIN ) <= A && A <= ( MAX ) )
#else
  #pragma GCC optimize ( "O3" )
  #pragma GCC optimize( "unroll-loops" )
  #pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )
  #define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr )
  #define DEXPR( LL , BOUND , VALUE , DEBUG_VALUE ) CEXPR( LL , BOUND , VALUE )
  #define CERR( MESSAGE ) 
  #define COUT( ANSWER ) cout << ANSWER << "\n"
  #define ASSERT( A , MIN , MAX ) assert( ( MIN ) <= A && A <= ( MAX ) )
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define TYPE_OF( VAR ) decay_t<decltype( VAR )>
#define CEXPR( LL , BOUND , VALUE ) constexpr LL BOUND = VALUE
#define CIN( LL , A ) LL A; cin >> A
#define SET_ASSERT( A , MIN , MAX ) cin >> A; ASSERT( A , MIN , MAX )
#define CIN_ASSERT( A , MIN , MAX ) TYPE_OF( MAX ) A; SET_ASSERT( A , MIN , MAX )
#define GETLINE( A ) string A; getline( cin , A )
#define GETLINE_SEPARATE( A , SEPARATOR ) string A; getline( cin , A , SEPARATOR )
#define FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ )
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT_ ## HOW_MANY_TIMES , 0 , HOW_MANY_TIMES )
#define QUIT return 0

#ifdef DEBUG
  inline void AlertAbort( int n ) { CERR( "abort関数が呼ばれました。assertマクロのメッセージが出力されていない場合はオーバーフローの有無を確認をしてください。" ); }
#endif

template <typename T> inline T Residue( const T& a , const T& p ){ return a >= 0 ? a % p : p - 1 - ( ( - ( a + 1 ) ) % p ); }

#define POWER_MOD( ANSWER , ARGUMENT , EXPONENT , MODULO )		\
  ll ANSWER{ 1 };							\
  {									\
    ll ARGUMENT_FOR_SQUARE_FOR_POWER = ( ( MODULO ) + ( ( ARGUMENT ) % ( MODULO ) ) ) % ( MODULO ); \
    TYPE_OF( EXPONENT ) EXPONENT_FOR_SQUARE_FOR_POWER = ( EXPONENT );	\
    while( 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;				\
    }									\
  }									\

// 入力フォーマットチェック用
// 1行中の変数の個数をSEPARATOR区切りで確認
#define GETLINE_COUNT( S , VARIABLE_NUMBER , SEPARATOR ) GETLINE( S ); int VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S = 0; int VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S  = S.size(); { int size = S.size(); int count = 0; for( int i = 0 ; i < size ; i++ ){ if( S.substr( i , 1 ) == SEPARATOR ){ count++; } } assert( count + 1 == VARIABLE_NUMBER ); }
// 余計な入力の有無を確認
#ifdef DEBUG
  #define CHECK_REDUNDANT_INPUT 
#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 )
  // #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 )
#endif
// |N| <= BOUNDを満たすNをSから構築
#define STOI( S , N , BOUND ) TYPE_OF( BOUND ) N = 0; { 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{}; int VARIABLE_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 / 10 ? true : N == BOUND / 10 && VARIABLE_FOR_DIGIT_FOR_GETLINE <= BOUND % 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 ++; } }
// SをSEPARATORで区切りTを構築
#define SEPARATE( S , T , SEPARATOR ) string T{}; { assert( VARIABLE_FOR_INDEX_FOR_GETLINE_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_GETLINE_FOR_ ## S ); int VARIABLE_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 ++; } }

int main()
{
  UNTIE;

  DEXPR( int , bound_T , 100000 , 100 );
  CIN_ASSERT( T , 1 , bound_T );
  CEXPR( int , bound_N_sum , 300000 );
  CEXPR( int , bound_xy , 20000 );
  CEXPR( ll , P , 998244353 );
  REPEAT( T ){
    // |Z/zj - zj/Z|^2

    // = (ZZ')/(zjzj') - (Z/Z')(zj'/zj) - (Z'/Z)(zj/zj') + (zjzj')/(ZZ')

    // sum(i,0,N)sum(j,i+1,N){
    //   (zizi')/(zjzj') - (zi/zi')(zj'/zj) - (zi'/zi)(zj/zj') + (zjzj')/(zizi')
    // }
    
    // = 2^{-1} sum(i,0,N)sum(j,0,N){
    //   (zizi')/(zjzj') - (zi/zi')(zj'/zj) - (zi'/zi)(zj/zj') + (zjzj')/(zizi')
    // }
    
    // = 2^{-1}(
    //     sum(i,0,N){zizi'} * sum(j,0,N){1/zjzj'}
    //     -sum(i,0,N){zi/zi'} * sum(j,0,N){zj'/zj}
    //     -sum(i,0,N){zi'/zi} * sum(j,0,N){zj/zj'}
    //     +sum(i,0,N){1/zizi'} * sum(j,0,N){zjzj'}
    // }
    
    // = sum(i,0,N){zizi'} * sum(j,0,N){1/zjzj'}
    //   -|sum(i,0,N){zi^2/zizi'}|^2
    // }

    ll sum0 = 0;
    ll sum1 = 0;
    ll sum2 = 0;
    ll sum3 = 0;
    CIN_ASSERT( N , 2 , bound_N_sum );
    FOR( i , 0 , N ){
      CIN_ASSERT( x , -bound_xy , bound_xy );
      CIN_ASSERT( y , -bound_xy , bound_xy );
      int x2 = x * x;
      int xy = x * y;
      int y2 = y * y;
      int x2y2 = x2 + y2;
      POWER_MOD( x2y2inv , x2y2 , P - 2 , P );
      sum0 += x2y2;
      sum1 += x2y2inv;
      sum2 += ( x2 - y2 ) * x2y2inv % P;
      sum3 += 2 * xy * x2y2inv % P;
    }
    sum0 %= P;
    sum1 %= P;
    sum2 %= P;
    sum3 %= P;
    COUT( Residue( sum0 * sum1 - sum2 * sum2 - sum3 * sum3 , P ) );
  }
  CHECK_REDUNDANT_INPUT;
  cerr << "入力の強さ確認： " << T << "\n";
  QUIT;
}

yukicoder

結果

テストケース

ソースコード