結果
問題 | No.2306 [Cherry 5th Tune C] ウソツキタマシイ |
ユーザー | 👑 p-adic |
提出日時 | 2023-02-21 00:37:11 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 50 ms / 2,000 ms |
コード長 | 3,904 bytes |
コンパイル時間 | 1,000 ms |
コンパイル使用メモリ | 74,076 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-22 04:03:03 |
合計ジャッジ時間 | 4,440 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 3 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 33 ms
5,376 KB |
testcase_08 | AC | 9 ms
5,376 KB |
testcase_09 | AC | 22 ms
5,376 KB |
testcase_10 | AC | 17 ms
5,376 KB |
testcase_11 | AC | 22 ms
5,376 KB |
testcase_12 | AC | 30 ms
5,376 KB |
testcase_13 | AC | 22 ms
5,376 KB |
testcase_14 | AC | 18 ms
5,376 KB |
testcase_15 | AC | 37 ms
5,376 KB |
testcase_16 | AC | 38 ms
5,376 KB |
testcase_17 | AC | 49 ms
5,376 KB |
testcase_18 | AC | 49 ms
5,376 KB |
testcase_19 | AC | 49 ms
5,376 KB |
testcase_20 | AC | 48 ms
5,376 KB |
testcase_21 | AC | 49 ms
5,376 KB |
testcase_22 | AC | 49 ms
5,376 KB |
testcase_23 | AC | 50 ms
5,376 KB |
testcase_24 | AC | 49 ms
5,376 KB |
testcase_25 | AC | 49 ms
5,376 KB |
testcase_26 | AC | 48 ms
5,376 KB |
testcase_27 | AC | 39 ms
5,376 KB |
testcase_28 | AC | 44 ms
5,376 KB |
testcase_29 | AC | 35 ms
5,376 KB |
ソースコード
#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( 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 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; int VARIABLE_FOR_SIZE_FOR_STOI = S.size(); int VARIABLE_FOR_INDEX_FOR_STOI = 0; assert( VARIABLE_FOR_INDEX_FOR_STOI < VARIABLE_FOR_SIZE_FOR_STOI ); if( S.substr( VARIABLE_FOR_INDEX_FOR_STOI , 1 ) == "-" ){ VARIABLE_FOR_POSITIVITY_FOR_STOI = false; VARIABLE_FOR_INDEX_FOR_STOI++; assert( VARIABLE_FOR_INDEX_FOR_STOI < VARIABLE_FOR_SIZE_FOR_STOI ); } assert( S.substr( VARIABLE_FOR_INDEX_FOR_STOI , 1 ) != " " ); string VARIABLE_FOR_LETTER_FOR_STOI{}; int VARIABLE_FOR_DIGIT_FOR_STOI{}; while( VARIABLE_FOR_INDEX_FOR_STOI < VARIABLE_FOR_SIZE_FOR_STOI ? ( VARIABLE_FOR_LETTER_FOR_STOI = S.substr( VARIABLE_FOR_INDEX_FOR_STOI , 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++; } if( ! VARIABLE_FOR_POSITIVITY_FOR_STOI ){ N *= -1; } if( VARIABLE_FOR_INDEX_FOR_STOI < VARIABLE_FOR_SIZE_FOR_STOI ){ S = S.substr( ++VARIABLE_FOR_INDEX_FOR_STOI ); } else { 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; CEXPR( ll , bound_N , 1000000000 ); CIN_ASSERT( N , 1 , bound_N ); CEXPR( int , bound_MQ , 200000 ); CIN_ASSERT( M , 2 , bound_MQ ); ll A[bound_MQ + 1]; ll answer = 0; FOREQ( i , 1 , M ){ CIN_ASSERT( Ai , 0 , N ); answer += Ai * Ai; N -= Ai; A[i] = move( Ai ); } assert( N == 0 ); CIN_ASSERT( Q , 1 , bound_MQ ); REPEAT( Q ){ CIN_ASSERT( Cq , 1 , M ); ll& ACq = A[Cq]; CIN_ASSERT( Kq , 1 , ACq ); CIN_ASSERT( Dq , 1 , M ); assert( Cq != Dq ); ll& ADq = A[Dq]; answer += 2 * Kq * ( Kq + ADq - ACq ); ACq -= Kq; ADq += Kq; COUT( answer ); } CHECK_REDUNDANT_INPUT; QUIT; }