Обсуждение @ 1742. Тим-билдинг @ Timus Online Judge

how to get ac in 0.031 sec?

Послано muhammad 13 фев 2011 11:09

i just found no of storngly connected components and got ac in 0.562 sec after eliminating stack overflow with pragma.

how to make it so fast as 0.031 sec and so little memory?

Re: how to get ac in 0.031 sec?

Послано Borozdin Kirill 6 дек 2011 18:51

You don't have to find strongly connected components. You can just sort vertices topologically and here you will find an answer :)

Re: how to get ac in 0.031 sec?

Послано Scau_Ly 28 авг 2012 15:33

i just keep getting stack overflow,could you please tell me how to eliminate it?

Re: how to get ac in 0.031 sec?

Послано Mayank Pratap Singh 6 дек 2016 15:06

But for topological sorting, graph must be DAG(directed acyclic)?

Обсуждение задачи 1742. Тим-билдинг