結果
問題 | No.1099 Range Square Sum |
ユーザー |
![]() |
提出日時 | 2020-05-17 12:45:46 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 374 ms / 2,000 ms |
コード長 | 2,138 bytes |
コンパイル時間 | 1,990 ms |
コンパイル使用メモリ | 172,492 KB |
実行使用メモリ | 17,152 KB |
最終ジャッジ日時 | 2024-11-22 16:37:37 |
合計ジャッジ時間 | 7,008 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>using namespace std;struct range_add_range_sqsum{int N;vector<long long> ST1; //sumvector<long long> ST2; //sqsumvector<long long> lazy;range_add_range_sqsum(vector<long long> &A){int n = A.size();N = 1;while (N < n){N *= 2;}ST1 = vector<long long>(N * 2 - 1, 0);ST2 = vector<long long>(N * 2 - 1, 0);lazy = vector<long long>(N * 2 - 1, 0);for (int i = 0; i < n; i++){ST1[N - 1 + i] = A[i];ST2[N - 1 + i] = A[i] * A[i];}for (int i = N - 2; i >= 0; i--){ST1[i] = ST1[i * 2 + 1] + ST1[i * 2 + 2];ST2[i] = ST2[i * 2 + 1] + ST2[i * 2 + 2];}}void eval(int i, int l, int r){if (i < N - 1){lazy[i * 2 + 1] += lazy[i];lazy[i * 2 + 2] += lazy[i];}ST2[i] = ST2[i] + lazy[i] * ST1[i] * 2 + lazy[i] * lazy[i] * (r - l);ST1[i] = ST1[i] + lazy[i] * (r - l);lazy[i] = 0;}void range_add(int L, int R, int x, int i, int l, int r){eval(i, l, r);if (R <= l || r <= L){return;} else if (L <= l && r <= R){lazy[i] += x;eval(i, l, r);} else {int m = (l + r) / 2;range_add(L, R, x, i * 2 + 1, l, m);range_add(L, R, x, i * 2 + 2, m, r);ST1[i] = ST1[i * 2 + 1] + ST1[i * 2 + 2];ST2[i] = ST2[i * 2 + 1] + ST2[i * 2 + 2];}}void range_add(int L, int R, int x){range_add(L, R, x, 0, 0, N);}long long range_sqsum(int L, int R, int i, int l, int r){eval(i, l, r);if (R <= l || r <= L){return 0;} else if (L <= l && r <= R){return ST2[i];} else {int m = (l + r) / 2;return range_sqsum(L, R, i * 2 + 1, l, m) + range_sqsum(L, R, i * 2 + 2, m, r);}}long long range_sqsum(int L, int R){return range_sqsum(L, R, 0, 0, N);}};int main(){int N;cin >> N;vector<long long> A(N);for (int i = 0; i < N; i++){cin >> A[i];}range_add_range_sqsum a(A);int Q;cin >> Q;for (int i = 0; i < Q; i++){int t;cin >> t;if (t == 1){int l, r, x;cin >> l >> r >> x;a.range_add(l - 1, r, x);}if (t == 2){int l, r;cin >> l >> r;cout << a.range_sqsum(l - 1, r) << endl;}}}