This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub beet-aizu/library
#ifndef call_from_test #include<bits/stdc++.h> using namespace std; #endif //BEGIN CUT HERE #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #include<ext/pb_ds/tag_and_trait.hpp> using namespace __gnu_pbds; template <typename T> using gtree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // usage: // find_by_order(int k): // return the iterator of k-th smallest element (0-indexed) // order_of_key(T key): return the index of key in tree //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif
#line 1 "bbst/pb_ds_tree.cpp" #include<bits/stdc++.h> using namespace std; #endif //BEGIN CUT HERE #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> #include<ext/pb_ds/tag_and_trait.hpp> using namespace __gnu_pbds; template <typename T> using gtree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; // usage: // find_by_order(int k): // return the iterator of k-th smallest element (0-indexed) // order_of_key(T key): return the index of key in tree //END CUT HERE #ifndef call_from_test signed main(){ return 0; } #endif