12tqian's Competitive Programming Library

This is a collection of my templates for competitive programming.

Library Files

library/contest

• library/contest/template-full.cpp
• library/contest/template-full.hpp
• library/contest/template-minimal.hpp
• library/contest/template-short.cpp
• library/contest/template-short.hpp

library/data-structures/1d-range-queries

• library/data-structures/1d-range-queries/affine-segment-tree.hpp
• library/data-structures/1d-range-queries/associative-range-query.hpp
• library/data-structures/1d-range-queries/fenwick-tree.hpp
• library/data-structures/1d-range-queries/general-full-segment-tree.hpp
• library/data-structures/1d-range-queries/general-simple-segment-tree.hpp
• library/data-structures/1d-range-queries/implicit-lazy-segment-tree.hpp
• library/data-structures/1d-range-queries/interval-union.hpp
• library/data-structures/1d-range-queries/lazy-segment-tree.hpp
• library/data-structures/1d-range-queries/li-chao-tree-offline.hpp
• library/data-structures/1d-range-queries/li-chao-tree-online.hpp
• library/data-structures/1d-range-queries/point-update-segment-tree.hpp
• library/data-structures/1d-range-queries/range-set-segment-tree.hpp
• Segment Tree Beats (library/data-structures/1d-range-queries/segment-tree-beats.hpp)
• library/data-structures/1d-range-queries/sparse-segment-tree.hpp
• Sparse Table (library/data-structures/1d-range-queries/sparse-table.hpp)

library/data-structures/2d-range-queries

• General Fenwick Tree (library/data-structures/2d-range-queries/general-fenwick-tree.hpp)
• Offline 2D BIT (library/data-structures/2d-range-queries/offline-2d-binary-indexed-tree.hpp)
• Quadtree (library/data-structures/2d-range-queries/quadtree.hpp)
• library/data-structures/2d-range-queries/wavelet-matrix.hpp

library/data-structures

• library/data-structures/range-vector.hpp

library/dynamic-programming

• library/dynamic-programming/gosper-hack.hpp
• Line Container (library/dynamic-programming/line-container.hpp)
• library/dynamic-programming/max-deque.hpp
• library/dynamic-programming/min-deque.hpp
• Monotonic Convex Hull Trick (library/dynamic-programming/monotonic-convex-hull.hpp)

library/geometry

• library/geometry/convex-hull.hpp
• library/geometry/geometry-2d.hpp
• library/geometry/point.hpp

library/graphs

• Bellman Ford (library/graphs/bellman-ford.hpp)
• library/graphs/biconnected-components.hpp
• library/graphs/block-cut-tree.hpp
• library/graphs/blossom-matching.hpp
• library/graphs/centroid-decomposition.hpp
• library/graphs/dijkstra.hpp
• library/graphs/dsu-rollback.hpp
• library/graphs/dsu.hpp
• library/graphs/enumerate-triangles.cpp
• Euler Path (library/graphs/euler-path.hpp)
• library/graphs/heavy-light-decomposition.hpp
• Old Heavy Light Decomposition (library/graphs/heavy-light-decomposition2.hpp)
• library/graphs/kruskal.hpp
• library/graphs/lca-jump-distance.hpp
• LCA Jump (library/graphs/lca-jump.hpp)
• LCA RMQ (library/graphs/lca-rmq.hpp)
• library/graphs/link-cut-tree.hpp
• library/graphs/low-link.hpp
• library/graphs/offline-dynamic-connectivity.hpp
• library/graphs/strongly-connected-components-kosaraju.hpp
• library/graphs/strongly-connected-components-tarjan.hpp
• Topological Sort (library/graphs/topological-sort.hpp)
• library/graphs/two-edge-connected-components.hpp
• library/graphs/two-sat.hpp

library/graphs/flows

• library/graphs/flows/dinic.hpp
• Hungarian Algorithm (library/graphs/flows/hungarian.hpp)
• library/graphs/flows/min-cost-b-flow.hpp
• library/graphs/flows/min-cost-flow.hpp
• Minimum Cost Maximum Flow (library/graphs/flows/min-cost-max-flow.hpp)
• Push Relabel (library/graphs/flows/push-relabel.hpp)

library/math

• library/math/affine.hpp

library/misc

• library/misc/easy-io.hpp
• library/misc/fast-hash-map.hpp
• library/misc/fast-input.hpp
• library/misc/fast-io.hpp
• library/misc/pragma-short.hpp

