misc/macros.h

• View this file on GitHub
• Last update: 2025-11-28 02:09:51+07:00

Verified with

• tests/2_Sat.test.cpp
• tests/Assignment_Problem.test.cpp
• tests/Bell_Number.test.cpp
• tests/Bernoulli_Number.test.cpp
• tests/Biconnected_Components.test.cpp
• tests/Bipartite_Matching_Dinic.test.cpp
• tests/Bipartite_Matching_HopcroftKarp.test.cpp
• tests/Bitwise_And_Convolution.test.cpp
• tests/Bitwise_Subset_Convolution.test.cpp
• tests/Bitwise_Xor_Convolution.test.cpp
• tests/Closest_Pair_of_Points.test.cpp
• tests/Convolution.test.cpp
• tests/Count_Points_in_Triangle.test.cpp
• tests/Counting_Primes.test.cpp
• tests/Deque.test.cpp
• tests/Deque_Operate_All_Composite.test.cpp
• tests/Derangement.test.cpp
• tests/Discrete_Logarithm.test.cpp
• tests/Dominator_Tree.test.cpp
• tests/Enumerate_Cliques.test.cpp
• tests/Enumerate_Quotients.test.cpp
• tests/Enumerate_Triangles.test.cpp
• tests/Eulerian_Trail_Directed.test.cpp
• tests/Eulerian_Trail_Undirected.test.cpp
• tests/Exp_of_FPS.test.cpp
• tests/Factorize.test.cpp
• tests/Find_Linear_Recurrence.test.cpp
• tests/Furthest_Pair_of_Points.test.cpp
• tests/GCD_Convolution.test.cpp
• tests/General_Matching.test.cpp
• tests/Inv_of_FPS.test.cpp
• tests/LCA.test.cpp
• tests/LCM_Convolution.test.cpp
• tests/LIS.test.cpp
• tests/Line_Add_Get_Min.test.cpp
• tests/Longest_Common_Substring.test.cpp
• tests/Matrix_Det.test.cpp
• tests/Matrix_Inv.test.cpp
• tests/Matrix_Product.test.cpp
• tests/Matrix_Solve_Linear.test.cpp
• tests/Maximum_Independent_Set.test.cpp
• tests/Min_of_Mod_of_Linear.test.cpp
• tests/Minimum_Enclosing_Circle.test.cpp
• tests/Number_of_Subsequences.test.cpp
• tests/Number_of_Substrings.test.cpp
• tests/Partition_Function.test.cpp
• tests/Persistent_Unionfind.test.cpp
• tests/Point_Add_Range_Sum.test.cpp
• tests/Point_Set_Range_Composite.test.cpp
• tests/Point_Set_Range_Composite_Large.test.cpp
• tests/Pow_of_FPS.test.cpp
• tests/Pow_of_Matrix.test.cpp
• tests/Primality_Test.test.cpp
• tests/Primitive_Root.test.cpp
• tests/Product_of_Polynomial_Sequence.test.cpp
• tests/Range_Affine_Point_Get.test.cpp
• tests/Range_Affine_Range_Sum.test.cpp
• tests/Rational_Approximation.test.cpp
• tests/Run_Enumerate.test.cpp
• tests/SCC.test.cpp
• tests/Sort_Points_by_Argument.test.cpp
• tests/Sqrt_Mod.test.cpp
• tests/Static_Convex_Hull.test.cpp
• tests/Static_RMQ.test.cpp
• tests/Stern_Brocot.test.cpp
• tests/Stirling_Number_1st.test.cpp
• tests/Stirling_Number_1st_fixed_K.test.cpp
• tests/Stirling_Number_2nd.test.cpp
• tests/Stirling_Number_2nd_fixed_K.test.cpp
• tests/Suffix_Array.test.cpp
• tests/Sum_of_Exponential_times_Polynomial.test.cpp
• tests/Sum_of_Exponential_times_Polynomial_limit.test.cpp
• tests/Sum_of_Floor_of_Linear.test.cpp
• tests/Sum_of_Multiplicative_Function.test.cpp
• tests/Two_Edges_CC.test.cpp
• tests/Unionfind.test.cpp
• tests/Vertex_Add_Path_Sum.test.cpp
• tests/Z_Algorithm.test.cpp
• tests/p_Subset_Sum.test.cpp

Code

// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/

#line 1 "misc/macros.h"
// #pragma GCC optimize("Ofast,unroll-loops")       // unroll long, simple loops
// #pragma GCC target("avx2,fma")                   // vectorizing code
// #pragma GCC target("lzcnt,popcnt,abm,bmi,bmi2")  // for fast bitset operation

#include <bits/extc++.h>
#include <tr2/dynamic_bitset>

using namespace std;
using namespace __gnu_pbds;  // ordered_set, gp_hash_table
// using namespace __gnu_cxx; // rope

// for templates to work
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define pb push_back
#define eb emplace_back
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using ld = long double;
using pii = pair<i32, i32>;
using vi = vector<i32>;

// fast map
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {  // customize hash function for gp_hash_table
  int operator()(int x) const { return x ^ RANDOM; }
};
gp_hash_table<int, int, chash> table;

/* ordered set
    find_by_order(k): returns an iterator to the k-th element (0-based)
    order_of_key(k): returns the number of elements in the set that are strictly less than k
*/
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

/*  rope
    rope <int> cur = v.substr(l, r - l + 1);
    v.erase(l, r - l + 1);
    v.insert(v.mutable_begin(), cur);
*/

Back to top page