#870262 (C++23) No.2306 [Cherry 5th Tune C] ウソツキタマシイ

• 問題: No.2306 [Cherry 5th Tune C] ウソツキタマシイ
• 提出日時: 2023-05-19 21:25:13
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 256 ms / 2,000 ms
• コード長: 3,572 bytes
• コンパイル時間: 3,133 ms
• コンパイル使用メモリ: 247,632 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-12-18 02:13:15
• 合計ジャッジ時間: 9,641 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	3 ms; 5,248 KB
testcase_03	AC	3 ms; 5,248 KB
testcase_04	AC	4 ms; 5,248 KB
testcase_05	AC	4 ms; 5,248 KB
testcase_06	AC	4 ms; 5,248 KB
testcase_07	AC	162 ms; 5,248 KB
testcase_08	AC	32 ms; 5,248 KB
testcase_09	AC	98 ms; 5,248 KB
testcase_10	AC	95 ms; 5,248 KB
testcase_11	AC	111 ms; 5,248 KB
testcase_12	AC	142 ms; 5,248 KB
testcase_13	AC	95 ms; 5,248 KB
testcase_14	AC	83 ms; 5,248 KB
testcase_15	AC	202 ms; 5,248 KB
testcase_16	AC	209 ms; 5,248 KB
testcase_17	AC	252 ms; 5,248 KB
testcase_18	AC	252 ms; 5,248 KB
testcase_19	AC	256 ms; 5,248 KB
testcase_20	AC	255 ms; 5,248 KB
testcase_21	AC	256 ms; 5,248 KB
testcase_22	AC	248 ms; 5,248 KB
testcase_23	AC	254 ms; 5,248 KB
testcase_24	AC	252 ms; 5,248 KB
testcase_25	AC	254 ms; 5,248 KB
testcase_26	AC	250 ms; 5,248 KB
testcase_27	AC	220 ms; 5,248 KB
testcase_28	AC	240 ms; 5,248 KB
testcase_29	AC	203 ms; 5,248 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

using ull = uint64_t;
using ll = int64_t;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using ld = long double;
using P = pair<ll,ll>;
using G = vector<vector<int>>;

#define LO(...) (void)0
#define debug(x) (void)0

#define reps(i,a,n) for(ll i##_len = (ll)(n), i = (a); i < i##_len; ++i)
#define rep(i,n) reps(i,0,(n))
#define rrep(i,n) reps(i,1,(n)+1)
#define repd(i,n) for(ll i=(n)-1;i>=0;i--)
#define rrepd(i,n) for(ll i=(n);i>=1;i--)

namespace std {template<typename T,typename U> istream &operator>>(istream &is, pair<T,U> &v){return is>>v.first>>v.second;}}

template<typename T>void input(T& a){cin>>a;}
template<typename T,typename... Ts>void input(T& a,Ts&... b){cin>>a;input(b...);}
#define inp(...) ll __VA_ARGS__;input(__VA_ARGS__)
#define inps(...) string __VA_ARGS__;input(__VA_ARGS__)
#define inpp(p) cin >> (p).first >> (p).second
#define inpv(v,N) vll v(N);rep(i,N)cin>>v[i];
#define inpvs(v,N) vs v(N);rep(i,N)cin>>v[i];
#define all(v) begin(v),end(v)
#define Yes cout<<"Yes\n"
#define No cout<<"No\n"
#define allok(i,N,pred) [&]()->bool{bool allok_=1;rep(i,N)if(!(pred))allok_=0;return allok_;}()
#define anyok(i,N,pred) [&]()->bool{bool anyok_=0;rep(i,N)if(pred)anyok_=1;return anyok_;}()
inline void YESNO(bool b){cout<<(b?"YES\n":"NO\n");}inline void yesno(bool b){cout<<(b?"yes\n":"no\n");}inline void YesNo(bool b){cout<<(b?"Yes\n":"No\n");}

#define SP cout<<' '
#define ENDL cout<<'\n'
#define setfp cout<<fixed<<setprecision(16)
template<typename C>string join(const C &v){ostringstream s;bool f=1;for(auto &&e:v){if(!f)s<<' ';f=0;s<<e;}return s.str();}
template<typename C>string joinadd(const C &v){ostringstream s;bool f=1;for(auto &&e:v){if(!f)s<<' ';f=0;s<<e+1;}return s.str();}
template<typename C>void prv_(const C &v){cout<<join(v);}
template<typename C>void prvadd_(const C &v){cout<<joinadd(v);}
template<typename C>void prv(const C &v){prv_(v);ENDL;}
template<typename C>void prvadd(const C &v){prvadd_(v);ENDL;}

template<typename ...>using rr_void_t=void;
template<typename T,typename=void>struct is_container:false_type{};
template<typename T>struct is_container<T,rr_void_t<typename T::iterator>>:true_type{};

template<typename T,typename=enable_if_t<is_container<T>::value && !is_same<string,T>::value>>
void pr_(const T& a){prv_(a);}
template<typename T,typename=enable_if_t<!is_container<T>::value || is_same<string,T>::value>,typename=void>
void pr_(const T& a){cout<<a;}
inline void pr(){cout<<'\n';}
template<typename T>void pr(const T& a){pr_(a);cout<<'\n';}
template<typename T,typename... Ts>void pr(const T& a,const Ts&... b){pr_(a);cout<<' ';pr(b...);}
template<typename T>void prs(const T& a){pr_(a);SP;}

inline ll max(ll a, ll b){return max<ll>(a, b);}
inline ll min(ll a, ll b){return min<ll>(a, b);}
template<typename T>bool chmax(T &a,const T &b){return a<b?(a=b,1):0;}
template<typename T>bool chmin(T &a,const T &b){return b<a?(a=b,1):0;}

template<typename T,typename C=less<>>void so(T &a,C c=C{}){sort(begin(a),end(a),c);}
template<typename T,typename C=less<>>void rso(T &a,C c=C{}){sort(rbegin(a),rend(a),c);}
template<typename T>void rev(T &a){reverse(begin(a),end(a));}

constexpr ll INF = 1e18;

int main() {
    inp(N,M);
    inpv(a,M);
    ll cur = 0;
    rep(i,M)cur+=a[i]*a[i];
    inp(Q);

    rep(i,Q){
        inp(C,K,D);
        C--;
        D--;
        cur -= a[C]*a[C];
        a[C] -= K;
        cur += a[C]*a[C];
        cur -= a[D]*a[D];
        a[D] += K;
        cur += a[D]*a[D];

        pr(cur);
    }
}