update

Author: yashsiwach

Important.txt

@@ -11,14 +11,15 @@
 11->lower_bound return the iterator of element if present and if not then its greater one!
 12-> upper_bound return the iterator of the elemen with is greatere then it;
 13->int set/map we use upper and lower bound diff as set.upper_bound(3); in vector upper_bound(v.begin(),v.end(),target);because working in vector is BS and in set its tree
+
 14->int sum=accumulate(v.begin(),v.end(),0(initial sum value)); to get sum of vector;
+
 15-> transform(s.begin(), s.end(), s.begin(), ::tolower); to make string lower ;
 sweepline adhoc 
+
 16->s.erase(unique(s.begin(), s.end()), s.end()); to remove all duplicates of string or vector;
-17->print 
-vector<pair<int, int>> e(n);
-for (auto [x, y]: e) {
- cerr << x << ' ' << y << '\n';
-}
-cerr << '\n';
-18->xor of l to r range is even number of ele then twice xor is ==0;
+
+18->xor of l to r range is even number of ele then twice xor is ==0;
+
+19->if (all_of(foo.begin(), foo.end(), [](int i){return i%2;}) )cout <<"sare odd h"<<endl;
+ else cout<<"sare odd nhi h "

segement trees/basic template minimum range ST.cpp

@@ -0,0 +1,70 @@
+class sgt{
+public:
+ vector<int>seg;
+ sgt(int n)
+ {
+ seg.resize(4*n+1);
+ }
+ void build(int i,int low,int high,vector<int>&v)
+ {
+ if(low==high){seg[i]=v[low];return;}
+ int mid=(low+high)>>1;
+ build(2*i+1,low,mid,v);
+ build(2*i+2,mid+1,high,v);
+ seg[i]=min(seg[2*i+1],seg[2*i+2]);
+ }
+ int query(int i,int low ,int high ,int l,int r)
+ {
+ if(l>high||r<low)return INT_MAX;//out of range 
+ if(l<=low&&r>=high)return seg[i];//given range(ans)
+ int mid=(low+high)>>1;
+ int left=query(2*i+1,low,mid,l,r);
+ int right=query(2*i+2,mid+1,high,l,r);
+ return min(left,right);
+ }
+ void update(int i,int low,int high,int ind,int val)
+ {
+ if(low==high){seg[i]=val;return;}
+ int mid=(low+high)>>1;
+ if(ind<=mid)update(2*i+1,low,mid,ind,val);
+ else update(2*i+2,mid+1,high,ind,val);
+ seg[i]=min(seg[2*i+1],seg[2*i+2]);
+ }
+};
+/*
+int main()
+{
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+#ifndef DISABLE_STACK_SIZE_CHANGE
+ rlimit rlim;
+ if (getrlimit(RLIMIT_STACK, &rlim) != 0) { return 1; }
+ rlim.rlim_cur = 1024 * 1024 * 1024;
+ if (setrlimit(RLIMIT_STACK, &rlim) != 0) { return 2; }
+#endif
+
+ int n;cin>>n;
+ vector<int>v(n),u(n);
+ loop(i,0,n)cin>>v[i];
+
+ sgt s1(n);
+ s1.build(0,0,n-1,v); 
+ int q;cin>>q;
+ while(q--)
+ {
+ int type;cin>>type;
+ if(type==1)
+ {
+ int a,b;cin>>a>>b;
+ cout<<s1.query(0,0,n-1,a,b)<<nl;
+ 
+ }
+ else 
+ {
+ int i,val;cin>>i>>val;
+ s1.update(0,0,n-1,i,val);
+ 
+ }
+ }
+}
+*/

segement trees/lazy propagation sum range update.cpp

