Training Team 2024 Schedule

orientation, competitive programming and Big-O

binary heap, binary search tree, hash table, disjoint-set union-find

shell command and usage, file management, program development

discussion of classical DP problems: knapsack, matrix multiplication, etc.

useful C++ features, STL functions/containers: bitset, policy-based tree, map, set, etc.

shortest path algorithms for weighted graphs, minimum spanning tree

Number Theory: modular arithmetic, greatest common divisor, Extended Euclidean algorithm, prime numbers, fast exponential

DP on trees/directed acyclic graphs, bitwise DP, DP dimension reduction techniques

sparse table, segment tree, lazy propagation, binary indexed tree

constructive algorithms, introduction to interactive tasks

algorithms on tree: application on pre-order/post-order, lowest common ancestor, tree diameter

DP optimization tricks: monotone queue, convex hull using geometric approach, divide and conquer

combinatorics and probability: nCr, nPr, sequences, inclusion/exclusion, expected value, counting

Graph Connectivity: cut edge, articulation point, bridge-connected component, strongly/weakly connected component, graph shrinking trick. Euler path, cycle.

2-d binary indexed tree, cdq d&c, persistent data structures

ad-hoc, and using various skills to tackle interesting problems

introduction to communication tasks / output-only tasks

centroid Decomposition, heavy-light decomposition