Interesting Problem from ACM ICPC [ Asia — Daejeon 2015 ]

Правка en4, от aka.Sohieb, 2016-09-23 21:47:43

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).

Теги acm icpc regionals, cycle detection, odd cycle

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский aka.Sohieb 2016-09-23 21:51:51 0 (published)
en5 Английский aka.Sohieb 2016-09-23 21:51:24 4 Tiny change: 'iefly:**\n\ngiven simpl' -
en4 Английский aka.Sohieb 2016-09-23 21:47:43 6
en3 Английский aka.Sohieb 2016-09-23 21:47:13 7
en2 Английский aka.Sohieb 2016-09-23 21:46:04 498
en1 Английский aka.Sohieb 2016-09-23 21:36:25 47 Initial revision (saved to drafts)