結果

問題 No.1099 Range Square Sum
ユーザー ThistleThistle
提出日時 2020-06-26 23:04:08
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,174 bytes
コンパイル時間 1,978 ms
コンパイル使用メモリ 129,540 KB
実行使用メモリ 23,608 KB
最終ジャッジ日時 2023-09-18 07:15:36
合計ジャッジ時間 6,977 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 5 ms
11,488 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 5 ms
11,444 KB
testcase_05 WA -
testcase_06 AC 5 ms
11,732 KB
testcase_07 WA -
testcase_08 AC 5 ms
11,436 KB
testcase_09 AC 5 ms
11,488 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-(b).begin()
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
#define found(a,x) (a.find(x)!=a.end())
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
bool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
    int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
    return sum;
}
class mint {
public:ll v;
      mint(ll v = 0) { s(v % mod + mod); }
      constexpr static int mod = 1e9 + 7;
      constexpr static int fn_ = 2e5 + 5;
      static mint fact[fn_], comp[fn_];
      mint pow(int x) const {
          mint b(v), c(1);
          while (x) {
              if (x & 1) c *= b;
              b *= b;
              x >>= 1;
          }
          return c;
      }
      inline mint& s(int vv) {
          v = vv < mod ? vv : vv - mod;
          return *this;
      }
      inline mint inv()const { return pow(mod - 2); }
      inline mint operator-()const { return mint() - *this; }
      inline mint& operator+=(const mint b) { return s(v + b.v); }
      inline mint& operator-=(const mint b) { return s(v + mod - b.v); }
      inline mint& operator*=(const mint b) { v = v * b.v % mod; return *this; }
      inline mint& operator/=(const mint b) { v = v * b.inv().v % mod; return *this; }
      inline mint operator+(const mint b) const { return mint(v) += b; }
      inline mint operator-(const mint b) const { return mint(v) -= b; }
      inline mint operator*(const mint b) const { return mint(v) *= b; }
      inline mint operator/(const mint b) const { return mint(v) /= b; }
      friend ostream& operator<<(ostream& os, const mint& m) {
          return os << m.v;
      }
      friend istream& operator>>(istream& is, mint& m) {
          int x; is >> x; m = mint(x);
          return is;
      }
      bool operator<(const mint& r)const { return v < r.v; }
      bool operator>(const mint& r)const { return v > r.v; }
      bool operator<=(const mint& r)const { return v <= r.v; }
      bool operator>=(const mint& r)const { return v >= r.v; }
      bool operator==(const mint& r)const { return v == r.v; }
      bool operator!=(const mint& r)const { return v != r.v; }
      explicit operator bool()const { return v; }
      explicit operator int()const { return v; }
      mint comb(mint k) {
          if (k > * this) return mint();
          if (!fact[0]) combinit();
          if (v >= fn_) {
              if (k > * this - k) k = *this - k;
              mint tmp(1);
              for (int i = v; i >= v - k.v + 1; i--) tmp *= mint(i);
              return tmp * comp[k.v];
          }
          else return fact[v] * comp[k.v] * comp[v - k.v];
      }//nCk
      static void combinit() {
          fact[0] = 1;
          for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * mint(i);
          comp[fn_ - 1] = fact[fn_ - 1].inv();
          for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * mint(i + 1);
      }
}; mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------


//---------------------------------------------------------------------


int n, q;
int a[200000];

int m;
H dat[500000];
H dat2[500000];


void init(int i, int x) {
    i += m - 1;
    dat[i].fs = x * x;
    dat2[i].fs += x;
    while (i > 0) {
        i = (i - 1) / 2;
        dat[i].fs = dat[i * 2 + 1].fs + dat[i * 2 + 2].fs;
        dat2[i].fs = dat2[i * 2 + 1].fs + dat2[i * 2 + 2].fs;
    }
}

void eval(int i, int l, int r) {
    if (r - l > 1) {
        dat[i * 2 + 1].sc += dat[i].sc;
        dat[i * 2 + 2].sc += dat[i].sc;
        dat2[i * 2 + 1].sc += dat[i].sc;
        dat2[i * 2 + 2].sc += dat[i].sc;
    }
    dat[i].fs += 2 * dat2[i].fs * dat[i].sc;
    dat[i].fs += dat[i].sc * dat[i].sc * (min(r, n) - l);

    dat[i].sc = 0;

    dat2[i].fs += dat2[i].sc;
    dat2[i].sc = 0;
}

void update(int i, int a, int b, int l, int r, int x) {
    eval(i, l, r);
    if (b <= l || r <= a) return;
    if (a <= l && r <= b) {
        dat[i].sc += x;
        dat2[i].sc += x;
        eval(i, l, r);
        return;
    }
    update(i * 2 + 1, a, b, l, (l + r) / 2, x);
    update(i * 2 + 2, a, b, (l + r) / 2, r, x);
    dat[i].fs = dat[i * 2 + 1].fs + dat[i * 2 + 2].fs;
    dat2[i].fs = dat2[i * 2 + 1].fs + dat2[i * 2 + 2].fs;
}

int query(int i, int a, int b, int l, int r) {
    eval(i, l, r);
    if (b <= l || r <= a) return 0;
    if (a <= l && r <= b) {
        return dat[i].fs;
    }
    return query(i * 2 + 1, a, b, l, (l + r) / 2) + query(i * 2 + 2, a, b, (l + r) / 2, r);
}

signed main() {
    cin >> n;

    m = 1;
    while (m < n) m *= 2;

    rep(i, n) {
        cin >> a[i];
        init(i, a[i]);
    }


    cin >> q;

    rep(i, q) {
        if (read() == 1) {
            int l, r, x; cin >> l >> r >> x;
            l--;
            update(0, l, r, 0, m, x);
        }
        else {
            int l, r; cin >> l >> r;
            l--;
            cout << query(0,l,r, 0, m) << endl;
        }
    }
}
0