BCCs and 2CCs

Catalan Numbers

DP on Trees - Combining Subtrees

Querying for the minimum and number of occurrences of minimum in a range

Counting Minimums with Segment Tree

Finding nodes that must be visited along any path.

Critical

Dynamic programming on grid boundary states.

DP on Broken Profile

Additional dynamic programming techniques and optimizations like Knuth's optimization.

Additional DP Optimizations and Techniques

Visiting all edges of a graph exactly once.

Eulerian Tours

A formula for finding the number of faces in a planar graph.

Euler's Formula

Extended Euclidean Algorithm

More Complex Operations Using FFT

Introduction to Fast Fourier Transform

Flow with Lower Bounds

A simple solution to "Robotic Cow Herd" that generalizes.

Fracturing Search

Solving games that are usually two-player to find the winner.

Game Theory

Interactive and Communication Problems

Link Cut Tree

Lagrangian Relaxation

LineContainer

Matroid Intersection

Introduces maximum flow as well as flow with lower bounds.

Maximum Flow

Triangle Inequality, Johnson's Algorithm, and Min Cost Flow

Minimum Cost Flow

Minimum Cut

Erasing from non-amortized insert-only data structures.

Offline Deletion

What if data structures could time travel?

Persistent Data Structures

Prefix Sums of Number-Theoretic Functions (Part 1)

Prefix Sums of Number-Theoretic Functions (Part 2)

Subsets of nodes in directed graphs where each node in a subset can reach each other node in the subset.

Strongly Connected Components

Returning to Bellman-Ford and Floyd-Warshall.

Shortest Paths with Negative Edge Weights

Segment Tree Beats

Slope trick refers to a way to manipulate piecewise linear convex functions. Includes a simple solution to USACO Landscaping.

Slope Trick

Max Suffix Query with Insertions Only

Knuth-Morris-Pratt and Z Algorithms (and a few more related topics).

String Searching

Suffix Automata, Suffix Trees, and Palindromic Trees

String Suffix Structures

Quickly sorting suffixes of a string and its applications

Suffix Array

Treaps

Vectorization in C++

Efficiently querying for the kth minimum element in a subarray.

Wavelet Tree

XOR Basis

Using randomized algorithms to solve problems.

Randomness

Extending Range Queries to 2D (and beyond).

2D Range Queries

Binary Jumping

Examples of how bitsets give some unintended solutions on recent USACO problems.

(Optional) Bitsets

Decomposing a tree to facilitate path computations.

Centroid Decomposition

Final tips for Platinum and additional practice problems.

Additional Practice for USACO Platinum

Smallest convex polygon containing a set of points on a grid.

Convex Hull

A way to find the maximum or minimum value of several convex functions at given points.

Convex Hull Trick

Using Divide & Conquer as a DP Optimization.

Divide & Conquer - DP

Using Divide & Conquer to answer offline or online range queries on a static array.

Divide & Conquer - SRQ

Solving subset sum problems efficiently with DP.

Sum over Subsets DP

Geometry Primitives

Heavy-Light Decomposition

Repeatedly multiplying a square matrix by itself.

Matrix Exponentiation

Small-To-Large Merging

The inclusion-exclusion principle is a counting technique that generalizes the formula for computing the size of union of n finite sets.

Inclusion-Exclusion Principle

Lazy updates on segment trees and two binary indexed trees in conjunction.

Range Update Range Query

Solving 2D grid problems using 1D range queries.

Range Queries with Sweep Line

Walking on a Segment Tree, Non-Commutative Combiner Functions

More Applications of Segment Tree

Sparse Segment Trees

Splitting up data into smaller chunks to speed up processing.

Square Root Decomposition

Sweep Line

Compressing a tree to only the necessary nodes.

Virtual Tree

Decomposing Kruskal's algorithm to solve problems about minimum/maximum edge weights.

Kruskal Reconstruction Tree

DP on Trees - Solving For All Roots

Combinatorics

Final tips for Gold and additional practice problems.

Additional Practice for USACO Gold

Incorporating custom comparators into standard library containers.

(Optional) Sorted Sets with Custom Comparators

DP problems that require iterating over subsets.

Bitmask DP

Solving a DP problem on every contiguous subarray of the original array.

Range DP

DP on Trees - Introduction

The Disjoint Set Union (DSU) data structure, which allows you to add edges to a graph and test whether two vertices of the graph are connected.

Disjoint Set Union

Finding the number of integers in a range that have a property.

Digit DP

Using the information that one integer evenly divides another.

Divisibility

Quickly testing equality of substrings or sets with a small probability of failure.

Hashing

Maintaining collections of distinct elements with hashing.

(Optional) Hashmaps

Speeding up naive recursive solutions with memoization.

Introduction to DP

Finding the next element smaller or larger than a specified key in a sorted set, and using iterators with sorted sets.

More Operations on Sorted Sets

Problems that can be modeled as filling a limited-size container with items.

Knapsack DP

Finding and using the longest increasing subsequence of an array.

Longest Increasing Subsequence

Finding a subset of the edges of a connected, undirected, edge-weighted graph that connects all the vertices to each other of minimum total weight.

