Tight Night

From programming_contest
Revision as of 05:29, 27 August 2016 by imported>Kmk21 (Created page with "#BFS to find all the places a night can go #calculate Bi-connected components #If the start and end are in the same BCC, the answer is NO, else YES Category:ICPC Problems...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
  1. BFS to find all the places a night can go
  2. calculate Bi-connected components
  3. If the start and end are in the same BCC, the answer is NO, else YES
Retrieved from "https://wiki.speedyguy17.info/index.php?title=Tight_Night&oldid=804"