vexorian's blog

Blog of Round #89 and problems C and D
By vexorian, 15 years ago, In English

Shameless plug:
http://vexorian.blogspot.com/2011/10/codeforces-round-89.html

  • Vote: I like it
  • +13
  • Vote: I do not like it

15 years ago, hide # |
 
Vote: I like it +6 Vote: I do not like it
Someone please share how to solve problem E. thanks
→ Reply
15 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it
you use DFS to set direction of all edges and then find strongly conected componetnts
if there are more then one component - print 0
else - print edges
→ Reply