結果
問題 | No.2306 [Cherry 5th Tune C] ウソツキタマシイ |
ユーザー |
👑 |
提出日時 | 2023-02-21 00:57:08 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 99 ms / 2,000 ms |
コード長 | 4,191 bytes |
コンパイル時間 | 4,535 ms |
コンパイル使用メモリ | 108,084 KB |
最終ジャッジ日時 | 2025-02-10 19:23:59 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
// 入力フォーマットチェック#pragma GCC optimize ( "O3" )#pragma GCC optimize( "unroll-loops" )#pragma GCC target ( "sse4.2,fma,avx2,popcnt,lzcnt,bmi2" )#include <iostream>#include <string>#include <stdio.h>#include <stdint.h>#include <cassert>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 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( S ) string S; getline( cin , S ); int VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S = 0; int VARIABLE_FOR_SIZE_FOR_STOI_FOR_ ## S = S.size()#define GETLINE_SEPARATE( S , SEPARATOR ) string S; getline( cin , S , 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 REPEAT( HOW_MANY_TIMES ) FOR( VARIABLE_FOR_REPEAT ## HOW_MANY_TIMES , 0 , HOW_MANY_TIMES )#define QUIT return 0#define COUT( ANSWER ) cout << ( ANSWER ) << "\n"// 入力フォーマットチェック用// 余分な改行を許さない// #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 )// |N| <= BOUNDを満たすNをSから構築#define STOI( S , N , BOUND ) TYPE_OF( BOUND ) N = 0; { bool VARIABLE_FOR_POSITIVITY_FOR_STOI = true; assert( VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S <VARIABLE_FOR_SIZE_FOR_STOI_FOR_ ## S ); if( S.substr( VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S , 1 ) == "-" ){ VARIABLE_FOR_POSITIVITY_FOR_STOI =false; VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S ++; assert( VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_STOI_FOR_ ## S ); } assert(S.substr( VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S , 1 ) != " " ); string VARIABLE_FOR_LETTER_FOR_STOI{}; int VARIABLE_FOR_DIGIT_FOR_STOI{}; while(VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S < VARIABLE_FOR_SIZE_FOR_STOI_FOR_ ## S ? ( VARIABLE_FOR_LETTER_FOR_STOI = S.substr(VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S , 1 ) ) != " " : false ){ VARIABLE_FOR_DIGIT_FOR_STOI = stoi( VARIABLE_FOR_LETTER_FOR_STOI ); assert( N <BOUND / 10 ? true : N == BOUND / 10 && VARIABLE_FOR_DIGIT_FOR_STOI <= BOUND % 10 ); N = N * 10 + VARIABLE_FOR_DIGIT_FOR_STOI;VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S ++; } if( ! VARIABLE_FOR_POSITIVITY_FOR_STOI ){ N *= -1; } if( VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S <VARIABLE_FOR_SIZE_FOR_STOI_FOR_ ## S ){ VARIABLE_FOR_INDEX_FOR_STOI_FOR_ ## S ++; } }// 1行で入力される変数の個数が適切か確認(半角空白の個数+1を調べる)#define COUNT_VARIABLE( S , VARIABLE_NUMBER ) { int size = S.size(); int count = 0; for( int i = 0 ; i < size ; i++ ){ if( S.substr( i , 1 ) == " " ){count++; } } assert( count + 1 == VARIABLE_NUMBER ); }int main(){UNTIE;GETLINE( NM_str );COUNT_VARIABLE( NM_str , 2 );CEXPR( ll , bound_N , 1000000000 );STOI( NM_str , N , bound_N );CEXPR( int , bound_MQ , 200000 );STOI( NM_str , M , bound_MQ );ll A[bound_MQ + 1];ll answer = 0;GETLINE( A_str );FOREQ( i , 1 , M ){STOI( A_str , Ai , N );answer += Ai * Ai;N -= Ai;A[i] = move( Ai );}GETLINE( Q_str );COUNT_VARIABLE( Q_str , 1 );STOI( Q_str , Q , bound_MQ );REPEAT( Q ){GETLINE( CKD_str );COUNT_VARIABLE( CKD_str , 3 );STOI( CKD_str , Cq , M );ll& ACq = A[Cq];STOI( CKD_str , Kq , ACq );STOI( CKD_str , Dq , M );ll& ADq = A[Dq];answer += 2 * Kq * ( Kq + ADq - ACq );ACq -= Kq;ADq += Kq;COUT( answer );}CHECK_REDUNDANT_INPUT;QUIT;}