Interesting Problem from ACM ICPC [ Asia — Daejeon 2015 ]

Revision en6, by aka.Sohieb, 2016-09-23 21:51:51

Hello,

How to solve problem Odd Cycle from ACM-ICPC Asia — Daejeon regional contest.

The statement briefly:

Given simple directed graph having no self-loops or multiple edges, detect if it has any directed odd cycle (cycle with odd length) and if yes print description of an arbitrary odd cycle of the input graph.

The graph has n nodes ( n <= 100000 ) , m edges ( m <= 1000000).

Tags acm icpc regionals, cycle detection, odd cycle

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English aka.Sohieb 2016-09-23 21:51:51 0 (published)
en5 English aka.Sohieb 2016-09-23 21:51:24 4 Tiny change: 'iefly:**\n\ngiven simpl' -
en4 English aka.Sohieb 2016-09-23 21:47:43 6
en3 English aka.Sohieb 2016-09-23 21:47:13 7
en2 English aka.Sohieb 2016-09-23 21:46:04 498
en1 English aka.Sohieb 2016-09-23 21:36:25 47 Initial revision (saved to drafts)