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

• 問題: No.1099 Range Square Sum
• ユーザー: fastmath
• 提出日時: 2020-06-26 21:55:39
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 232 ms / 2,000 ms
• コード長: 2,382 bytes
• コンパイル時間: 1,454 ms
• コンパイル使用メモリ: 168,592 KB
• 実行使用メモリ: 17,280 KB
• 最終ジャッジ日時: 2024-07-04 20:58:17
• 合計ジャッジ時間: 4,939 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
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
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int N = 2e5+7;
int sum[N << 2], sum2[N << 2], prop[N << 2];
void gap(int v, int x, int tl, int tr) {
    if (tl == 4 && tr == 4) {
        //cout << sum[v] << ' ' << sum2[v] << ' ' << x << endl;
    }   
    int len = tr - tl + 1;
    sum2[v] += x * x * len;
    sum2[v] += 2 * x * sum[v];
    sum[v] += x * len;
    prop[v] += x;
    if (tl == 4 && tr == 4) {
        //cout << "res " << sum[v] << ' ' << sum2[v] << endl;
    }   
}
void push(int v, int tl, int tr) {
    int tm = (tl + tr)>>1;
    gap(v * 2 + 1, prop[v], tl, tm);
    gap(v * 2 + 2, prop[v], tm+1, tr);
    prop[v] = 0;
}   
void relax(int v) {
    sum[v] = sum[v * 2 + 1] + sum[v * 2 + 2];
    sum2[v] = sum2[v * 2 + 1] + sum2[v * 2 + 2];
}   
void upd(int v, int tl, int tr, int l, int r, int x) {
    if (tr < l || r < tl)
        return;
    if (l <= tl && tr <= r) {
        gap(v, x, tl, tr);
        //cout << x << " : " << tl << ' ' << tr << ' ' << sum[v] << ' ' << sum2[v] << endl;
        return;
    }   
    int tm = (tl + tr) >> 1;
    push(v, tl, tr);
    upd(v * 2 + 1, tl, tm, l, r, x);
    upd(v * 2 + 2, tm + 1, tr, l, r, x);
    relax(v);
}   
int get(int v, int tl, int tr, int l, int r) {
    if (tr < l || r < tl)
        return 0;
    if (l <= tl && tr <= r) {
        //cout << tl << ' ' << tr << " : " << sum2[v] << endl;
        return sum2[v];
    }
    int tm = (tl + tr) >> 1;
    push(v, tl, tr);
    return get(v * 2 + 1, tl, tm, l, r) + get(v * 2 + 2, tm + 1, tr, l, r);    
}   
signed main() {
    #ifdef HOME
    freopen("input.txt", "r", stdin);
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    vector <int> a(n+1);
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        upd(0, 1, n, i, i, a[i]);
    }
    int q;
    cin >> q;
    while (q--) {
        int t, l, r;
        cin >> t >> l >> r;
        if (t == 2) {
            cout << get(0, 1,n, l, r) << endl;
        }   
        else {
            int x; cin >> x;
            upd(0, 1, n, l, r, x);
        }   
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX