結果
問題 | No.2394 部分和乗総和 |
ユーザー |
👑 |
提出日時 | 2022-11-23 02:36:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 146 ms / 2,000 ms |
コード長 | 1,940 bytes |
コンパイル時間 | 702 ms |
コンパイル使用メモリ | 66,516 KB |
最終ジャッジ日時 | 2025-02-08 23:23:53 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 21 |
ソースコード
#include <iostream>#include <string>#include <stdio.h>#include <stdint.h>using namespace std;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 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 FOR( VAR , INITIAL , FINAL_PLUS_ONE ) for( TYPE_OF( FINAL_PLUS_ONE ) VAR = INITIAL ; VAR < FINAL_PLUS_ONE ; VAR ++ )#define QUIT return 0#define RETURN( ANSWER ) cout << ( ANSWER ) << "\n"; QUIT#define POWER_MOD( ANSWER , ARGUMENT , EXPONENT , MODULO ) \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 = ( 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; \} \} \template <typename T> inline T Absolute( const T& a ){ return a > 0 ? a : - a; }#include <cassert>#define MAIN mainint MAIN(){UNTIE;constexpr const int bound_N = 100000;CIN_ASSERT( N , 1 , bound_N );constexpr const ll bound_M = 1000000000000000000;CIN_ASSERT( M , 1 , bound_M );constexpr const ll bound_B = 1000000000;CIN_ASSERT( B , 1 , bound_B );M %= B;ll answer = 1;FOR( i , 0 , N ){CIN_ASSERT( Ai , 1 , bound_M );POWER_MOD( power_M , M , Ai , B );( answer *= 1 + power_M ) %= B;}RETURN( answer );}