Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

IOI 1995: Street Race

Правка en1, от lightcode, 2016-01-27 05:09:14

Hello kids,

I am having a bit trouble with this problem from the IOI 1995. I solved part (1) by removing each node and checking for connectivity, but I cannot know how to solve part two, or give some reformulating in terms of graph theory. I cannot really understand what this part B is saying or asking for. (Some simple condition like part (1))

Does anyone have any ideas?

Thanks very much!

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский lightcode 2016-01-27 05:09:14 461 Initial revision (published)