CP Reference Codes

My implementations of various data structures and algorithms for competitive programming.

Contents (GitHub links, main)

• 1-ds
  • erasable_pq.cpp
  • fenwick_tree.cpp
  • li_chao_tree.cpp
  • merge_sort_tree.cpp
  • pbds.cpp
  • segment_tree.cpp
  • union_find.cpp
• 2-graph
  • bcc.cpp
  • euler_circuit.cpp
  • kth_shortest_path.cpp
  • offline_dynamic_connectivity.cpp
  • scc_2_sat.cpp
  • shortest_path.cpp
• 3-tree
  • centroid_decomp.cpp
  • hld.cpp
  • lca_sparse_table.cpp
  • tree_composition.cpp
  • tree_exchange_argument.cpp
• 4-optimizations
  • flow.cpp
  • hungarian.cpp
• 5-string
  • aho_corasick.cpp
  • kmp_algorithm.cpp
  • manachers_algorithm.cpp
  • rabin_karp_algorithm.cpp
  • suffix_array.cpp
  • trie.cpp
  • z_algorithm.cpp
• 6-geometry
  • bulldozer_trick.cpp
  • convex_hull.cpp
  • geom_base.cpp
  • half_plane_intersection.cpp
  • minimum_enclosing_circle.cpp
  • ray_casting.cpp
  • rotating_callipers.cpp
  • segment_intersection.cpp
  • sort_by_angular.cpp
• 7-math
  • comb_binom.cpp
  • comb_cat_der.cpp
  • conv_fft.cpp
  • linalg_gauss.cpp
  • linalg_mat.cpp
  • misc_sqrt.cpp
  • modint.hpp
  • nt_crt.cpp
  • nt_euclid.cpp
  • nt_mr_rho.cpp
  • nt_sieve.cpp
  • num.hpp
• 8-misc
  • dp_opt.cpp
  • fraction_data_type.cpp
  • kitamasa.cpp
  • lis_in_o_nlogn.cpp
  • random.cpp
  • rotation_matrix_manhattan_distance_chebyshev_distance.txt
  • simd.cpp
  • sqrt_decomposition_mos_algorithm.cpp
  • stress_test.py
  • system_of_difference_constraints.cpp
  • ternary_search.cpp
• common
  • common.hpp