Minimum Spanning Trees

Problems involving dividing the search space into two.

Meet In The Middle

Modular Arithmetic

Segment Tree, Binary Indexed Tree, and Order Statistic Tree (in C++).

Point Update Range Sum

Counting the number of "special" paths on a grid, and how some string problems can be solved using grids.

Paths on Grids

Bellman-Ford, Floyd-Warshall, and Dijkstra.

Shortest Paths with Non-Negative Edge Weights

Maintaining data over consecutive subarrays.

Sliding Window

A data structure that only allows insertion and deletion at one end.

Stacks

Using ternary or binary search to find the mode of unimodal functions.

Optimizing Unimodal Functions

Ordering the vertices of a directed acyclic graph such that each vertex is visited before its children.

Topological Sort

Flattening a tree into an array to easily query and update subtrees.

Euler Tour Technique

Introduces how BFS can be used to find shortest paths in unweighted graphs.

Shortest Paths with Unweighted Edges

Binary searching on arbitrary monotonic functions.

Binary Search

Efficiently searching for a value in a sorted array.

Binary Search on a Sorted Array

Final tips for Silver and additional practice problems.

Additional Practice for USACO Silver

Finding connected components in a graph represented by a grid.

Flood Fill

Directed graphs in which every vertex has exactly one outgoing edge.

Introduction to Functional Graphs

Traversing a graph with depth first search and breadth first search.

Graph Traversal

Solving greedy problems by sorting the input.

Greedy Algorithms with Sorting

Six bitwise operators and the common ways they are used.

Intro to Bitwise Operators

Introducing a special type of graph: trees.

Introduction to Tree Algorithms

problem

FocusProblem

CPPSection

JavaSection

LanguageSection

Resource

Resources

Warning

problems

Problems

Finding a Centroid

