-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcodebook.toc
More file actions
99 lines (99 loc) · 6.44 KB
/
Copy pathcodebook.toc
File metadata and controls
99 lines (99 loc) · 6.44 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
\contentsline {section}{\numberline {1}Basic}{1}%
\contentsline {subsection}{\numberline {1.1}Default code}{1}%
\contentsline {subsection}{\numberline {1.2}vimrc}{1}%
\contentsline {subsection}{\numberline {1.3}IO optimize}{1}%
\contentsline {subsection}{\numberline {1.4}Black Magic}{2}%
\contentsline {section}{\numberline {2}Graph}{2}%
\contentsline {subsection}{\numberline {2.1}BCC Vertex*}{2}%
\contentsline {subsection}{\numberline {2.2}Bridge*}{2}%
\contentsline {subsection}{\numberline {2.3}2SAT (SCC)*}{2}%
\contentsline {subsection}{\numberline {2.4}MinimumMeanCycle*}{3}%
\contentsline {subsection}{\numberline {2.5}Virtual Tree*}{3}%
\contentsline {subsection}{\numberline {2.6}Maximum Clique Dyn*}{3}%
\contentsline {subsection}{\numberline {2.7}Minimum Steiner Tree*}{3}%
\contentsline {subsection}{\numberline {2.8}Dominator Tree*}{4}%
\contentsline {subsection}{\numberline {2.9}Minimum Arborescence*}{4}%
\contentsline {subsection}{\numberline {2.10}Vizing's theorem}{4}%
\contentsline {subsection}{\numberline {2.11}Minimum Clique Cover*}{5}%
\contentsline {subsection}{\numberline {2.12}NumberofMaximalClique*}{5}%
\contentsline {section}{\numberline {3}Data Structure}{5}%
\contentsline {subsection}{\numberline {3.1}LiChao Segment Tree}{5}%
\contentsline {subsection}{\numberline {3.2}Persistent Segment Tree}{6}%
\contentsline {subsection}{\numberline {3.3}Treap}{6}%
\contentsline {subsection}{\numberline {3.4}Heavy light Decomposition}{7}%
\contentsline {subsection}{\numberline {3.5}Link cut tree*}{7}%
\contentsline {section}{\numberline {4}Flow/Matching}{8}%
\contentsline {subsection}{\numberline {4.1}Dinic}{8}%
\contentsline {subsection}{\numberline {4.2}Kuhn Munkres}{8}%
\contentsline {subsection}{\numberline {4.3}MincostMaxflow}{8}%
\contentsline {subsection}{\numberline {4.4}Maximum Simple Graph Matching*}{9}%
\contentsline {subsection}{\numberline {4.5}Minimum Weight Matching (Clique version)*}{9}%
\contentsline {subsection}{\numberline {4.6}SW-mincut}{10}%
\contentsline {subsection}{\numberline {4.7}BoundedFlow(Dinic*)}{10}%
\contentsline {subsection}{\numberline {4.8}Gomory Hu tree}{11}%
\contentsline {section}{\numberline {5}String}{11}%
\contentsline {subsection}{\numberline {5.1}KMP}{11}%
\contentsline {subsection}{\numberline {5.2}Z-value}{11}%
\contentsline {subsection}{\numberline {5.3}Suffix Array}{11}%
\contentsline {subsection}{\numberline {5.4}SAIS*}{11}%
\contentsline {subsection}{\numberline {5.5}Aho-Corasick Automatan}{12}%
\contentsline {subsection}{\numberline {5.6}Smallest Rotation}{12}%
\contentsline {subsection}{\numberline {5.7}De Bruijn sequence*}{12}%
\contentsline {subsection}{\numberline {5.8}SAM}{12}%
\contentsline {subsection}{\numberline {5.9}Palindromic Tree}{13}%
\contentsline {subsection}{\numberline {5.10}cyclicLCS}{13}%
\contentsline {section}{\numberline {6}Math}{14}%
\contentsline {subsection}{\numberline {6.1}ax+by=gcd*}{14}%
\contentsline {subsection}{\numberline {6.2}floor and ceil}{14}%
\contentsline {subsection}{\numberline {6.3}Miller Rabin*}{14}%
\contentsline {subsection}{\numberline {6.4}Fraction}{14}%
\contentsline {subsection}{\numberline {6.5}Simultaneous Equations}{14}%
\contentsline {subsection}{\numberline {6.6}Pollard Rho}{14}%
\contentsline {subsection}{\numberline {6.7}Simplex Algorithm}{15}%
\contentsline {subsubsection}{\numberline {6.7.1}Construction}{15}%
\contentsline {subsection}{\numberline {6.8}Schreier-Sims Algorithm*}{15}%
\contentsline {subsection}{\numberline {6.9}chineseRemainder}{16}%
\contentsline {subsection}{\numberline {6.10}QuadraticResidue}{16}%
\contentsline {subsection}{\numberline {6.11}PiCount}{16}%
\contentsline {subsection}{\numberline {6.12}Primes}{16}%
\contentsline {subsection}{\numberline {6.13}Theorem}{16}%
\contentsline {subsubsection}{\numberline {6.13.1}Kirchhoff's Theorem}{16}%
\contentsline {subsubsection}{\numberline {6.13.2}Tutte's Matrix}{16}%
\contentsline {subsubsection}{\numberline {6.13.3}Cayley's Formula}{17}%
\contentsline {subsubsection}{\numberline {6.13.4}Erdős–Gallai theorem}{17}%
\contentsline {subsubsection}{\numberline {6.13.5}Gale–Ryser theorem}{17}%
\contentsline {subsubsection}{\numberline {6.13.6}Fulkerson–Chen–Anstee theorem}{17}%
\contentsline {section}{\numberline {7}Polynomial}{17}%
\contentsline {subsection}{\numberline {7.1}Fast Fourier Transform}{17}%
\contentsline {subsection}{\numberline {7.2}Number Theory Transform}{17}%
\contentsline {subsection}{\numberline {7.3}Fast Walsh Transform*}{17}%
\contentsline {subsection}{\numberline {7.4}Polynomial Operation}{17}%
\contentsline {subsection}{\numberline {7.5}Newton's Method}{18}%
\contentsline {section}{\numberline {8}Geometry}{19}%
\contentsline {subsection}{\numberline {8.1}Default Code}{19}%
\contentsline {subsection}{\numberline {8.2}Convex hull*}{19}%
\contentsline {subsection}{\numberline {8.3}External bisector}{19}%
\contentsline {subsection}{\numberline {8.4}Heart}{19}%
\contentsline {subsection}{\numberline {8.5}Minimum Enclosing Circle*}{19}%
\contentsline {subsection}{\numberline {8.6}Polar Angle Sort*}{19}%
\contentsline {subsection}{\numberline {8.7}Intersection of two circles*}{20}%
\contentsline {subsection}{\numberline {8.8}Intersection of polygon and circle}{20}%
\contentsline {subsection}{\numberline {8.9}Intersection of line and circle}{20}%
\contentsline {subsection}{\numberline {8.10}point in circle}{20}%
\contentsline {subsection}{\numberline {8.11}Half plane intersection}{20}%
\contentsline {subsection}{\numberline {8.12}CircleCover*}{20}%
\contentsline {subsection}{\numberline {8.13}3Dpoint*}{21}%
\contentsline {subsection}{\numberline {8.14}Convexhull3D*}{21}%
\contentsline {subsection}{\numberline {8.15}DelaunayTriangulation*}{22}%
\contentsline {subsection}{\numberline {8.16}Triangulation Vonoroi*}{23}%
\contentsline {subsection}{\numberline {8.17}Tangent line of two circles}{23}%
\contentsline {subsection}{\numberline {8.18}minMaxEnclosingRectangle}{23}%
\contentsline {subsection}{\numberline {8.19}minDistOfTwoConvex}{24}%
\contentsline {subsection}{\numberline {8.20}Minkowski Sum*}{24}%
\contentsline {subsection}{\numberline {8.21}RotatingSweepLine}{24}%
\contentsline {section}{\numberline {9}Else}{24}%
\contentsline {subsection}{\numberline {9.1}Mo's Alogrithm(With modification)}{24}%
\contentsline {subsection}{\numberline {9.2}Mo's Alogrithm On Tree}{24}%
\contentsline {subsection}{\numberline {9.3}DynamicConvexTrick*}{25}%
\contentsline {subsection}{\numberline {9.4}Matroid Intersection}{25}%
\contentsline {subsection}{\numberline {9.5}AdaptiveSimpson}{25}%