USACO Guide
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 SubtreesDP on Broken ProfileAdditional DP Optimizations and Techniques
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 AlgorithmCatalan NumbersXOR BasisFracturing SearchGame TheoryPrefix Sums of Multiplicative FunctionsMatroid IntersectionRandomnessInteractive and Communication ProblemsVectorization in C++
Settings

CEOI 2014 - Question

Authors: Andi Qu, Benjamin Qi

Edit This Page

Appears In

  • Advanced - Interactive and Communication Problems
View Problem Statement

Official Analysis

Hint 1

Hint 2

Hint 3

Hint 4

Solution

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