library/modular-arithmetic

• library/modular-arithmetic/mod-int.hpp
• library/modular-arithmetic/mod-int2.hpp
• library/modular-arithmetic/mod-operations.hpp
• library/modular-arithmetic/mod-sqrt.hpp

library/number-theory

• Basic Factoring (library/number-theory/basic-factor.hpp)
• library/number-theory/basic-number-theory.hpp
• library/number-theory/counting-primes.hpp
• library/number-theory/factor-big.hpp
• library/number-theory/fast-factor-sieve.hpp
• Linear Sieve (library/number-theory/linear-sieve.hpp)
• library/number-theory/sieve.hpp

library/numerical

• Big Integer (library/numerical/big-integer.hpp)
• library/numerical/fraction.hpp
• library/numerical/matrix.hpp
• library/numerical/matrix2.hpp
• Simplex LP Solver (library/numerical/simplex.hpp)
• XOR Basis (library/numerical/xor-basis.hpp)

library/polynomial

• library/polynomial/berlekamp-massey.hpp
• library/polynomial/fast-fourier-transform.hpp
• library/polynomial/karatsuba.hpp
• library/polynomial/multipoint-evaluation.hpp
• library/polynomial/number-theoretic-transform.hpp
• library/polynomial/polynomial-sqrt.hpp
• Formal Power Series (library/polynomial/polynomial.hpp)
• library/polynomial/polynomial2.hpp

library/set-function

• library/set-function/walsh-hadamard-transform.hpp

library/string

• library/string/hashing.hpp
• library/string/manacher.hpp
• Suffix Array with Longest Common Prefix (library/string/suffix-array-lcp.hpp)
• library/string/z-algorithm.hpp

Verification Files

verify/aizu

• verify/aizu/aizu-1163.test.cpp
• verify/aizu/aizu-GRL_1_A.test.cpp
• verify/aizu/aizu-GRL_1_B.test.cpp
• verify/aizu/aizu-GRL_2_A.test.cpp
• verify/aizu/aizu-GRL_6_A-2.test.cpp
• verify/aizu/aizu-GRL_6_A.test.cpp
• verify/aizu/aizu-GRL_6_B.test.cpp

verify/atcoder

• verify/atcoder/atcoder-abc210_f.test.cpp

verify/codeforces

• verify/codeforces/codeforces-1074F.test.cpp
• verify/codeforces/codeforces-1195E.test.cpp
• verify/codeforces/codeforces-1299D.test.cpp
• verify/codeforces/codeforces-1463E.test.cpp
• verify/codeforces/codeforces-1494F.test.cpp
• verify/codeforces/codeforces-1542E2.test.cpp
• verify/codeforces/codeforces-1551F.test.cpp
• verify/codeforces/codeforces-1553G.test.cpp
• verify/codeforces/codeforces-319C.test.cpp
• verify/codeforces/codeforces-869E-general-fwt.test.cpp
• verify/codeforces/codeforces-869E-quadtree.test.cpp
• verify/codeforces/codeforces-981G.test.cpp

verify/dmoj

• verify/dmoj/dmoj-ds5.test.cpp

verify/kattis

• verify/kattis/kattis-cheeseifyouplease.test.cpp
• verify/kattis/kattis-convexhull.test.cpp
• verify/kattis/kattis-equationsolver-matrix.test.cpp
• verify/kattis/kattis-equationsolver.test.cpp
• verify/kattis/kattis-generalchineseremainder.test.cpp
• verify/kattis/kattis-mincostmaxflow.test.cpp
• verify/kattis/kattis-pointinpolygon.test.cpp

verify/spoj

• verify/spoj/spoj-DYNACON2.test.cpp
• verify/spoj/spoj-FACT0.test.cpp
• verify/spoj/spoj-MMFSUNDARAM.test.cpp
• verify/spoj/spoj-QTREE2.test.cpp
• verify/spoj/spoj-TDKPRIME.test.cpp

verify/unit-test

• verify/unit-test/unit-test-big-integer.test.cpp
• verify/unit-test/unit-test-fast-io.test.cpp
• verify/unit-test/unit-test-fraction.test.cpp
• verify/unit-test/unit-test-gosper-hack.test.cpp
• verify/unit-test/unit-test-hashing.test.cpp
• verify/unit-test/unit-test-template-full.test.cpp
• verify/unit-test/unit-test-template-short.test.cpp

