Data Structures
Max Suffix Query with Insertions OnlyWavelet TreeCounting Minimums with Segment TreeSegment Tree BeatsPersistent Data StructuresTreaps
Convexity
LineContainerLagrangian RelaxationSlope Trick
Graphs
Shortest Paths with Negative Edge WeightsEulerian ToursBCCs and 2CCsStrongly Connected ComponentsOffline DeletionEuler's FormulaCriticalLink Cut Tree
Dynamic Programming
DP on Trees - Combining SubtreesAdditional DP Optimizations and TechniquesSum over Subsets DP
Flows
Maximum FlowMinimum CutFlow with Lower BoundsMinimum Cost Flow
Polynomials
Introduction to Fast Fourier TransformMore Complex Operations Using FFT
Strings
String SearchingSuffix ArrayString Suffix Structures
Misc. Topics
Extended Euclidean AlgorithmXOR BasisFracturing SearchGame TheoryPrefix Sums of Multiplicative FunctionsMatroid IntersectionInteractive and Communication ProblemsVectorization in C++

Table of Contents

Edit on Github

IOI 2019 - Data Transfer

Author: Andi Qu

Table of Contents


Edit on Github

Let's just focus on subtask 2, since subtask 1's solution is essentially the same.

Hint 1

Hint 2

Hint 3

Solution

We're essentially just creating a Hamming code.

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Join Forum

Give Us Feedback on IOI 2019 - Data Transfer!