結果

問題 No.1099 Range Square Sum
ユーザー hitonanode
提出日時 2020-06-26 21:48:28
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 250 ms / 2,000 ms
コード長 6,804 bytes
コンパイル時間 2,352 ms
コンパイル使用メモリ 206,664 KB
最終ジャッジ日時 2025-01-11 11:13:58
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args
    ...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l
    .second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l
    .second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return
    vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os;
    }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return
    os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os;
    }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}";
    return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << "(" << pa.first << "," << pa.second << ")";
    return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v
    .second << ","; os << "}"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first <<
    "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
template <typename VAL, typename DVAL>
struct LazySegTree
{
int N;
int head;
vector<VAL> val;
vector<DVAL> dval;
VAL I_val;
DVAL I_dval;
using vv2v = function<VAL(const VAL&, const VAL&)>;
using d2d = function<void(DVAL&, const DVAL&)>;
using d2v = function<void(VAL&, const DVAL&)>;
vv2v merge_val;
d2d add_dval;
d2v refl_dval;
LazySegTree() = default;
LazySegTree(const vector<VAL> &val_init, VAL val_default, DVAL dval_default,
vv2v f, d2d dadd, d2v dreflect)
: N(val_init.size()), I_val(val_default), I_dval(dval_default),
merge_val(f),
add_dval(dadd),
refl_dval(dreflect)
{
int N_tmp = 1;
while (N_tmp < N) N_tmp <<= 1;
val = vector<VAL>(N_tmp*2, I_val);
dval = vector<DVAL>(N_tmp*2, I_dval);
head = N_tmp - 1;
for (int i=0; i<N; i++) val[head+i] = val_init[i];
for (int pos=head-1; pos>=0; pos--) val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
}
void resolve_dval(int pos, int l, int r) { // pos
refl_dval(val[pos], dval[pos]);
if (pos < head)
{
add_dval(dval[pos*2+1], dval[pos]);
add_dval(dval[pos*2+2], dval[pos]);
}
dval[pos] = I_dval;
}
void update(int begin, int end, DVAL dval_q) { update(begin, end, dval_q, 0, 0, head+1); }
void update(int begin, int end, DVAL dval_q, int pos, int l, int r)
{
//
if (begin <= l && r <= end) { // 使
add_dval(dval[pos], dval_q);
resolve_dval(pos, l, r);
}
else if (begin < r && l < end) { //
resolve_dval(pos, l, r);
update(begin, end, dval_q, pos*2+1, l, (l+r)/2);
update(begin, end, dval_q, pos*2+2, (l+r)/2, r);
val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
}
else resolve_dval(pos, l, r);
}
VAL getvalue(int begin, int end) { return getvalue(begin, end, 0, 0, head+1); }
VAL getvalue(int begin, int end, int pos, int l, int r)
{
resolve_dval(pos, l, r);
if (begin <= l && r <= end) return val[pos];
else if (begin<r && l<end) {
VAL vl = getvalue(begin, end, pos*2+1, l, (l+r)/2);
VAL vr = getvalue(begin, end, pos*2+2, (l+r)/2, r);
val[pos] = merge_val(val[pos*2+1], val[pos*2+2]);
return merge_val(vl, vr);
}
else return I_val;
}
};
struct P
{
lint s1, s2;
int sz;
P() = default;
P(lint s1, lint s2, int sz) : s1(s1), s2(s2), sz(sz) {}
};
int main()
{
int N;
cin >> N;
vector<P> v(N);
REP(i, N)
{
lint a;
cin >> a;
v[i] = P(a, a * a, 1);
}
LazySegTree<P, lint> st(
v,
P(0, 0, 0),
lint(0),
[](P a, P b) { a.s1 += b.s1, a.s2 += b.s2, a.sz += b.sz; return a; },
[](lint &a, lint b) { a += b; },
[](P &a, lint b) { a.s2 += 2 * a.s1 * b + a.sz * b * b; a.s1 += a.sz * b; });
int Q;
cin >> Q;
while (Q--)
{
int q, l, r;
cin >> q >> l >> r;
l--;
if (q == 1)
{
int x;
cin >> x;
st.update(l, r, x);
}
else
{
cout << st.getvalue(l, r).s2 << '\n';
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0