Create seg_ordered_set_tree.cpp

1 files changed, 25 insertions, 0 deletions

diff --git a/Data Structures/seg_ordered_set_tree.cpp b/Data Structures/seg_ordered_set_tree.cpp
new file mode 100644
index 0000000..b1d9005
--- /dev/null
+++ b/Data Structures/seg_ordered_set_tree.cpp
@@ -0,0 +1,25 @@
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+using namespace std;
+using namespace __gnu_pbds;
+template<typename T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
+constexpr int MAXN = 100001;
+
+ordered_set<int> S[4 * MAXN];
+
+void update(int x, int y, int l = 0, int r = MAXN, int n = 1) {
+	if (l != r) {
+		int m = (l + r) >> 1;
+		x <= m ? update(x, y, l, m, n << 1) : update(x, y, m + 1, r, n << 1 | 1);
+	}
+	S[n].insert(y);
+}
+
+int query(int xl, int xr, int yl, int yr, int l = 0, int r = MAXN, int n = 1) {
+	if (l > r || l > xr || r < xl) return 0;
+	if (l >= xl && r <= xr) return S[n].order_of_key(yr + 1) - S[n].order_of_key(yl);
+	else {
+		int m = (l + r) >> 1;
+		return query(xl, xr, yl, yr, l, m, n << 1) + query(xl, xr, yl, yr, m + 1, r, n << 1 | 1);
+	}
+}
\ No newline at end of file