My starter code
(content/utils/template.h)

• View this file on GitHub
• Last update: 2024-02-01 17:09:56-05:00

Required by

• Binary Indexed Tree (content/data_structures/bit.h)
• Lazy Segment Tree (content/data_structures/lazy_segment_tree.h)
• Li Chao Tree (content/data_structures/li_chao_tree.h)
• Segment Tree (content/data_structures/segment_tree.h)
• Sparse Table (content/data_structures/sparse_table.h)
• Point (content/geometry/point.h)
• Polygon (content/geometry/polygon.h)
• Hopcroft Karp (content/graph/flow/hopcroft_karp.h)
• Tarjan's algorithm (content/graph/tarjan.h)
• Fraction Class (content/math/fraction.h)
• Knuth-Morris-Pratt Algorithm (content/string/kmp.h)
• Manacher's Algorithm (content/string/manacher.h)
• Suffix Array (in O(n log n)) (content/string/suffix_array.h)
• Suffix Automaton (content/string/suffix_automaton.h)
• Z Algorithm (content/string/z_algorithm.h)

Verified with

• tests/aplusb.test.cpp
• tests/atcoder.test.cpp
• tests/bit.test.cpp
• tests/hopcroft_karp.test.cpp
• tests/lazy_segment_tree.test.cpp
• tests/li_chao_tree.test.cpp
• tests/manacher.test.cpp
• tests/segment_tree.test.cpp
• tests/sparse_table.test.cpp
• tests/suffix_array.test.cpp
• tests/tarjan_blockcut_bccs.test.cpp
• tests/tarjan_scc.test.cpp
• tests/z_algorithm.test.cpp

Code

/**
 * @brief My starter code
 */

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define makeunique(x) (x).erase(unique((x).begin(), (x).end()), (x).end());

#ifdef LOCAL
template<typename T> void pr(T a){std::cerr<<a<<std::endl;}
template<typename T, typename... Args> void pr(T a, Args... args){std::cerr<<a<<' ',pr(args...);}
#else
template<typename... Args> void pr(Args... args){}
#endif

using namespace std;
using ll = long long;
using pii = pair<int, int>;

#line 1 "content/utils/template.h"
/**
 * @brief My starter code
 */

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define makeunique(x) (x).erase(unique((x).begin(), (x).end()), (x).end());

#ifdef LOCAL
template<typename T> void pr(T a){std::cerr<<a<<std::endl;}
template<typename T, typename... Args> void pr(T a, Args... args){std::cerr<<a<<' ',pr(args...);}
#else
template<typename... Args> void pr(Args... args){}
#endif

using namespace std;
using ll = long long;
using pii = pair<int, int>;

Back to top page