Codeforces — 510 C — Foxes and Names.

Revision en1, by sidchelseafan, 2015-06-19 12:45:00

Hello,

I was trying this problem 510C - Fox And Names, basically it asks us to do a topological sort on a DAG. I used a modified

DFS to do that — 11664540.

I do a DFS to check for a cycle, then I do a topological sort on the DAG if there are no cycles. But I was getting

WA 12th case. I tried reading others' solutions but couldn't find what was wrong with my code. I then used an O(V^2)

topological sort and it passed. Can someone point my mistake. Thanks , Help much appreciated :)

Tags topological sort, dfs, graphs

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English sidchelseafan 2015-06-19 12:45:26 4 (published)
en1 English sidchelseafan 2015-06-19 12:45:00 572 Initial revision (saved to drafts)