Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- #include <iomanip>
- #include <queue>
- #include <cmath>
- #include <algorithm>
- #include <tuple>
- #include <iomanip>
- #include <stdio.h>
- #include <numeric>
- #include <map>
- #include <bitset>
- #include <set>
- #include <stack>
- #include <queue>
- #include <unordered_set>
- //#pragma GCC optimize("Ofast,no-stack-protector")
- #pragma GCC optimize("O3")
- //#pragma GCC target("avx2")
- //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
- #pragma GCC optimize("unroll-loops")
- //#pragma GCC optimize("fast-math")
- //#pragma GCC optimize("section-anchors")
- //#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
- //#pragma GCC optimize("vpt")
- //#pragma GCC optimize("rename-registers")
- //#pragma GCC optimize("move-loop-invariants")
- //#pragma GCC optimize("unswitch-loops")
- //#pragma GCC optimize("function-sections")
- //#pragma GCC optimize("data-sections")
- //#pragma GCC optimize("branch-target-load-optimize")
- //#pragma GCC optimize("branch-target-load-optimize2")
- //#pragma GCC optimize("btr-bb-exclusive")
- //#pragma GCC optimize("O0")
- //#define int long long
- #define ll long long
- #define ull unsigned long long
- #define all(a) a.begin(), a.end()
- #define pii pair<int, int>
- #define pb push_back
- #define ld long double
- using namespace std;
- //const int INF = 1e17;
- //const int mod = 2600000069;
- //const int p = 179;
- //int n;
- //vector<vector<int>> t, mod;
- //void push(int ind, int v) {
- // if (mod[ind][v] != -1) {
- // mod[ind][2 * v + 1] = mod[ind][v];
- // mod[ind][2 * v + 2] = mod[ind][v];
- // mod[ind][v] = -1;
- // }
- //}
- //void cur(int ind, int v, int s) {
- // t[ind][v] = (mod[ind][2 * v + 1] == -1 ? t[ind][2 * v + 1] : mod[ind][2 * v + 1] * s) + (mod[ind][2 * v + 2] == -1 ? t[ind][2 * v + 2] : mod[ind][2 * v + 2] * s);
- //}
- //void update(int ind, int v, int l, int r, int askl, int askr, int val) {
- // if (l >= askr || r <= askl) return;
- // if (l >= askl && r <= askr) {
- // mod[ind][v] = val;
- // return;
- // }
- // push(ind, v);
- // int m = (l + r) / 2;
- // update(ind, 2 * v + 1, l, m, askl, askr, val);
- // update(ind, 2 * v + 2, m, r, askl, askr, val);
- // cur(ind, v, m - l);
- //}
- //int get_sum(int ind, int v, int l, int r, int askl, int askr) {
- // if (l >= askr || r <= askl) return 0;
- // if (l >= askl && r <= askr) return (mod[ind][v] == -1 ? t[ind][v] : mod[ind][v] * (r - l));
- // push(ind, v);
- // int m = (l + r) / 2;
- // int first = get_sum(ind, 2 * v + 1, l, m, askl, askr), second = get_sum(ind, 2 * v + 2, m, r, askl, askr);
- // cur(ind, v, m - l);
- // return first + second;
- //}
- int n;
- vector<int> t, mod;
- void push(int v) {
- if (mod[v] != -1) {
- mod[2 * v + 1] = mod[v];
- mod[2 * v + 2] = mod[v];
- mod[v] = -1;
- }
- }
- void node(int v, int s) {
- t[v] = (mod[2 * v + 1] == -1 ? t[2 * v + 1] : mod[2 * v + 1] * s) + (mod[2 * v + 2] == -1 ? t[2 * v + 2] : mod[2 * v + 2] * s);
- }
- void update(int v, int l, int r, int askl, int askr, int val) {
- if (l >= askr || r <= askl) return;
- if (l >= askl && r <= askr) {
- mod[v] = val;
- return;
- }
- push(v);
- int m = (l + r) / 2;
- update(2 * v + 1, l, m, askl, askr, val);
- update(2 * v + 2, m, r, askl, askr, val);
- node(v, m - l);
- }
- int get_ans(int v, int l, int r, int askl, int askr) {
- if (l >= askr || r <= askl) return 0;
- if (l >= askl && r <= askr) return (mod[v] == -1 ? t[v] : mod[v] * (r - l));
- push(v);
- int m = (l + r) / 2;
- int first = get_ans(2 * v + 1, l, m, askl, askr), second = get_ans(2 * v + 2, m, r, askl, askr);
- node(v, m - l);
- return first + second;
- }
- signed main() {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- // cin >> n;
- // t.resize(26, vector<int>(4 * n));
- // mod.assign(26, vector<int>(4 * n, -1));
- freopen("sum.in", "r", stdin);
- freopen("sum.out", "w", stdout);
- cin >> n;
- int q;
- cin >> q;
- t.resize(4 * n, 0);
- mod.assign(4 * n, -1);
- char type;
- int l, r, val;
- while(q--) {
- cin >> type >> l >> r;
- l--;
- if (type == 'A') {
- cin >> val;
- update(0, 0, n, l, r, val);
- } else {
- cout << get_ans(0, 0, n, l, r) << "\n";
- }
- }
- }
- /*
- 4 4
- 3 4 4 3
- 4 1 2 3
- 3 4 5 3
- 3 1 4 4
- -> 3
- 4 5
- 2 2 2 2 2
- 2 1 1 2 2
- 2 2 2 1 1
- 2 2 2 2 2
- -> 2
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement