#826456 (C++17) No.2165 Let's Play Nim!

提出ソース

結果

問題	No.2165 Let's Play Nim!
ユーザー	👑 p-adic
提出日時	2022-12-17 14:13:34
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	192 ms / 2,000 ms
コード長	7,276 bytes
コンパイル時間	3,426 ms
コンパイル使用メモリ	223,056 KB
実行使用メモリ	25,580 KB
平均クエリ数	668.59
最終ジャッジ日時	2024-04-28 08:43:32
合計ジャッジ時間	22,965 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	22 ms 25,196 KB
testcase_01	AC	99 ms 25,196 KB
testcase_02	AC	114 ms 25,196 KB
testcase_03	AC	68 ms 25,196 KB
testcase_04	AC	21 ms 25,196 KB
testcase_05	AC	24 ms 25,196 KB
testcase_06	AC	25 ms 25,196 KB
testcase_07	AC	25 ms 24,812 KB
testcase_08	AC	69 ms 25,208 KB
testcase_09	AC	22 ms 25,208 KB
testcase_10	AC	26 ms 25,208 KB
testcase_11	AC	117 ms 24,940 KB
testcase_12	AC	99 ms 24,812 KB
testcase_13	AC	20 ms 24,556 KB
testcase_14	AC	24 ms 25,568 KB
testcase_15	AC	24 ms 25,196 KB
testcase_16	AC	103 ms 25,196 KB
testcase_17	AC	45 ms 25,196 KB
testcase_18	AC	192 ms 25,184 KB
testcase_19	AC	21 ms 25,208 KB
testcase_20	AC	25 ms 24,824 KB
testcase_21	AC	42 ms 24,836 KB
testcase_22	AC	32 ms 25,220 KB
testcase_23	AC	29 ms 25,220 KB
testcase_24	AC	27 ms 25,348 KB
testcase_25	AC	63 ms 25,220 KB
testcase_26	AC	115 ms 24,940 KB
testcase_27	AC	33 ms 25,196 KB
testcase_28	AC	49 ms 25,580 KB
testcase_29	AC	21 ms 25,196 KB
testcase_30	AC	20 ms 25,324 KB
testcase_31	AC	20 ms 25,180 KB
testcase_32	AC	47 ms 25,196 KB
evil_2_big_1.txt	TLE	-
evil_2_big_2.txt	TLE	-
evil_2_big_3.txt	TLE	-
evil_big_1.txt	TLE	-
evil_big_2.txt	TLE	-
evil_big_3.txt	TLE	-

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

ソースコード

raw source code

// #define _GLIBCXX_DEBUG 
#pragma GCC optimize ( "O3" )
#pragma GCC target ( "avx" )
#include <bits/stdc++.h>
using namespace std;

using uint = unsigned int;
using ll = long long;

#define TYPE_OF( VAR ) remove_const<remove_reference<decltype( VAR )>::type >::type
#define UNTIE ios_base::sync_with_stdio( false ); cin.tie( nullptr ) 
#define CEXPR( LL , BOUND , VALUE ) constexpr const LL BOUND = VALUE 
#define CIN( LL , A ) LL A; cin >> A 
#define ASSERT( A , MIN , MAX ) assert( MIN <= A && A <= MAX ) 
#define CIN_ASSERT( A , MIN , MAX ) CIN( TYPE_OF( MAX ) , A ); 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 FOREQ( VAR , INITIAL , FINAL ) for( TYPE_OF( FINAL ) VAR = INITIAL ; VAR <= FINAL ; VAR ++ ) 
#define FOREQINV( VAR , INITIAL , FINAL ) for( TYPE_OF( INITIAL ) VAR = INITIAL ; VAR >= FINAL ; VAR -- ) 
#define FOR_ITR( ARRAY , ITR , END ) for( auto ITR = ARRAY .begin() , END = ARRAY .end() ; ITR != END ; ITR ++ ) 
#define REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT , 0 , HOW_MANY_TIMES ) 
#define QUIT return 0 
// #define COUT( ANSWER ) cout << ( ANSWER ) << "\n"; 
#define COUT( ANSWER ) cout << ( ANSWER ) << endl; 
#define RETURN( ANSWER ) COUT( ANSWER ); QUIT 
#define DOUBLE( PRECISION , ANSWER ) cout << fixed << setprecision( PRECISION ) << ( ANSWER ) << "\n"; QUIT 

#define POWER( ANSWER , ARGUMENT , EXPONENT )				\
  TYPE_OF( ARGUMENT ) ANSWER{ 1 };					\
  {									\
    TYPE_OF( ARGUMENT ) ARGUMENT_FOR_SQUARE_FOR_POWER = ( ARGUMENT );	\
    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 *= 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 )		\
  TYPE_OF( ARGUMENT ) ANSWER{ 1 };					\
  {									\
    TYPE_OF( ARGUMENT ) 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;				\
    }									\
  }									\


