Training Team 2025 Schedule

orientation, competitive programming and Big-O

topological Sort, DP on trees/directed acyclic graphs, bitwise DP, rolling array

shell command and usage, file management, program development

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

constructive algorithms, machine building tasks, introduction to interactive tasks

revision on range query structures, lazy propagation, tries, persistent data structures, miscellanous tricks

graph connectivity: dfs trees, cut edge, articulation point, bridge-connected component, strongly/weakly connected component, graph shrinking trick

introduction to communication tasks / output-only tasks

DP optimization tricks: partial sum / heap speed up, monotone queue, convex hull using geometric approach, divide and conquer DP

euler path, euler cycle, centroid decomposition, heavy-light decomposition

CPU, memory, instruction set architecture, MIPS programming, optimization

maximum flow, minimum cut, set partition model, graph modeling techniques

bipartite matching, hall’s marriage theorem, flows with demands, related problems

combinatorics: combinatorial thinking, sequences, bijection, sums and expected value

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