結果
問題 | No.1099 Range Square Sum |
ユーザー |
![]() |
提出日時 | 2020-06-26 21:49:46 |
言語 | C++11 (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 252 ms / 2,000 ms |
コード長 | 2,864 bytes |
コンパイル時間 | 798 ms |
コンパイル使用メモリ | 84,992 KB |
実行使用メモリ | 17,152 KB |
最終ジャッジ日時 | 2024-07-04 20:39:55 |
合計ジャッジ時間 | 4,933 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include <iostream>#include <cstdio>#include <cmath>#include <ctime>#include <cstdlib>#include <cassert>#include <vector>#include <list>#include <stack>#include <queue>#include <deque>#include <map>#include <set>#include <bitset>#include <string>#include <algorithm>#include <utility>#define llint long long#define inf 1e18#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)#define chmin(x, y) (x) = min((x), (y))#define chmax(x, y) (x) = max((x), (y))using namespace std;typedef pair<llint, llint> P;// range-add, range-min querystruct LazySegTree{int size;vector<llint> seg, seg2, delay;LazySegTree(){}LazySegTree(int size){this->size = size;seg.resize(1<<(size+1));seg2.resize(1<<(size+1));delay.resize(1<<(size+1));}void init(){for(int i = 0; i < (1<<(size+1)); i++){seg[i] = 0, seg2[i] = 0;delay[i] = 0;}}void eval(int l, int r, int k){if(delay[k]){seg2[k] += 2*seg[k]*delay[k] + (r-l+1)*delay[k]*delay[k];seg[k] += delay[k] * (r-l+1); //総和クエリのときは区間幅を乗じる必要があるif(l < r){delay[k*2] += delay[k];delay[k*2+1] += delay[k];}delay[k] = 0;}}void update(int i, llint val){int l = 0, r = (1<<size)-1, k = 1;eval(l, r, k);for(int j = size-1; j >= 0; j--){k <<= 1;if(i & (1<<j)){k++;r = (l+r)/2;}else l = (l+r)/2+1;eval(l, r, k);}i += (1 << size);seg[i] = val, seg2[i] = val*val;while(i > 1){i /= 2;seg[i] = seg[i*2] + seg[i*2+1];seg2[i] = seg2[i*2] + seg2[i*2+1];}}void add(int a, int b, int k, int l, int r, llint val){eval(l, r, k);if(b < l || r < a) return;if(a <= l && r <= b){delay[k] += val;eval(l, r, k);return;}add(a, b, k*2, l, (l+r)/2, val);add(a, b, k*2+1, (l+r)/2+1, r, val);seg[k] = seg[k*2] +seg[k*2+1];seg2[k] = seg2[k*2] +seg2[k*2+1];}void add(int a, int b, llint val){if(a > b) return;add(a, b, 1, 0, (1<<size)-1, val);}llint query(int a, int b, int k, int l, int r){eval(l, r, k);if(b < l || r < a) return 0;if(a <= l && r <= b) return seg2[k];llint lval = query(a, b, k*2, l, (l+r)/2);llint rval = query(a, b, k*2+1, (l+r)/2+1, r);return (lval + rval);}llint query(int a, int b){return query(a, b, 1, 0, (1<<size)-1);}};llint n, Q;llint a[200005];LazySegTree seg(18);int main(void){ios::sync_with_stdio(0);cin.tie(0);cin >> n;for(int i = 1; i <= n; i++) cin >> a[i];seg.init();for(int i = 1; i <= n; i++) seg.update(i, a[i]);cin >> Q;llint t, l, r, x;for(int i = 1; i <= Q; i++){cin >> t >> l >> r;if(t == 1){cin >> x;seg.add(l, r, x);}else{cout << seg.query(l, r) << endl;}}return 0;}