Array and simple queries

Problem link: Array and simple queries

Topic Name: Treaps

Code:

	#include <bits/stdc++.h>
	using namespace std;
	#define INF 1<<30
	#define endl '\n'
	#define maxn 100005
	#define tc printf("Case %d: ", cs)
	#define tcn printf("Case %d:\n", cs);
	#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	typedef long long ll;
	const double PI = acos(-1.0);
	#define dbg1(x) cerr << #x << " = " << x << endl;
	#define dbg2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << endl;
	#define dbg3(x, y, z) cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << endl;
	#define dbg4(w,x, y, z) cerr << #w << " = " << w << ", " <<#x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << endl;
	template < typename F, typename S >
	ostream& operator << ( ostream& os, const pair< F, S > & p ) {
	return os << "(" << p.first << ", " << p.second << ")";
	}
	template < typename T >
	ostream &operator << ( ostream & os, const vector< T > &v ) {
	os << "{";
	for (auto it = v.begin(); it != v.end(); ++it) {
	if ( it != v.begin() ) os << ", ";
	os << *it;
	}
	return os << "}";
	}
	template < typename T >
	ostream &operator << ( ostream & os, const set< T > &v ) {
	os << "[";
	for (auto it = v.begin(); it != v.end(); ++it) {
	if ( it != v.begin()) os << ", ";
	os << *it;
	}
	return os << "]";
	}
	template < typename F, typename S >
	ostream &operator << ( ostream & os, const map< F, S > &v ) {
	os << "[";
	for (auto it = v.begin(); it != v.end(); ++it) {
	if ( it != v.begin() ) os << ", ";
	os << it -> first << " = " << it -> second ;
	}
	return os << "]";
	}
	#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
	clock_t tStart = clock();
	#define timeStamp dbg("Execution Time: ", (double)(clock() - tStart)/CLOCKS_PER_SEC)
	void faltu () { cerr << endl; }
	template <typename T>
	void faltu( T a[], int n ) {
	for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
	cerr << endl;
	}
	template <typename T, typename ... hello>
	void faltu( T arg, const hello &... rest) { cerr << arg << ' '; faltu(rest...); }
	// Program showing a policy-based data structure.
	#include <ext/pb_ds/assoc_container.hpp> // Common file
	#include <ext/pb_ds/tree_policy.hpp>
	#include <functional> // for less
	#include <iostream>
	using namespace __gnu_pbds;
	using namespace std;
	// GNU link : https://goo.gl/WVDL6g
	typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
	tree_order_statistics_node_update>
	new_data_set;
	/**___________________________________________________**/
	struct Node
	{
	int val, sz, pr;
	Node* lft;
	Node* rgt;
	Node(int _val = -1) {
	val = _val;
	sz = 1;
	pr = rand();
	lft = NULL;
	rgt = NULL;
	}
	};
	typedef Node* node;
	int Size(node tree)
	{
	if (tree) return tree->sz;
	return 0;
	}
	void update(node &tree)
	{
	if (tree)
	tree->sz = Size(tree->lft) + 1 + Size(tree->rgt);
	}
	void split(node tree , node &l , node &r , int key , int lcount) {
	if (!tree) {
	l = NULL;
	r = NULL;
	}
	else if (lcount + 1 + Size(tree->lft) <= key) {
	split(tree->rgt, tree-> rgt, r, key, lcount + 1 + Size(tree->lft));
	l = tree;
	}
	else {
	split(tree -> lft , l , tree -> lft , key , lcount);
	r = tree;
	}
	update(tree);
	}
	void merge(node &tree, node l, node r)
	{
	if (!l || !r) {
	tree = l ? l : r;
	}
	else if (l->pr > r-> pr) {
	merge(l -> rgt, l-> rgt, r);
	tree = l;
	}
	else {
	merge(r-> lft, l, r->lft);
	tree = r;
	}
	update(tree);
	}
	int getmin(node tree)
	{
	if (tree-> lft) return getmin(tree-> lft);
	return tree -> val;
	}
	int getmax(node tree)
	{
	if (tree -> rgt) {
	return getmax(tree -> rgt);
	}
	return tree -> val;
	}
	void Inorder(node tree)
	{
	if (tree) {
	Inorder(tree-> lft);
	cout << tree -> val << " ";
	Inorder(tree-> rgt);
	}
	}
	Node* root = NULL;
	void Insert(int val)
	{
	merge(root, root, new Node(val));
	}
	void query1(int l, int r)
	{
	Node* tmp1 = NULL;
	Node* tmp2 = NULL;
	Node* tmp3 = NULL;
	Node* tmp4 = NULL;
	split(root, tmp1, tmp2, r, 0);
	split(tmp1, tmp3, tmp4, l - 1, 0);
	merge(root, tmp3, tmp2);
	merge(root, root, tmp4);
	}
	void query2(int l, int r)
	{
	Node* tmp1 = NULL;
	Node* tmp2 = NULL;
	Node* tmp3 = NULL;
	Node* tmp4 = NULL;
	split(root, tmp1, tmp2, r, 0);
	split(tmp1, tmp3, tmp4, l - 1, 0);
	merge(root, tmp3, tmp2);
	merge(root, tmp4, root);
	}
	int main()
	{
	FASTIO
	///*
	#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	freopen("error.txt", "w", stderr);
	#endif
	//*/
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
	int x;
	cin >> x;
	Insert(x);
	}
	while (m--) {
	int tp;
	int l, r;
	cin >> tp >> l >> r;
	if (tp & 1) {
	query2(l, r);
	}
	else {
	query1(l, r);
	}
	}
	cout << abs(getmax(root) - getmin(root)) << endl;
	Inorder(root);
	}

view raw Array and simple queries.cpp hosted with ❤ by GitHub

Share: