struct node{
int i, j, val;
};
set<node> A;
I insert many nodes in A. Now I want to get the lower_bound for some val = k. How do I use A.lower_bound() in this case?
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
struct node{
int i, j, val;
};
set<node> A;
I insert many nodes in A. Now I want to get the lower_bound for some val = k. How do I use A.lower_bound() in this case?
Name |
---|
Auto comment: topic has been updated by rachitiitr (previous revision, new revision, compare).
You can define a custom comparator and then make queries like A.lower_bound({0,0,k}) for example.
Check this example for more clarification: http://ideone.com/xbUGBr
You have to define the comparison operator (<) if you want to be able to do lower_bound. I've always liked the
friend
feature of C++.when you use
A.lower_bound(dummy)
it will return iterator to the first node not less thandummy
so your struct should be something like this
be careful, the std::set does not has
==
operator, and it uses the<
operator to achieve the uniqueness. in other words, if you insert node a and the set wants to check a against node b to check if they are equal or not, it will do the following,if ( a < b )
=> false thenif ( b < a )
=> false, then it assume that they are equal.so if your operator does not consider some element in the struct in the < operator it might be the case that the set assume 2 elements are equal while they are not "that's why i used the 3 variables in my example for the < operator".