Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <ctime>
- #include <iomanip>
- #include <vector>
- #include <map>
- #include <algorithm>
- #include <string>
- #include <cmath>
- #include <set>
- #include <unordered_set>
- #include <unordered_map>
- #include <chrono>
- #include <stack>
- #include <cassert>
- #include <queue>
- #include <deque>
- #include <climits>
- #include <cstring>
- #include <random>
- #include <bitset>
- using namespace std;
- struct segment_tree {
- private:
- typedef long long ll;
- const ll inf = 1e18;
- int size;
- vector<ll> t;
- vector<ll> mod_add;
- vector<ll> mod_set;
- void pull(int v) {
- t[v] = t[2 * v + 1] + t[2 * v + 2];
- }
- void update_set(int v, int l, int r, ll val) {
- t[v] = (ll)(r - l) * val;
- mod_set[v] = val;
- mod_add[v] = -inf;
- }
- void update_add(int v, int l, int r, ll val) {
- t[v] += (ll)(r - l) * val;
- if (mod_add[v] == -inf) {
- mod_add[v] = val;
- } else {
- mod_add[v] += val;
- }
- }
- void push(int v, int l, int r) {
- if (mod_set[v] != -inf) {
- int m = (r + l) >> 1;
- update_set(2 * v + 1, l, m, mod_set[v]);
- update_set(2 * v + 2, m, r, mod_set[v]);
- } else if (mod_add[v] != -inf) {
- int m = (r + l) >> 1;
- update_add(2 * v + 1, l, m, mod_add[v]);
- update_add(2 * v + 2, m, r, mod_add[v]);
- mod_add[v] = -inf;
- }
- }
- void build(int v, int l, int r, const vector<int> &a) {
- mod_add[v] = -inf;
- mod_set[v] = -inf;
- if (l + 1 == r) {
- t[v] = a[l];
- } else {
- int m = (r + l) >> 1;
- build(2 * v + 1, l, m, a);
- build(2 * v + 2, m, r, a);
- pull(v);
- }
- }
- void query_add(int v, int l, int r, int ql, int qr, ll val) {
- if (qr <= l || r <= ql) {
- return;
- } else if (ql <= l && r <= qr) {
- update_add(v, l, r, val);
- } else {
- push(v, l, r);
- int m = (r + l) >> 1;
- query_add(2 * v + 1, l, m, ql, qr, val);
- query_add(2 * v + 2, m, r, ql, qr, val);
- pull(v);
- }
- }
- void query_set(int v, int l, int r, int ql, int qr, ll val) {
- cerr << l << ' ' << r << '\n';
- if (qr <= l || r <= ql) {
- return;
- } else if (ql <= l && r <= qr) {
- cerr << "UU PITUH \n";
- cerr << l << ' ' << r << ' ';
- update_set(v, l, r, val);
- cerr << t[v] << '\n';
- } else {
- push(v, l, r);
- int m = (r + l) >> 1;
- query_set(2 * v + 1, l, m, ql, qr, val);
- query_set(2 * v + 2, m, r, ql, qr, val);
- pull(v);
- }
- }
- ll query_sum(int v, int l, int r, int ql, int qr) {
- if (qr <= l || r <= ql) {
- return 0;
- } else if (ql <= l && r <= qr) {
- return t[v];
- } else {
- push(v, l, r);
- int m = (r + l) >> 1;
- auto f = query_sum(2 * v + 1, l, m, ql, qr);
- auto s = query_sum(2 * v + 2, m, r, ql, qr);
- pull(v);
- return f + s;
- }
- }
- public:
- segment_tree(const vector<int> &a) {
- size = (int)a.size();
- t.resize(4 * size);
- mod_add.resize(4 * size);
- mod_set.resize(4 * size);
- build(0, 0, size, a);
- }
- void add(int l, int r, int val) {
- query_add(0, 0, size, l, r, (ll)val);
- }
- void set(int l, int r, int val) {
- query_set(0, 0, size, l, r, (ll)val);
- }
- ll sum(int l, int r) {
- return query_sum(0, 0, size, l, r);
- }
- };
- struct arrayy {
- typedef long long ll;
- vector<ll> a;
- arrayy(const vector<int> &uu) {
- for (auto t : uu) {
- a.push_back(t);
- }
- }
- void add(int l, int r, int val) {
- for (int i = l; i < r; i++) {
- a[i] += val;
- }
- }
- void set(int l, int r, int val) {
- for (int i = l; i < r; i++) {
- a[i] = val;
- }
- }
- ll sum(int l, int r) {
- ll res = 0;
- for (int i = l; i < r; i++) {
- res += a[i];
- }
- return res;
- }
- };
- signed main() {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- #ifdef LOCAL
- assert(freopen("input.txt", "r", stdin));
- assert(freopen("output.txt", "w", stdout));
- #endif
- int n;
- cin >> n;
- vector<int> a(n);
- for (auto &t : a) {
- cin >> t;
- }
- arrayy cur(a);
- int q;
- cin >> q;
- while (q--) {
- int tp;
- cin >> tp;
- if (tp == 1) {
- //add
- int l, r, val;
- cin >> l >> r >> val;
- l--;
- cur.add(l, r, val);
- } else if (tp == 2) {
- //set
- int l, r, val;
- cin >> l >> r >> val;
- l--;
- cur.set(l, r, val);
- } else if (tp == 3) {
- //sum
- int l, r;
- cin >> l >> r;
- l--;
- auto res = cur.sum(l, r);
- cout << res << '\n';
- } else {
- assert(0);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement