Обсуждение @ 1934. Чёрная метка @ Timus Online Judge

Viktor TLE [3] // Задача 1934. Чёрная метка 17 дек 2012 20:19

Don't use cin/cout or Scanner in java.

Andrew Sboev [USU] Re: TLE [2] // Задача 1934. Чёрная метка 17 дек 2012 23:02

Seriously? 10^5, it's so few! Only cin, only hardcore!
You shoudn't use cin/cout in every problem, in which n is big enough(n > 1000, for example)

Edited by author 17.12.2012 23:02

ASK Re: TLE // Задача 1934. Чёрная метка 15 фев 2014 15:21

cin/cout is not TLE, as long as you do
cin.sync_with_stdio(false);

jacketinsysu Re: TLE // Задача 1934. Чёрная метка 1 сен 2015 07:26

Yes, you may think that the number of edge can be as large as n * (n - 1) / 2, which is O(n^2), where n is the number of vertex of the graph. (10^5)^2 = 10^10. is a rather large scale data for 1 second.

Обсуждение задачи 1934. Чёрная метка