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

• 問題: No.1099 Range Square Sum
• ユーザー: SSRS
• 提出日時: 2020-05-19 00:40:11
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 335 ms / 2,000 ms
• コード長: 2,229 bytes
• コンパイル時間: 1,576 ms
• コンパイル使用メモリ: 173,260 KB
• 実行使用メモリ: 21,248 KB
• 最終ジャッジ日時: 2024-11-22 16:38:06
• 合計ジャッジ時間: 6,243 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	1 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	4 ms; 5,248 KB
testcase_12	AC	4 ms; 5,248 KB
testcase_13	AC	4 ms; 5,248 KB
testcase_14	AC	3 ms; 5,248 KB
testcase_15	AC	4 ms; 5,248 KB
testcase_16	AC	4 ms; 5,248 KB
testcase_17	AC	4 ms; 5,248 KB
testcase_18	AC	3 ms; 5,248 KB
testcase_19	AC	4 ms; 5,248 KB
testcase_20	AC	4 ms; 5,248 KB
testcase_21	AC	335 ms; 21,120 KB
testcase_22	AC	333 ms; 21,248 KB
testcase_23	AC	332 ms; 21,248 KB
testcase_24	AC	333 ms; 21,120 KB
testcase_25	AC	331 ms; 21,120 KB
testcase_26	AC	283 ms; 21,120 KB
testcase_27	AC	281 ms; 21,120 KB
testcase_28	AC	290 ms; 21,120 KB
testcase_29	AC	287 ms; 21,120 KB
testcase_30	AC	286 ms; 21,248 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
struct lazy_segment_tree{
	int N;
	vector<long long> count;
	vector<long long> sum;
	vector<long long> sqsum;
	vector<long long> lazy;
	lazy_segment_tree(vector<long long> &A){
		int n = A.size();
		N = 1;
		while (N < n){
			N *= 2;
		}
		count = vector<long long>(N * 2 - 1, 1);
		sum = vector<long long>(N * 2 - 1, 0);
		sqsum = vector<long long>(N * 2 - 1, 0);
		lazy = vector<long long>(N * 2 - 1, 0);
		for (int i = 0; i < n; i++){
			sum[N - 1 + i] = A[i];
			sqsum[N - 1 + i] = A[i] * A[i];
		}
		for (int i = N - 2; i >= 0; i--){
			count[i] = count[i * 2 + 1] + count[i * 2 + 2];
			sum[i] = sum[i * 2 + 1] + sum[i * 2 + 2];
			sqsum[i] = sqsum[i * 2 + 1] + sqsum[i * 2 + 2];
		}
	}
	void eval(int i){
		if (i < N - 1){
			lazy[i * 2 + 1] += lazy[i];
			lazy[i * 2 + 2] += lazy[i];
		}
		sqsum[i] = sqsum[i] + 2 * sum[i] * lazy[i] + count[i] * lazy[i] * lazy[i];
		sum[i] = sum[i] + count[i] * lazy[i];
		lazy[i] = 0;
	}
	void range_add(int L, int R, int x, int i, int l, int r){
		eval(i);
		if (R <= l || r <= L){
			return;
		} else if (L <= l && r <= R){
			lazy[i] += x;
			eval(i);
		} 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);
			sum[i] = sum[i * 2 + 1] + sum[i * 2 + 2];
			sqsum[i] = sqsum[i * 2 + 1] + sqsum[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);
		if (R <= l || r <= L){
			return 0;
		} else if (L <= l && r <= R){
			return sqsum[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];
  }
  lazy_segment_tree ST(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;
      ST.range_add(l - 1, r, x);
    }
    if (t == 2){
      int l, r;
      cin >> l >> r;
      cout << ST.range_sqsum(l - 1, r) << endl;
    }
  }
}