338. Familystrokes !new! Jun 2026

Since the algorithm enumerates every node once and classifies it correctly, the computed sum is both (no drawing can use fewer strokes) and sufficient (the construction described in the problem statement uses exactly that many). ∎

Proof. Directly from Lemma 2 (vertical) and Lemma 3 (horizontal). ∎ 338. FamilyStrokes

Since the algorithm enumerates every node once and classifies it correctly, the computed sum is both (no drawing can use fewer strokes) and sufficient (the construction described in the problem statement uses exactly that many). ∎

Proof. Directly from Lemma 2 (vertical) and Lemma 3 (horizontal). ∎

Privacidad