fork download
copy 
  1. /* AUTHOR: TUAN ANH - BUI */
  2. // ~~ icebear ~~
  3. #include <bits/stdc++.h>
  4. using namespace std;
  5. #define int long long
  6. typedef long long ll;
  7. typedef pair<int, int> ii;
  8. typedef pair<int, ii> iii;
  9.  
  10. template<class X, class Y>
  11.     bool minimize(X &x, const Y &y) {
  12.         if (x > y) return x = y, true;
  13.         return false;
  14.     }
  15.  
  16. template<class X, class Y>
  17.     bool maximize(X &x, const Y &y) {
  18.         if (x < y) return x = y, true;
  19.         return false;
  20.     }
  21.  
  22. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  23. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  24. #define REP(i, n) for(int i=0; i<(n); ++i)
  25. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  26. #define MASK(i) (1LL << (i))
  27. #define BIT(S, i) (((S) >> (i)) & 1)
  28. #define mp make_pair
  29. #define pb push_back
  30. #define fi first
  31. #define se second
  32. #define all(x) x.begin(), x.end()
  33. #define task "icebear"
  34. /*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */
  35.  
  36. const int MOD = 1e9 + 7;
  37. const int inf = (int)1e9 + 27092008;
  38. const ll INF  = (ll)1e18 + 27092008;
  39. const int N = 2e5 + 5;
  40. int n, q, a[N];
  41.  
  42. struct SegmentTree2 {
  43.     ll node[N << 2], lazy[N << 2];
  44.  
  45.     void pushDown(int id, int l, int r) {
  46.         if (lazy[id]) {
  47.             int mid = (l + r) >> 1;
  48.             node[id << 1] += lazy[id] * (mid - l + 1);
  49.             node[id << 1 | 1] += lazy[id] * (r - mid);
  50.             lazy[id << 1] += lazy[id];
  51.             lazy[id << 1 | 1] += lazy[id];
  52.             lazy[id] = 0;
  53.         }
  54.     }
  55.  
  56.     void update(int id,int l, int r, int u, int v, int k) {
  57.         if (l > v || r < u) return;
  58.         if (u <= l && r <= v) {
  59.             node[id] += (r - l + 1) * k;
  60.             lazy[id] += k;
  61.             return;
  62.         }
  63.         pushDown(id, l, r);
  64.         int mid = (l + r) >> 1;
  65.         update(id << 1, l, mid, u, v, k);
  66.         update(id << 1 | 1, mid + 1,r, u, v, k);
  67.         node[id] = node[id << 1] + node[id << 1 | 1];
  68.     }
  69.  
  70.     ll get(int id, int l, int r, int u, int v) {
  71.         if (l > v || r < u) return 0;
  72.         if (u <= l && r <= v) return node[id];
  73.         pushDown(id, l, r);
  74.         int mid = (l + r) >> 1;
  75.         return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
  76.     }
  77. } T2;
  78.  
  79. struct SegmentTree1 {
  80.     ll node[N << 2], cnt[N << 2];
  81.  
  82.     ll pref(int i) {
  83.         return 1LL * i * (i + 1) / 2;
  84.     }
  85.  
  86.     void pushDown(int id, int l, int r) {
  87.         if (cnt[id]) {
  88.             int mid = (l + r) >> 1;
  89.             node[id << 1] += cnt[id] * (pref(mid) - pref(l - 1));
  90.             node[id << 1 | 1] += cnt[id] * (pref(r) - pref(mid));
  91.             cnt[id << 1] += cnt[id];
  92.             cnt[id << 1 | 1] += cnt[id];
  93.             cnt[id] = 0;
  94.         }
  95.     }
  96.  
  97.     void update(int id,int l, int r, int u, int v, int k) {
  98.         if (l > v || r < u) return;
  99.         if (u <= l && r <= v) {
  100.             node[id] += (pref(r) - pref(l - 1)) * k;
  101.             cnt[id] += k;
  102.             return;
  103.         }
  104.         pushDown(id, l, r);
  105.         int mid = (l + r) >> 1;
  106.         update(id << 1, l, mid, u, v, k);
  107.         update(id << 1 | 1, mid + 1,r, u, v, k);
  108.         node[id] = node[id << 1] + node[id << 1 | 1];
  109.     }
  110.  
  111.     ll get(int id, int l, int r, int u, int v) {
  112.         if (l > v || r < u) return 0;
  113.         if (u <= l && r <= v) return node[id];
  114.         pushDown(id, l, r);
  115.         int mid = (l + r) >> 1;
  116.         return get(id << 1, l, mid, u, v) + get(id << 1 | 1, mid + 1, r, u, v);
  117.     }
  118. } T1;
  119.  
  120. void init(void) {
  121.     cin >> n >> q;
  122.     FOR(i, 1, n) cin >> a[i];
  123. }
  124.  
  125. void process(void) {
  126.     FOR(i, 1, n) T2.update(1, 1, n, i, i, a[i]);
  127.     while(q--) {
  128.         int t, a, b;
  129.         cin >> t >> a >> b;
  130.         if (t == 1) {
  131.             T2.update(1, 1, n, a, b, -a + 1);
  132.             T1.update(1, 1, n, a, b, +1); // update 1 lan b[i] += i cho tat ca gia tri i trong [l...r]
  133.         } else {
  134.             cout << T1.get(1, 1, n, a, b) + T2.get(1, 1, n, a, b) << '\n';
  135.         }
  136.     }
  137. }
  138.  
  139. signed main() {
  140.     ios_base::sync_with_stdio(0);
  141.     cin.tie(0); cout.tie(0);
  142.     if (fopen(task".inp", "r")) {
  143.         freopen(task".inp", "r", stdin);
  144.         freopen(task".out", "w", stdout);
  145.     }
  146.     int tc = 1;
  147. //    cin >> tc;
  148.     while(tc--) {
  149.         init();
  150.         process();
  151.     }
  152.     return 0;
  153. }
  154.  
  155.  
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/bstZFy
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!