Finding if there is an odd length path between any 2 vertices in a graph

Revision en1, by emoji, 2016-12-29 13:26:31

I have found a really interesting problem http://mirror.codeforces.com/problemset/problem/97/E but i am not able to solve it in the required time complexity. Can someone please help me in solving the problem.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English emoji 2016-12-29 14:07:24 8
en2 English emoji 2016-12-29 13:41:02 277
en1 English emoji 2016-12-29 13:26:31 328 Initial revision (published)