"use strict";
const {Fragment: _Fragment, jsx: _jsx, jsxs: _jsxs} = arguments[0];
const frontmatter = undefined;
function _createMdxContent(props) {
 const _components = {
 a: "a",
 code: "code",
 p: "p",
 pre: "pre",
 strong: "strong",
 ...props.components
 }, {CPPSection, JavaSection, LanguageSection, MATHSPAN, PySection} = _components;
 if (!CPPSection) _missingMdxReference("CPPSection", true);
 if (!JavaSection) _missingMdxReference("JavaSection", true);
 if (!LanguageSection) _missingMdxReference("LanguageSection", true);
 if (!MATHSPAN) _missingMdxReference("MATHSPAN", true);
 if (!PySection) _missingMdxReference("PySection", true);
 return _jsxs(_Fragment, {
 children: [_jsxs(_components.p, {
 children: [_jsx(_components.strong, {
 children: "Time Complexity"
 }), ": ", _jsx(MATHSPAN, {
 className: "language-math math-inline",
 latex: "\\mathcal O(N)",
 children: "<math xmlns=\"http://www.w3.org/1998/Math/MathML\"><semantics><mrow><mi mathvariant=\"script\">O</mi><mo stretchy=\"false\">(</mo><mi>N</mi><mo stretchy=\"false\">)</mo></mrow><annotation encoding=\"application/x-tex\">\\mathcal O(N)</annotation></semantics></math>O(N)"
 })]
 }), "\n", _jsxs(_components.p, {
 children: ["For more information about centroids and how to find/use them, see\n", _jsx(_components.a, {
 href: "/plat/centroid",
 children: "their module"
 }), "."]
 }), "\n", _jsxs(LanguageSection, {
 children: [_jsx(CPPSection, {
 children: _jsx(_components.pre, {
 children: _jsx(_components.code, {
 className: "language-cpp",
 children: "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int maxn = 2e5 + 5;\nint n; // number of nodes\nvector<int> g[maxn]; // graph\nint s[maxn]; // size of subtree\n\nvoid dfs_size(int cur, int par) {\n\ts[cur] = 1;\n\tfor (int chi : g[cur]) {\n\t\tif (chi != par) {\n\t\t\tdfs_size(chi, cur);\n\t\t\ts[cur] += s[chi];\n\t\t}\n\t}\n}\n\nint get_centroid(int cur, int par) {\n\tfor (int chi : g[cur]) {\n\t\tif (chi != par) {\n\t\t\tif (s[chi] * 2 > n) { return get_centroid(chi, cur); }\n\t\t}\n\t}\n\treturn cur;\n}\n\nint main() {\n\tcin >> n;\n\tfor (int i = 1; i < n; i++) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tg[a].push_back(b);\n\t\tg[b].push_back(a);\n\t}\n\tdfs_size(1, -1);\n\tint centroid = get_centroid(1, -1);\n\tcout << centroid << '\\n';\n}\n"
 })
 })
 }), _jsx(JavaSection, {
 children: _jsx(_components.pre, {
 children: _jsx(_components.code, {
 className: "language-java",
 children: "import java.io.*;\nimport java.util.*;\n\npublic class Centroid {\n\tprivate static int n; // number of nodes\n\tprivate static List<List<Integer>> graph;\n\tprivate static int[] sub_array_size;\n\n\tprivate static void dfs_size(int curr, int prev) {\n\t\t// size of a subtree is the sum of the sizes of all child subtrees + 1.\n\t\tsub_array_size[curr] = 1;\n\t\tfor (int next : graph.get(curr)) {\n\t\t\tif (next == prev) { continue; }\n\t\t\tdfs_size(next, curr);\n\t\t\tsub_array_size[curr] += sub_array_size[next];\n\t\t}\n\t}\n\n\tprivate static int get_centroid(int curr, int prev) {\n\t\t/*\n\t\t * if possible, move towards the adjacent node with the subtree size\n\t\t * greater than n / 2. Otherwise, we have found our centroid.\n\t\t */\n\t\tfor (int next : graph.get(curr)) {\n\t\t\tif (next == prev) { continue; }\n\t\t\tif (sub_array_size[next] * 2 > n) { return get_centroid(next, curr); }\n\t\t}\n\t\treturn curr;\n\t}\n\n\tpublic static void main(String[] args) {\n\t\tKattio io = new Kattio();\n\t\tn = io.nextInt();\n\t\tgraph = new ArrayList<>();\n\t\tfor (int i = 0; i <= n; i++) { graph.add(new ArrayList<>()); }\n\t\tsub_array_size = new int[n + 1];\n\n\t\tfor (int i = 0; i < n - 1; i++) {\n\t\t\tint a = io.nextInt(), b = io.nextInt();\n\t\t\tgraph.get(a).add(b);\n\t\t\tgraph.get(b).add(a);\n\t\t}\n\n\t\tdfs_size(1, -1);\n\n\t\tio.println(get_centroid(1, -1));\n\n\t\tio.close();\n\t}\n\n\t//BeginCodeSnip{Kattio}\n\tstatic class Kattio extends PrintWriter {\n\t\tprivate BufferedReader r;\n\t\tprivate StringTokenizer st;\n\t\t// standard input\n\t\tpublic Kattio() { this(System.in, System.out); }\n\t\tpublic Kattio(InputStream i, OutputStream o) {\n\t\t\tsuper(o);\n\t\t\tr = new BufferedReader(new InputStreamReader(i));\n\t\t}\n\t\t// USACO-style file input\n\t\tpublic Kattio(String problemName) throws IOException {\n\t\t\tsuper(problemName + \".out\");\n\t\t\tr = new BufferedReader(new FileReader(problemName + \".in\"));\n\t\t}\n\t\t// returns null if no more input\n\t\tpublic String next() {\n\t\t\ttry {\n\t\t\t\twhile (st == null || !st.hasMoreTokens())\n\t\t\t\t\tst = new StringTokenizer(r.readLine());\n\t\t\t\treturn st.nextToken();\n\t\t\t} catch (Exception e) { }\n\t\t\treturn null;\n\t\t}\n\t\tpublic int nextInt() { return Integer.parseInt(next()); }\n\t\tpublic double nextDouble() { return Double.parseDouble(next()); }\n\t\tpublic long nextLong() { return Long.parseLong(next()); }\n\t}\n\t//EndCodeSnip\n}\n"
 })
 })
 }), _jsx(PySection, {
 children: _jsx(_components.pre, {
 children: _jsx(_components.code, {
 className: "language-py",
 children: "MAX_N = 200000\ng = [[] for i in range(MAX_N + 1)] # graph\nsubtree_size = [0 for i in range(MAX_N + 1)] # size of subtree\n\n\ndef dfs_size(curr: int, parent: int) -> None:\n\t\"\"\"calculates all subtree sizes (sum of child sizes + 1)\"\"\"\n\tsubtree_size[curr] = 1\n\tfor child in g[curr]:\n\t\tif child != parent:\n\t\t\tdfs_size(child, curr)\n\t\t\tsubtree_size[curr] += subtree_size[child]\n\n\ndef get_centroid(curr: int, parent: int) -> int:\n\t\"\"\"\n\tif possible, move towards the adjacent node with the subtree size\n\tgreater than n / 2. Otherwise, we have found our centroid.\n\t\"\"\"\n\tfor child in g[curr]:\n\t\tif child != parent:\n\t\t\tif subtree_size[child] * 2 > n:\n\t\t\t\treturn get_centroid(child, curr)\n\treturn curr\n\n\nn = int(input()) # number of nodes\nfor i in range(1, n):\n\ta, b = map(int, input().split())\n\tg[a].append(b)\n\tg[b].append(a)\n\ndfs_size(1, -1)\n\nprint(get_centroid(1, -1))\n"
 })
 })
 })]
 })]
 });
}
function MDXContent(props = {}) {
 const {wrapper: MDXLayout} = props.components || ({});
 return MDXLayout ? _jsx(MDXLayout, {
 ...props,
 children: _jsx(_createMdxContent, {
 ...props
 })
 }) : _createMdxContent(props);
}
return {
 frontmatter,
 default: MDXContent
};
function _missingMdxReference(id, component) {
 throw new Error("Expected " + (component ? "component" : "object") + " `" + id + "` to be defined: you likely forgot to import, pass, or provide it.");
}

Join the USACO Forum!