結果

問題 No.2306 [Cherry 5th Tune C] ウソツキタマシイ
コンテスト
ユーザー 👑 p-adic
提出日時 2023-05-16 07:24:16
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 3,932 bytes
コンパイル時間 2,697 ms
コンパイル使用メモリ 93,024 KB
最終ジャッジ日時 2025-02-13 00:46:36
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

// 入力制約チェック
#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 , 100000 );
  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;
}
0