ckiseki

ICPC codebook used by team ckiseki from National Taiwan University

• Latest content
• Latest document
• Test Status

• 在 pdf 裡面標星號的代表 not verified
• 在 .cpp 裡面放 /* SPLIT_HASH_HERE */ 可以分段 hash

TODO

• Make all include cpps have corresponding docs.
• Rewrite gen_content.py or refactor whole building mechanism @@

To delete/fix/shorten

• binary search on segtree
• make KM modern
• shorten floor sum
• shorten weighted general matching
• Add Manacher comment
• del old fft and polynomial?
• FPS
• shorten SA
• network simplex
• 修萬能歐幾里得
• fix SAM/PalTree
• tree knapsack
• min mean cycle
• simulate annealing
• Simplex (Performance, e.g. with custom type?)
• treap
• test performance of SAIS for big strings (or vectors).
• suffix array lcp tools
• vim Hash command broken when searching Hash.
• unify CostFlow.cpp and DijkstraCostFlow.cpp.

To add

• count 3 cycle / 4 cycle
• faster Pollard Rho (127(?))
• bipartite independent set / vertex cover construction
• LP dual formula
• HLPP? $(N^2\sqrt{M})$ max-flow
• Make an usable Gaussian Elimination
• bounded flow?
• add definition of matroid
• add simple polygon sweep line docs
• 郵局設置問題無限大extreme (aliens trick + convex 1d 1d opt)
• segment tree beats
• 邀請函?
• subset convolution
• add 3d geometry
• BitsetLCS with solution
• QR decomposition
• highly composite number?
• more submodular minimization
• add (useful) kosaraju back
• ear decomposition
• min 25 篩
• 匹配相關
• sector union?
• add more derivatives/integrals
• interval container
• KM, but with slope function (the best match of exactly C edges, C = $0..N$)
• weighted bipartite matching in $O(N_L^{2}N_R)$

Flow series

• Network Simplex/Cost Scaling/Capacity Scaling
• MCMF Dual
• Submodular Mincut
• 最小费用可行流(?)

Geometry

• fix our 2d convex hull?
• MinMaxEnclosing Rectangle
• half plane intersection precision
• rotating sweep line
• convex cut
• make delaunay easier to use (make postprocess voronoi)
• to add
  • triangle hearts?
  • adaptive simpson?
  • 3d point class
• 3d hull test
• offline PointInSimplePolygon (NaCl)
• del or fix
  • KD tree
  • KD closet pair
• convex hull trick linear?
• be careful of std::abs<complex<int>>
• https://vjudge.net/problem/UVA-12311