結果

問題 No.1099 Range Square Sum
コンテスト
ユーザー jupiro
提出日時 2020-06-26 22:32:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 168 ms / 2,000 ms
コード長 4,050 bytes
コンパイル時間 1,452 ms
コンパイル使用メモリ 133,188 KB
最終ジャッジ日時 2025-01-11 11:50:22
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:145:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  145 |     int n; scanf("%d", &n);
      |            ~~~~~^~~~~~~~~~
main.cpp:146:55: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  146 |     vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
      |                                                  ~~~~~^~~~~~~~~~~~~~~
main.cpp:150:19: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  150 |     int kkt; scanf("%d", &kkt);
      |              ~~~~~^~~~~~~~~~~~
main.cpp:152:21: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  152 |         int t; scanf("%d", &t);
      |                ~~~~~^~~~~~~~~~
main.cpp:154:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  154 |             ll l, r, x; scanf("%lld %lld %lld", &l, &r, &x);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:158:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  158 |             ll l, r; scanf("%lld %lld", &l, &r);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

struct P {
    ll x2, x, cnt;
    P(ll _x2, ll _x, ll _cnt) :x2(_x2), x(_x), cnt(_cnt) {}
};

P f(P a, P b) {
    return P(a.x2 + b.x2, a.x + b.x, a.cnt + b.cnt);
}

P g(P a, ll x) {
    return P(a.x2 + x * x * a.cnt + 2 * x * a.x, a.x + x * a.cnt, a.cnt);
}

ll h(ll x, ll y) {
    return x + y;
}

template< typename Monoid, typename OperatorMonoid = Monoid >
struct LazySegmentTree {

    int sz, height;
    vector< Monoid > data;
    vector< OperatorMonoid > lazy;

    const Monoid M1;
    const OperatorMonoid OM0;


    LazySegmentTree(int n,
        const Monoid& M1, const OperatorMonoid OM0)
        : M1(M1), OM0(OM0) {
        sz = 1;
        height = 0;
        while (sz < n) sz <<= 1, height++;
        data.assign(2 * sz, M1);
        lazy.assign(2 * sz, OM0);
    }

    void set(int k, const Monoid& x) {
        data[k + sz] = x;
    }

    void build() {
        for (int k = sz - 1; k > 0; k--) {
            data[k] = f(data[2 * k + 0], data[2 * k + 1]);
        }
    }

    inline void propagate(int k) {
        if (lazy[k] != OM0) {
            lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
            lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
            data[k] = reflect(k);
            lazy[k] = OM0;
        }
    }

    inline Monoid reflect(int k) {
        return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
    }

    inline void recalc(int k) {
        while (k >>= 1) data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
    }

    inline void thrust(int k) {
        for (int i = height; i > 0; i--) propagate(k >> i);
    }

    void update(int a, int b, const OperatorMonoid& x) {
        if (a >= b) return;
        thrust(a += sz);
        thrust(b += sz - 1);
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) lazy[l] = h(lazy[l], x), ++l;
            if (r & 1) --r, lazy[r] = h(lazy[r], x);
        }
        recalc(a);
        recalc(b);
    }

    Monoid query(int a, int b) {
        if (a >= b) return M1;
        thrust(a += sz);
        thrust(b += sz - 1);
        Monoid L = M1, R = M1;
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = f(L, reflect(l++));
            if (r & 1) R = f(reflect(--r), R);
        }
        return f(L, R);
    }

    Monoid operator[](const int& k) {
        return query(k, k + 1);
    }

};

int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    int n; scanf("%d", &n);
    vector<ll> a(n); for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
    LazySegmentTree<P, ll> lsg(n, P(0, 0, 0), 0);
    for (int i = 0; i < n; i++) lsg.set(i, P(a[i] * a[i], a[i], 1));
    lsg.build();
    int kkt; scanf("%d", &kkt);
    while (kkt--) {
        int t; scanf("%d", &t);
        if (t == 1) {
            ll l, r, x; scanf("%lld %lld %lld", &l, &r, &x);
            lsg.update(l - 1, r, x);
        }
        else {
            ll l, r; scanf("%lld %lld", &l, &r);
            ll res = lsg.query(l - 1, r).x2;
            printf("%lld\n", res);
        }
    }
	return 0;
}
0