@@ -0,0 +1,90 @@
+class sgt{
+public:
+ vector<int>seg,lazy;
+ sgt(int n)
+ {
+ seg.resize(4*n+1);
+ lazy.resize(4*n+1);
+ }
+ void build(int i,int low,int high,vector<int>&v)
+ {
+ if(low==high){seg[i]=v[low];return;}
+ int mid=(low+high)>>1;
+ build(2*i+1,low,mid,v);
+ build(2*i+2,mid+1,high,v);
+ seg[i]=seg[2*i+1]+seg[2*i+2];
+ }
+ int query(int i,int low,int high ,int l,int r)
+ {
+ if(lazy[i]!=0)
+ {
+ seg[i]+=(high-low+1)*lazy[i];
+ if(low!=high)
+ {
+ lazy[2*i+1]+=lazy[i];
+ lazy[2*i+2]+=lazy[i];
+ }
+ lazy[i]=0;
+ }
+ if(high<=r&&l<=low)return seg[i];
+ if(high<l||low>r)return 0;
+ int mid=(low+high)>>1;
+ int left=query(2*i+1,low,mid,l,r);
+ int right=query(2*i+2,mid+1,high,l,r);
+ return left+right;
+ }
+ void update(int i,int low ,int high,int l,int r,int val)
+ {
+ if(lazy[i]!=0)
+ {
+ seg[i]+=(high-low+1)*lazy[i];
+ if(low!=high)
+ {
+ lazy[2*i+1]+=lazy[i];
+ lazy[2*i+2]+=lazy[i];
+ }
+ lazy[i]=0;
+ }
+ if(l>high||r<low)return ;
+ if(low>=l&&high<=r)
+ {
+ seg[i]+=(high-low+1)*val;
+ if(high!=low)
+ {
+ lazy[2*i+1]+=val;
+ lazy[2*i+2]+=val;
+ }
+ return ;
+ }
+ int mid=(low+high)>>1;
+ update(2*i+1,low,mid,l,r,val);
+ update(2*i+2,mid+1,high,l,r,val);
+ seg[i]=seg[2*i+1]+seg[2*i+2];
+ }
+};
+// int main()
+// {
+ 
+// int n;cin>>n;
+// vector<int>v(n);
+// loop(i,0,n)cin>>v[i];
+// sgt s1(n);
+
+// s1.build(0,0,n-1,v);
+// int q;cin>>q;
+// while(q--)
+// {
+// int type;cin>>type;
+// if(type==1)
+// {
+// int l,r;cin>>l>>r;cout<<s1.query(0,0,n-1,l,r)<<nl;
+// }
+// else
+// {
+// int l,r,val;cin>>l>>r>>val;s1.update(0,0,n-1,l,r,val);
+// }
+// }
+// }
+
+
+//to update the given range with the val;

segement trees/sum range segment tree.cpp

@@ -0,0 +1,61 @@
+class sgt{
+public:
+ vector<int>seg;
+ sgt(int n)
+ {
+ seg.resize(4*n+1);
+ }
+ void build(int i,int low,int high,vector<int>&v)
+ {
+ if(low==high){seg[i]=v[low];return;}
+ int mid=(low+high)>>1;
+ build(2*i+1,low,mid,v);
+ build(2*i+2,mid+1,high,v);
+ seg[i]=seg[2*i+1]+seg[2*i+2];
+ }
+ int query(int i,int low ,int high ,int l,int r)
+ {
+ if(l>high||r<low)return 0;
+ if(l<=low&&r>=high)return seg[i];
+ int mid=(low+high)>>1;
+ int left=query(2*i+1,low,mid,l,r);
+ int right=query(2*i+2,mid+1,high,l,r);
+ return left+right;
+ }
+ void update(int i,int low,int high,int ind,int val)
+ {
+ if(low==high){seg[i]=val;return;}
+ int mid=(low+high)>>1;
+ if(ind<=mid)update(2*i+1,low,mid,ind,val);
+ else update(2*i+2,mid+1,high,ind,val);
+ seg[i]=seg[2*i+1]+seg[2*i+2];
+ }
+};
+/*
+int main()
+{
+ int n;cin>>n;
+ vector<int>v(n),u(n);
+ loop(i,0,n)cin>>v[i];
+
+ sgt s1(n);
+ s1.build(0,0,n-1,v); 
+ int q;cin>>q;
+ while(q--)
+ {
+ int type;cin>>type;
+ if(type==1)
+ {
+ int a,b;cin>>a>>b;
+ cout<<s1.query(0,0,n-1,a,b)<<nl;
+ 
+ }
+ else 
+ {
+ int i,val;cin>>i>>val;
+ s1.update(0,0,n-1,i,val);
+ 
+ }
+ }
+}
+*/