I shocked! My program used 2 dfs(for find conecting components). Thats all. n<=200. Dfs work by O(n+m).
Why I have TL???
Please help me, I really dont understand, where my mistakes.

If you had TL#4 then increase your massivs.
Because, if you use graf, then quantity of edges may 40000

What should we search? Components of strong connectivity or cycles?
Please help me...

If I search for components of strong connectivity that I receive WA#4. When I search for cycles I receive WA#5. What should I search?
Please help me.

I got AC!!!