Algorithms

Warning: There are ideas and implementations that I don't own. Some are almost exactly same. Go to the reference links for the original creator.

These codes are for problem solving and internet-based competitions.

TODO

snippet_generator.py
Union Find Segment Tree Lazy Propagation
Segment Tree Beats
Custom Hasher(Rabin Karp)
Max Flow, Min Cut (Atcoder style)
Min Cost Flow (Atcoder Style) MCMF (Atcoder style + that passes https://www.acmicpc.net/problem/14424)
FFT, NTT
Half Plane Intersection Dnc Opt
KMP
Convex Hull
Djikstra

Good

debug.h

Data Structures

Segment Tree
RMQ
Line Container

Flow

Bipartite Matching

Graph

SCC (Kosaraju, Tarjan) BCC (Edge distinct, Vertex Distinct) LCA
two_sat

Math

DiscreteLogarithm_Fast(Phollig-Hellman)
ModInt, Combination
Extended GCD
Linear Sieve (Multiplicative Functions)

Strings

Manacher(Palindrome)
KMP(Pattern Matching)
Fast LCS using bitset

Geometry

Geometry_All (Point, Line, Polygon)
https://codeforces.com/contest/1936/submission/249350779 https://victorlecomte.com/cp-geo.pdf

Miscellaneous

References

https://github.com/the-tourist/algo/tree/master
https://github.com/kth-competitive-programming/kactl