verify/yosupo

• verify/yosupo/yosupo-assignment.test.cpp
• verify/yosupo/yosupo-biconnected_components.test.cpp
• verify/yosupo/yosupo-bipartitematching.test.cpp
• verify/yosupo/yosupo-bitwise_xor_convolution.test.cpp
• verify/yosupo/yosupo-convolution_mod_1000000007-fast-fourier-transform.test.cpp
• verify/yosupo/yosupo-convolution_mod_1000000007-karatsuba.test.cpp
• verify/yosupo/yosupo-counting_primes.test.cpp
• verify/yosupo/yosupo-division_of_polynomials.test.cpp
• verify/yosupo/yosupo-enumerate_palindromes.test.cpp
• verify/yosupo/yosupo-enumerate_triangles.test.cpp
• verify/yosupo/yosupo-exp_of_formal_power_series.test.cpp
• verify/yosupo/yosupo-factorize.test.cpp
• verify/yosupo/yosupo-find_linear_recurrence.test.cpp
• verify/yosupo/yosupo-frequency_table_of_tree_distance.test.cpp
• verify/yosupo/yosupo-general_matching.test.cpp
• verify/yosupo/yosupo-inv_of_formal_power_series.test.cpp
• verify/yosupo/yosupo-inverse_matrix.test.cpp
• verify/yosupo/yosupo-lca-lca-jump.test.cpp
• verify/yosupo/yosupo-lca-lca-rmq.test.cpp
• verify/yosupo/yosupo-line_add_get_min.test.cpp
• verify/yosupo/yosupo-log_of_formal_power_series.test.cpp
• verify/yosupo/yosupo-min_cost_b_flow.test.cpp
• verify/yosupo/yosupo-multipoint_evaluation.test.cpp
• verify/yosupo/yosupo-point_add_range_general-simple-segment-tree.test.cpp
• verify/yosupo/yosupo-point_add_range_sum-fenwick-tree.test.cpp
• verify/yosupo/yosupo-point_add_range_sum-implicit-lazy-segment-tree.test.cpp
• verify/yosupo/yosupo-point_add_range_sum-lazy-segment-tree.test.cpp
• verify/yosupo/yosupo-point_add_range_sum-point-update-segment-tree.test.cpp
• verify/yosupo/yosupo-point_add_range_sum-range-set-segment-tree.test.cpp
• verify/yosupo/yosupo-point_add_range_sum-sparse-segment-tree.test.cpp
• verify/yosupo/yosupo-point_add_rectangle_sum-wavelet-matrix.test.cpp
• verify/yosupo/yosupo-point_set_range_composite.test.cpp
• verify/yosupo/yosupo-pow_of_formal_power_series.test.cpp
• verify/yosupo/yosupo-range_affine_range_sum.test.cpp
• verify/yosupo/yosupo-range_chmin_chmax_add_range_sum.test.cpp
• verify/yosupo/yosupo-rectangle_sum-offline-2d-bit.test.cpp
• verify/yosupo/yosupo-scc-kosaraju.test.cpp
• verify/yosupo/yosupo-scc-tarjan.test.cpp
• verify/yosupo/yosupo-segment_add_get_min-li-chao-tree-offline.test.cpp
• verify/yosupo/yosupo-segment_add_get_min-li-chao-tree-online.test.cpp
• verify/yosupo/yosupo-sort_points_by_argument.test.cpp
• verify/yosupo/yosupo-sqrt_mod.test.cpp
• verify/yosupo/yosupo-sqrt_of_formal_power_series.test.cpp
• verify/yosupo/yosupo-static_range_sum.test.cpp
• verify/yosupo/yosupo-suffixarray-lcp.test.cpp
• verify/yosupo/yosupo-system_of_linear_equations.test.cpp
• verify/yosupo/yosupo-two_edge_connected_components.test.cpp
• verify/yosupo/yosupo-unionfind.test.cpp
• verify/yosupo/yosupo-vertex_add_path_sum-new-hld.test.cpp
• verify/yosupo/yosupo-vertex_add_path_sum.test.cpp
• verify/yosupo/yosupo-zalgorithm.test.cpp

verify/yukicoder

• verify/yukicoder/yukicoder-1326.test.cpp