#503711 (C++14) No.1099 Range Square Sum

• 問題: No.1099 Range Square Sum
• ユーザー: ミドリムシ
• 提出日時: 2020-06-26 23:30:08
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 458 ms / 2,000 ms
• コード長: 5,616 bytes
• コンパイル時間: 1,964 ms
• コンパイル使用メモリ: 174,568 KB
• 実行使用メモリ: 15,616 KB
• 最終ジャッジ日時: 2024-07-05 00:17:17
• 合計ジャッジ時間: 7,948 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
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	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	4 ms; 5,376 KB
testcase_12	AC	4 ms; 5,376 KB
testcase_13	AC	5 ms; 5,376 KB
testcase_14	AC	5 ms; 5,376 KB
testcase_15	AC	5 ms; 5,376 KB
testcase_16	AC	4 ms; 5,376 KB
testcase_17	AC	4 ms; 5,376 KB
testcase_18	AC	4 ms; 5,376 KB
testcase_19	AC	4 ms; 5,376 KB
testcase_20	AC	5 ms; 5,376 KB
testcase_21	AC	451 ms; 15,616 KB
testcase_22	AC	453 ms; 15,488 KB
testcase_23	AC	455 ms; 15,488 KB
testcase_24	AC	458 ms; 15,516 KB
testcase_25	AC	453 ms; 15,488 KB
testcase_26	AC	384 ms; 15,520 KB
testcase_27	AC	408 ms; 15,488 KB
testcase_28	AC	389 ms; 15,488 KB
testcase_29	AC	386 ms; 15,600 KB
testcase_30	AC	393 ms; 15,488 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
#define SZ(x) int(x.size())
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void YES(bool condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
inline void assertNO(bool condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
inline void assertNo(bool condition){ if(!condition){ cout << "No" << endl; exit(0); } }
inline void assertm1(bool condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class T> string to_string(complex<T> x){ return to_string(make_pair(x.real(), x.imag())); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) cout << (i == start ? "" : " ") << (*i); if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int at(lint i, int j){ return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }

struct lazy_segtree{
    int sz = 1;
    vector<lint> sum, sq_sum, lazy;
    
    lazy_segtree(int n){
        while(sz < n){
            sz *= 2;
        }
        sum.resize(sz * 2, 0);
        sq_sum.resize(sz * 2, 0);
        lazy.resize(sz * 2, 0);
    }
    
    void eval(int l, int r, int now){
        sq_sum[now] += 2 * lazy[now] * sum[now] + lazy[now] * lazy[now] * (r - l);
        sum[now] += lazy[now] * (r - l);
        if(r - l > 1){
            lazy[now * 2] += lazy[now];
            lazy[now * 2 + 1] += lazy[now];
        }
        lazy[now] = 0;
    }
    
    void update(int a, int b, int l, int r, int now, lint x){
        eval(l, r, now);
        if(b <= l || r <= a){
            return;
        }
        if(a <= l && r <= b){
            lazy[now] += x;
            eval(l, r, now);
            return;
        }
        update(a, b, l, (l + r) / 2, now * 2, x);
        update(a, b, (l + r) / 2, r, now * 2 + 1, x);
        sum[now] = sum[now * 2] + sum[now * 2 + 1];
        sq_sum[now] = sq_sum[now * 2] + sq_sum[now * 2 + 1];
    }
    
    void update(int a, int b, lint x){
        return update(a, b, 0, sz, 1, x);
    }
    
    lint query(int a, int b, int l, int r, int now){
        eval(l, r, now);
        if(b <= l || r <= a){
            return 0;
        }
        if(a <= l && r <= b){
            return sq_sum[now];
        }
        return query(a, b, l, (l + r) / 2, now * 2) + query(a, b, (l + r) / 2, r, now * 2 + 1);
    }
    
    lint query(int a, int b){
        return query(a, b, 0, sz, 1);
    }
};

int main(){
    int N;
    cin >> N;
    lazy_segtree seg(N);
    rep(i, N){
        int A;
        cin >> A;
        seg.update(i, i + 1, A);
    }
    int Q;
    cin >> Q;
    rep(i, Q){
        int T;
        cin >> T;
        if(T == 1){
            int l, r, x;
            cin >> l >> r >> x;
            l--;
            seg.update(l, r, x);
        }else{
            int l, r;
            cin >> l >> r;
            l--;
            cout << seg.query(l, r) << endl;
        }
    }
}