#define FACTORIAL_MOD( ANSWER , ANSWER_INV , MAX_I , LENGTH , MODULO )	\
  ll ANSWER[LENGTH];							\
  ll ANSWER_INV[LENGTH];						\
  {									\
    ll VARIABLE_FOR_PRODUCT_FOR_FACTORIAL = 1;				\
    ANSWER[0] = VARIABLE_FOR_PRODUCT_FOR_FACTORIAL;			\
    FOREQ( i , 1 , MAX_I ){						\
      ANSWER[i] = ( VARIABLE_FOR_PRODUCT_FOR_FACTORIAL *= i ) %= MODULO; \
    }									\
    POWER_MOD( FACTORIAL_MAX_INV , ANSWER[MAX_I] , MODULO - 2 , MODULO ); \
    ANSWER_INV[MAX_I] = FACTORIAL_MAX_INV;				\
    FOREQINV( i , MAX_I - 1 , 0 ){					\
      ANSWER_INV[i] = ( FACTORIAL_MAX_INV *= i + 1 ) %= MODULO;		\
    }									\
  }									\
									\

// 通常の二分探索
#define BS( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , TARGET )		\
  ll ANSWER = MAXIMUM;							\
  {									\
    ll VARIABLE_FOR_BINARY_SEARCH_L = MINIMUM;				\
    ll VARIABLE_FOR_BINARY_SEARCH_U = ANSWER;				\
    ll VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH = ( TARGET ) - ( EXPRESSION ); \
    if( VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH == 0 ){		\
      VARIABLE_FOR_BINARY_SEARCH_L = ANSWER;				\
    } else {								\
      ANSWER = ( VARIABLE_FOR_BINARY_SEARCH_L + VARIABLE_FOR_BINARY_SEARCH_U ) / 2; \
    }									\
    while( VARIABLE_FOR_BINARY_SEARCH_L != ANSWER ){			\
      VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH = ( TARGET ) - ( EXPRESSION ); \
      if( VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH == 0 ){		\
	VARIABLE_FOR_BINARY_SEARCH_L = ANSWER;				\
	break;								\
      } else {								\
	if( VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH > 0 ){		\
	  VARIABLE_FOR_BINARY_SEARCH_L = ANSWER;			\
	} else {							\
	  VARIABLE_FOR_BINARY_SEARCH_U = ANSWER;			\
	}								\
	ANSWER = ( VARIABLE_FOR_BINARY_SEARCH_L + VARIABLE_FOR_BINARY_SEARCH_U ) / 2; \
      }									\
    }									\
  }									\
									\


// 二進法の二分探索
#define BS2( ANSWER , MINIMUM , MAXIMUM , EXPRESSION , TARGET )		\
  ll ANSWER = MINIMUM;							\
  {									\
    ll VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2 = 1;			\
    ll VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH = ( MAXIMUM ) - ANSWER; \
    while( VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2 <= VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH ){ \
      VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2 *= 2;			\
    }									\
    VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2 /= 2;			\
    ll VARIABLE_FOR_ANSWER_FOR_BINARY_SEARCH_2 = ANSWER;		\
    while( VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2 != 0 ){		\
      ANSWER = VARIABLE_FOR_ANSWER_FOR_BINARY_SEARCH_2 + VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2; \
      VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH = ( TARGET ) - ( EXPRESSION ); \
      if( VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH == 0 ){		\
	VARIABLE_FOR_ANSWER_FOR_BINARY_SEARCH_2 = ANSWER;		\
	break;								\
      } else if( VARIABLE_FOR_DIFFERENCE_FOR_BINARY_SEARCH > 0 ){	\
	VARIABLE_FOR_ANSWER_FOR_BINARY_SEARCH_2 = ANSWER;		\
      }									\
      VARIABLE_FOR_POWER_FOR_BINARY_SEARCH_2 /= 2;			\
    }									\
    ANSWER = VARIABLE_FOR_ANSWER_FOR_BINARY_SEARCH_2;			\
  }									\
									\


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

int main()
{
  CEXPR( int , bound , 75000 );
  CIN_ASSERT( N , 1 , bound );
  map<int,int> A{};
  int sum = 0;
  FOREQ( i , 1 , N ){
    CIN_ASSERT( Ai , 1 , bound );
    A[i] = Ai;
    sum ^= Ai;
  }
  int t = sum == 0 ? 0 : 1;
  COUT( t );
  int diff;
  int diff_max;
  map<int,int>::iterator itr_diff_max;
  while( ! A.empty() ){
    if( t == 0 ){
      CIN_ASSERT( i , 1 , N );
      assert( A.count( i ) == 1 );
      int& Ai = A[i];
      CIN_ASSERT( k , 1 , Ai );
      sum = Ai;
      if( Ai == k ){
  	A.erase( i );
      } else {
  	Ai -= k;
	sum ^= Ai;
      }
    } else {
      diff_max = 0;
      FOR_ITR( A , itr , end ){
  	const int& i = itr->first;
  	int& Ai = itr->second;
  	diff = Ai - ( Ai ^ sum );
  	if( diff == Ai ){
  	  cout << i << " " << Ai << endl;
  	  A.erase( itr );
  	  diff_max = -1;
  	  break;
  	}
  	if( diff_max < diff ){
  	  diff_max = diff;
  	  itr_diff_max = itr;
  	}
      }
      assert( diff_max != 0 );
      if( diff_max != -1 ){
  	cout << itr_diff_max->first << " " << diff_max << endl;
  	itr_diff_max->second ^= sum;
  	assert( itr_diff_max->second != 0 );
      }
    }
    CIN_ASSERT( ret , -1 , 0 );
    if( ret == -1 ){
      QUIT;
    }
    t = 1 - t;
  }
  QUIT;
}

yukicoder

結果

テストケース

ソースコード