Tight Night: Difference between revisions

From programming_contest
Jump to navigation Jump to search
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..."
 
(No difference)

Latest revision as of 05:29, 27 August 2016

  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