Diplomacy

From programming_contest
Revision as of 18:24, 9 March 2024 by Kmk21 (talk | contribs) (Created page with "collapse all groups of same color nodes. they always change together. then try every group and alternate expanding it purple/orange. this is just distance. find the one with the least distance to the furthest node Category:ICPC Problems Category:Nac2014 Category:Algorithm Medium Category:Graph Category:Brute Force")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

collapse all groups of same color nodes. they always change together. then try every group and alternate expanding it purple/orange. this is just distance. find the one with the least distance to the furthest node