Merge pull request #4121 from brebenelmihnea/Horrible-Queries

Horrible Queries Code

Author: ryanchou-dev

content/5_Plat/RURQ.mdx

@@ -1,7 +1,7 @@
 ---
 id: RURQ
 title: 'Range Update Range Query'
-author: Benjamin Qi
+author: Benjamin Qi, Mihnea Brebenel
 prerequisites:
   - PURS
 description:
@@ -37,15 +37,77 @@ queries.
 
 ### Implementation
 
-<Resources>
-	<Resource
-		source="Benq"
-		title="BITrange"
-		url="https://github.com/bqi343/USACO/blob/master/Implementations/content/data-structures/1D%20Range%20Queries%20(9.2)/BITrange.h"
-	/>
-</Resources>
+<LanguageSection>
+<CPPSection>
+
+```cpp
+#include <bits/stdc++.h>
+using namespace std;
+
+// BeginCodeSnip{BIT Code (from PURS module)}
+template <class T> class BIT {
+  private:
+	int size;
+	vector<T> bit;
+	vector<T> arr;
+
+  public:
+	BIT(int size) : size(size), bit(size + 1), arr(size) {}
+
+	void set(int ind, T val) { add(ind, val - arr[ind]); }
+
+	void add(int ind, T val) {
+		arr[ind] += val;
+		ind++;
+		for (; ind <= size; ind += ind & -ind) { bit[ind] += val; }
+	}
+
+	T pref_sum(int ind) {
+		ind++;
+		T total = 0;
+		for (; ind > 0; ind -= ind & -ind) { total += bit[ind]; }
+		return total;
+	}
+};
+// EndCodeSnip
+
+int main() {
+	int test_num;
+	cin >> test_num;
+	for (int t = 0; t < test_num; t++) {
+		int n, q;
+		cin >> n >> q;
+
+		BIT<long long> bit_values(n), bit_count(n);
+		for (int i = 0; i < q; i++) {
+			int type;
+			cin >> type;
+
+			if (type == 0) {
+				int p, q, val;
+				cin >> p >> q >> val;
+
+				// Update the 2 BITs
+				bit_values.add(p - 1, val);
+				bit_count.add(p - 1, val * (p - 1));
+				bit_values.add(q, -val);
+				bit_count.add(q, -val * q);
+			} else {
+				int p, q;
+				cin >> p >> q;
+				cout << 1LL * bit_values.pref_sum(q) * q -
+				            bit_count.pref_sum(q) -
+				            (1LL * bit_values.pref_sum(p - 1) * (p - 1) -
+				             bit_count.pref_sum(p - 1))
+				     << '\n';
+			}
+		}
+	}
+}
+```
 
-<IncompleteSection />
+</CPPSection>
+</LanguageSection>
 
 ### Problems