cpp_src/data_structure/PBDS.hpp

• View this file on GitHub
• Last update: 2022-01-02 16:22:57+09:00
• Include: #include "cpp_src/data_structure/PBDS.hpp"
• Link: http://hogloid.hatenablog.com/entry/2014/09/23/132440
• Link: https://atcoder.jp/contests/arc033/submissions/12068324
• Link: https://xuzijian629.hatenablog.com/entry/2018/12/01/000010

Code

// example : https://atcoder.jp/contests/arc033/submissions/12068324
// see:
// https://xuzijian629.hatenablog.com/entry/2018/12/01/000010
// http://hogloid.hatenablog.com/entry/2014/09/23/132440

// only normal set, use pair for duplication

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
template <class T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// kth (0-indexed) element : find_by_order(k)
// position of x order_of_key(x)

// other : gp_hash_table

#line 1 "cpp_src/data_structure/PBDS.hpp"
// example : https://atcoder.jp/contests/arc033/submissions/12068324
// see:
// https://xuzijian629.hatenablog.com/entry/2018/12/01/000010
// http://hogloid.hatenablog.com/entry/2014/09/23/132440

// only normal set, use pair for duplication

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
template <class T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// kth (0-indexed) element : find_by_order(k)
// position of x order_of_key(x)

// other : gp_hash_table

Back to top page