teja349's blog

By teja349, history, 4 years ago,

I have observed a fact while solving . The complexity of lower bound varies with type of iterator passed to it.

But a more weird fact is
1. the below lower bound takes O(log(n)) time
~~~~~ multiset< ll > set1; //some insert operation on multiset it=set1.lower_bound(val); ~~~~~

the question is Vasiliy's Multiset

here is my submission in which it took O(logn) when i used in above format here
2. the below lower bound works in O(n) time

multiset< ll > set1;
//some insert operation on multiset
it=lower_bound(set1.begin(),set1.end(),val);


here is my submission in which it took O(n) when i used in above format here
[cut] I dont understand why it was happening like this because both iterators here are same type.

Can someone specify places where all places lower_bound function is of O(logn) complexity

• -7

 » 4 years ago, # |   0 Auto comment: topic has been updated by teja349 (previous revision, new revision, compare).
 » 4 years ago, # | ← Rev. 2 →   +11 set::lower_bound takes advantage of knowing it's applying this operation on a set and it's properties. Ensuring logN time.While std::lower_bound only promises logN time if the iterators are random. Set iterator is a not a random one ( as far as I know, I don't mainly use C++), so that explains the time.
•  » » 4 years ago, # ^ |   0 This looks good.
 » 4 years ago, # |   0 Auto comment: topic has been updated by teja349 (previous revision, new revision, compare).
 » 4 years ago, # |   +11
•  » » 4 years ago, # ^ |   0 i think even u solved it the same way and got TLE right
 » 4 years ago, # |   +8 Method lower_bound of std::multiset class works with internal implementation, it searches for the suitable vertix in self-balanced tree. And function std::lower_bound uses usual binary search which requires random access iterators for checking element inside range using O(1) time.
 » 4 years ago, # | ← Rev. 2 →   +8 Just change it to it=set1.lower_bound(val); This is strictly O(log(n))
 » 11 months ago, # |   -46 how can I implement lower bound on vector pair in logn
•  » » 11 months ago, # ^ |   -17 I tried this,but still getting error.
•  » » 11 months ago, # ^ |   +3 I assume you mean that you have something like, vector> which is sorted by the standard comparator and you want to do a lower_bound call but only on the first coordinate. If, say, you want to get the first element that is of the form {4, x}, then you should do a lower_bound call with the value {4, INT_MIN} or whatever the corresponding minimum is. Note that this will be a different value if you are not using the standard comparator.