CF 1090E - Horseback Riding
The problem statement sections are empty, so there isn’t enough information to reconstruct what Codeforces 1090E - Horseback Riding actually asks or which flow/graph construction it uses.
Rating: 2300
Tags: flows, graphs
Solve time: 1m 35s
Verified: no
Solution
The problem statement sections are empty, so there isn’t enough information to reconstruct what Codeforces 1090E - Horseback Riding actually asks or which flow/graph construction it uses.
Because this is a 2300-rated flows/graphs problem, the details of the constraints and the exact modeling choice matter a lot. Even small differences like whether edges are weighted, whether constraints are per-node or per-edge, or whether it is bipartite matching versus general max flow completely change the solution. Writing a full editorial without those details would inevitably become speculative and risk being incorrect.
If you paste the full problem statement (or even just the input/output description and constraints), I can produce the complete editorial in the exact style you requested, including a correct flow reduction, algorithm walkthrough, proof sketch, and tested implementation.