icpc-teamnote/teamnote.tex at main · simta1/icpc-teamnote · GitHub

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
\documentclass[8pt, a4paper, oneside, twocolumn]{extarticle}
% \documentclass[landscape, 8pt, a4paper, oneside, twocolumn]{extarticle}

\usepackage{kotex}
\usepackage{enumitem}
\usepackage{titlesec}
% \usepackage{amssymb}
% \usepackage{amsmath}
% \usepackage{multicol}

\usepackage{teamnote}

% \teamnote{University}{Team Name}{student1, student2, student3}
\teamnote{Sungkyunkwan University}{Junho0219}{Kim Junho}

\titlespacing*{\section}{0pt}{0pt}{0pt}
\titlespacing*{\subsection}{0pt}{0pt}{0pt}
\setlist{nosep}

\HideUsage
\HideComplexity
\HideAuthor

\begin{document}

\maketitlepage
% \pagebreak

% \Algorithm{Name}{Usage}{Complexity}{language}{source code file}{author}

\section{Data Structure}
\Algorithm{DSU Potential}{}{}{cpp}{./src/data_structure/DSU_potential.cpp}{}
\Algorithm{Fenwick}{}{}{cpp}{./src/data_structure/fenwick_nD.cpp}{}
\Algorithm{Segtree}{}{}{cpp}{./src/data_structure/segtree.cpp}{}
\Algorithm{Sweeping Segtree}{}{}{cpp}{./src/data_structure/sweeping_segtree.cpp}{}
\Algorithm{PST}{}{}{cpp}{./src/data_structure/PST.cpp}{}
\Algorithm{pbds}{}{}{cpp}{./src/data_structure/pbds.cpp}{}
\Algorithm{treap}{}{}{cpp}{./src/data_structure/treap.cpp}{}

\section{DP}
\Algorithm{knuth opt}{}{}{cpp}{./src/DP/dnc_opt.cpp}{}
\Algorithm{DnC opt}{}{}{cpp}{./src/DP/dnc_opt.cpp}{}
\Algorithm{SOS DP}{}{}{cpp}{./src/DP/sos_dp.cpp}{}
\Algorithm{hirschberg}{}{}{cpp}{./src/DP/hirschberg.cpp}{}

\section{Geometry}
\Algorithm{Header}{}{}{cpp}{./src/geometry/header.cpp}{}
\Algorithm{Convex Hull}{}{}{cpp}{./src/geometry/convex_hull(monotone_chain).cpp}{}
\input{src/geometry/geometry_theory.tex}

\section{Graph}
\Algorithm{Bellman-Ford}{}{}{cpp}{./src/graph/bellman_ford.cpp}{}
\Algorithm{SPFA}{}{}{cpp}{./src/graph/spfa.cpp}{}
\Algorithm{SCC}{}{}{cpp}{./src/graph/scc.cpp}{}
\Algorithm{2-SAT}{}{}{cpp}{./src/graph/2-SAT.cpp}{}
\Algorithm{Euler Circuit}{}{}{cpp}{./src/graph/euler_circuit.cpp}{}
\Algorithm{C3, C4}{}{}{cpp}{./src/graph/C3, C4.cpp}{}
\Algorithm{PEO}{}{}{cpp}{./src/graph/peo.cpp}{}
\Algorithm{Bimatch}{}{}{cpp}{./src/graph/bimatch.cpp}{}
\Algorithm{Hopcroft Karp}{}{}{cpp}{./src/graph/hopcroft_karp.cpp}{}
\Algorithm{Dinic}{}{}{cpp}{./src/graph/dinic.cpp}{}
\Algorithm{MCMF}{}{}{cpp}{./src/graph/mcmf.cpp}{}
\Algorithm{MCMF(dijkstra)}{}{}{cpp}{./src/graph/mcmf(dijkstra).cpp}{}
\Algorithm{LCA}{}{}{cpp}{./src/graph/lca.cpp}{}
\Algorithm{LCA(RMQ)}{}{}{cpp}{./src/graph/lca(rmq).cpp}{}
\Algorithm{HLD}{}{}{cpp}{./src/graph/hld.cpp}{}
\Algorithm{Virtual Tree}{}{}{cpp}{./src/graph/virtual_tree.cpp}{}
\input{src/graph/graph_theory.tex}

\section{Math}
\Algorithm{Linear Sieve}{}{}{cpp}{./src/math/linear_sieve.cpp}{}
\Algorithm{Multiplicative Function}{}{}{cpp}{./src/math/multiplicative_function.cpp}{}
\Algorithm{Burnside's Lemma}{}{}{cpp}{./src/math/burnside.cpp}{}
\Algorithm{XOR Basis}{}{}{cpp}{./src/math/xor_basis.cpp}{}
\Algorithm{egcd}{}{}{cpp}{./src/math/egcd.cpp}{}
\Algorithm{CRT}{}{}{cpp}{./src/math/crt.cpp}{}
\Algorithm{Miller-Rabin}{}{}{cpp}{./src/math/miller_rabin.cpp}{}
\Algorithm{Pollard's rho}{}{}{cpp}{./src/math/pollard_rho.cpp}{}
\input{src/math/math_theory.tex}

\section{String}
\Algorithm{Rolling Hash}{}{}{cpp}{./src/string/rolling_hash.cpp}{}
\Algorithm{KMP}{}{}{cpp}{./src/string/kmp.cpp}{}
\Algorithm{Z}{}{}{cpp}{./src/string/z.cpp}{}

\section{Misc}
\Algorithm{RMQ}{}{}{cpp}{./src/misc/rmq.cpp}{}
\Algorithm{Deque Trick}{}{}{cpp}{./src/misc/deque_trick.cpp}{}
\Algorithm{Random}{}{}{cpp}{./src/misc/random.cpp}{}
\Algorithm{Time}{}{}{cpp}{./src/misc/time.cpp}{}
\Algorithm{Debug}{}{}{sh}{./src/misc/debug.sh}{}

\end{document}