template/template.cpp

• View this file on GitHub
• Last update: 2021-09-12 23:44:25+09:00
• Link: View error logs on GitHub Actions

Required by

• Max Flow (Dinic) (graph/MaxFlow.cpp)
• Min Cost Flow (Primal Dual) (graph/MinCostFlow.cpp)
• graph/SCC.cpp
• graph/Tree.cpp
• math/CRT.cpp
• Combination (nCk) (math/Combination.cpp)
• math/FFT.cpp
• math/combination_big.cpp
• math/extgcd.cpp
• Fast Prime Factorization (math/factor.cpp)
• math/matrix.cpp
• mod int (math/modint.cpp)
• Burrows Wheeler Transform (string/BWT.cpp)
• FM Index (string/FM_index.cpp)
• Rolling Hash (mod 2^61-1) (string/RollingHash.cpp)
• Suffix Array (SA-IS) (string/SuffixArray.cpp)
• string/Zalgo.cpp
• Binary Indexed Tree (structure/BIT.cpp)
• Bit Vector (structure/BitVector.cpp)
• structure/HLD.cpp
• Li Chao Tree (Convex Hull Trick) (structure/LiChaoTree.cpp)
• structure/Mo.cpp
• structure/PartialPersistentUnionFind.cpp
• structure/PersistentArray.cpp
• structure/PersistentUnionFind.cpp
• Lazy Segment Tree (structure/SegmentTree.cpp)
• structure/SegmentTreeBeats.cpp
• Sparse Table (structure/SparseTable.cpp)
• structure/SplayTree.cpp
• Union Find (structure/UnionFind.cpp)
• Wavelet Matrix (structure/WaveletMatrix.cpp)

Verified with

• test/BIT.test.cpp
• test/Combination.test.cpp
• test/FM_index.test.cpp
• test/LiChaoTree.test.cpp
• test/MaxFlow.test.cpp
• test/MinCostFlow.test.cpp
• test/RollingHash.test.cpp
• test/SegmentTree.test.cpp
• test/SparseTable.test.cpp
• test/SuffixArray.LCP.test.cpp
• test/SuffixArray.matching.test.cpp
• test/SuffixArray.test.cpp
• test/UnionFind.test.cpp
• test/WaveletMatrix.test.cpp
• test/factor.test.cpp

Code

#pragma once
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > 0; i--)
#define all(v) v.begin(), v.end()
#define PL pair<ll, ll>
#define PI pair<int, int>
#define pi acos(-1)
#define len(s) (int)s.size()
#define compress(v) \
    sort(all(v));   \
    v.erase(unique(all(v)), v.end());
#define comid(v, x) lower_bound(all(v), x) - v.begin()

template<class T>
using prique=priority_queue<T,vector<T>,greater<>>;

template <class T, class U>
inline bool chmin(T &a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T, class U>
inline bool chmax(T &a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
constexpr ll inf = 3e18;

#line 2 "template/template.cpp"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define REV(i, n) for (int i = n - 1; i > 0; i--)
#define all(v) v.begin(), v.end()
#define PL pair<ll, ll>
#define PI pair<int, int>
#define pi acos(-1)
#define len(s) (int)s.size()
#define compress(v) \
    sort(all(v));   \
    v.erase(unique(all(v)), v.end());
#define comid(v, x) lower_bound(all(v), x) - v.begin()

template<class T>
using prique=priority_queue<T,vector<T>,greater<>>;

template <class T, class U>
inline bool chmin(T &a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T, class U>
inline bool chmax(T &a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
constexpr ll inf = 3e18;

Back to top page