template/macro.hpp

• View this file on GitHub
• Last update: 2025-11-10 09:50:33+09:00
• Include: #include "template/macro.hpp"
• Link: https://trap.jp/post/1224/

Depends on

• template/include.hpp
• template/type_alias.hpp

Required by

• Fenwick Tree (data_structure/fenwick_tree.hpp)
• Rollback Union Find (Rollback付きUnion Find) (data_structure/rollback_union_find.hpp)
• Segment Tree (セグメント木) (data_structure/segment_tree.hpp)
• Union Find (data_structure/union_find.hpp)
• Weighted Union Find (重み付きUnion Find) (data_structure/weighted_union_find.hpp)
• Topological Sort (トポロジカルソート) (graph/topological_sort.hpp)
• Binomial (二項係数) (math/binomial.hpp)
• Dynamic Mod Int (math/dynamic_mod_int.hpp)
• Matrix (行列) (math/matrix.hpp)
• Next Combination (math/next_combination.hpp)
• Prime Sieve (エラトステネスの篩) (math/prime_sieve.hpp)
• Static Mod Int (math/static_mod_int.hpp)
• Rolling Hash (ローリングハッシュ) (string/rolling_hash.hpp)
• 提出用テンプレート (template/template.hpp)
• test/utility/next_combination.test.cpp
• Heavy Light Decomposition (HL分解) (tree/heavy_light_decomposition.hpp)

Verified with

• test/data_structure/fenwick_tree.test.cpp
• test/data_structure/rollback_union_find.test.cpp
• test/data_structure/segment_tree.range_min.test.cpp
• test/data_structure/unionfind.test.cpp
• test/data_structure/weighted_union_find.test.cpp
• test/graph/topological_sort.get.test.cpp
• test/graph/topological_sort.is_dag.test.cpp
• test/math/binomial.test.cpp
• test/math/extended_gcd.test.cpp
• test/math/matrix.test.cpp
• test/math/prime_sieve.test.cpp
• test/string/rolling_hash.test.cpp
• test/template/template.test.cpp
• test/tree/heavy_light_decomposition.lca.test.cpp
• test/tree/heavy_light_decomposition.path_query.test.cpp
• test/tree/heavy_light_decomposition.subtree_query.test.cpp

Code

#pragma once

#include "include.hpp"
#include "type_alias.hpp"

/**
 * @see https://trap.jp/post/1224/
 */

#ifdef LOCAL
inline constexpr bool IS_LOCAL = true;
#else
inline constexpr bool IS_LOCAL = false;
#endif

#define IF_LOCAL if constexpr (IS_LOCAL)

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

#define overload4(a, b, c, d, e, ...) e

#define rep1(i, a) for (ll i = 0; (i) < (ll)(a); ++(i))
#define rep2(i, a, b) for (ll i = (ll)(a); (i) < (ll)(b); ++(i))
#define rep3(i, a, b, c) for (ll i = (ll)(a); (i) < (ll)(b); (i) += (ll)(c))
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep1(i, a) for (ll i = (ll)(a); (i) >= 0; --(i))
#define rrep2(i, a, b) for (ll i = (ll)(a); (i) >= (ll)(b); --(i))
#define rrep3(i, a, b, c) for (ll i = (ll)(a); (i) >= (ll)(b); (i) -= (ll)(c))
#define rrep(...) overload4(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)

#line 2 "template/macro.hpp"

#line 2 "template/include.hpp"

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif

#include <bits/stdc++.h>
using namespace std;
#line 2 "template/type_alias.hpp"

#line 4 "template/type_alias.hpp"

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;

using ld = long double;

template <class T, bool REVERSE = false>
using heap = priority_queue<T, vector<T>, conditional_t<REVERSE, greater<T>, less<T>>>;
#line 5 "template/macro.hpp"

/**
 * @see https://trap.jp/post/1224/
 */

#ifdef LOCAL
inline constexpr bool IS_LOCAL = true;
#else
inline constexpr bool IS_LOCAL = false;
#endif

#define IF_LOCAL if constexpr (IS_LOCAL)

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)

#define overload4(a, b, c, d, e, ...) e

#define rep1(i, a) for (ll i = 0; (i) < (ll)(a); ++(i))
#define rep2(i, a, b) for (ll i = (ll)(a); (i) < (ll)(b); ++(i))
#define rep3(i, a, b, c) for (ll i = (ll)(a); (i) < (ll)(b); (i) += (ll)(c))
#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep1(i, a) for (ll i = (ll)(a); (i) >= 0; --(i))
#define rrep2(i, a, b) for (ll i = (ll)(a); (i) >= (ll)(b); --(i))
#define rrep3(i, a, b, c) for (ll i = (ll)(a); (i) >= (ll)(b); (i) -= (ll)(c))
#define rrep(...) overload4(__VA_ARGS__, rrep3, rrep2, rrep1)(__VA_ARGS__)

Back to top page