#503407 (C++17) No.1099 Range Square Sum

• 問題: No.1099 Range Square Sum
• ユーザー: minato
• 提出日時: 2020-06-26 22:24:58
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 305 ms / 2,000 ms
• コード長: 4,442 bytes
• コンパイル時間: 3,718 ms
• コンパイル使用メモリ: 237,192 KB
• 最終ジャッジ日時: 2025-01-11 11:47:07
• ジャッジサーバーID （参考情報）: judge3 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 30

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii =  pair<int, int>;
using pll =  pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////
const int MAX = 200000;
const ll B = 450;
ll A[MAX];
ll S[(MAX+B)/B];
ll nijo[(MAX+B)/B];
ll flag[(MAX+B)/B];
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    ll N; cin >> N;
    rep(i,N) {
        cin >> A[i];
        S[i/B] += A[i];
        nijo[i/B] += A[i]*A[i];
    }
    int Q; cin >> Q;
    while (Q--) {
        int t; cin >> t;
        if (t==2) {
            ll l,r; cin >> l >> r;
            --l; --r;
            ll ans = 0;
            if (l/B==r/B) {
                if (flag[l/B] != 0) {
                    for (int i = l/B*B; i < min(l/B*B+B,N); i++) {
                        A[i] += flag[i/B];
                    }
                    flag[l/B] = 0;
                }
                for (int i = l; i <= r; i++) {
                    ans += A[i]*A[i];
                }
            } else {
                if (flag[l/B] != 0) {
                    for (int i = l/B*B; i < l/B*B+B; i++) {
                        A[i] += flag[i/B];
                    }
                    flag[l/B] = 0;
                }
                if (flag[r/B] != 0) {
                    for (int i = r/B*B; i < min(r/B*B+B,N); i++) {
                        A[i] += flag[i/B];
                    }
                    flag[r/B] = 0;
                }
                for (int i = l; i < l/B*B+B; i++) ans += A[i]*A[i];
                for (int i = l/B+1; i < r/B; i++) ans += nijo[i];
                for (int i = r/B*B; i <= r; i++) ans += A[i]*A[i];
            }
            cout << ans << ln;
        } else {
            ll l,r,x; cin >> l >> r >> x;
            --l; --r;
            if (l/B==r/B) {
                if (flag[l/B] != 0) {
                    for (int i = l/B*B; i < min(l/B*B+B,N); i++) {
                        A[i] += flag[i/B];
                    }
                    flag[l/B] = 0;
                }
                for (int i = l; i <= r; i++) {
                    S[i/B] -= A[i];
                    nijo[i/B] -= A[i]*A[i];
                    A[i] += x;
                    S[i/B] += A[i];
                    nijo[i/B] += A[i]*A[i];
                }
            } else {
                if (flag[l/B] != 0) {
                    for (int i = l/B*B; i < l/B*B+B; i++) {
                        A[i] += flag[i/B];
                    }
                    flag[l/B] = 0;
                }
                if (flag[r/B] != 0) {
                    for (int i = r/B*B; i < min(r/B*B+B,N); i++) {
                        A[i] += flag[i/B];
                    }
                    flag[r/B] = 0;
                }
                for (int i = l; i < l/B*B+B; i++) {
                    S[i/B] -= A[i];
                    nijo[i/B] -= A[i]*A[i];
                    A[i] += x;
                    S[i/B] += A[i];
                    nijo[i/B] += A[i]*A[i];
                }
                for (int i = l/B+1; i < r/B; i++) {
                    nijo[i] += x*2*S[i];
                    S[i] += B*x;
                    nijo[i] += B*x*x;
                    flag[i] += x;
                }
                for (int i = r/B*B; i <= r; i++) {
                    S[i/B] -= A[i];
                    nijo[i/B] -= A[i]*A[i];
                    A[i] += x;
                    S[i/B] += A[i];
                    nijo[i/B] += A[i]*A[i];
                }
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX