weak test data or weak algorithm analysis?

Правка en7, от NikaraBika, 2017-09-08 10:07:00

Hello :)
This(14612490) is a brute force solution for 506D - Mr. Kitayuta's Colorful Graph and it's time complexity is absolutely O(n^2). (n <= 100 * 1000)
I submitted it and got AC!
Could someone help me? Why did it happen? Weak test data or fast servers?
(That code must get TLE if we give it a path of size 100 * 1000 and all edges with the same color without any query)

Теги tle, analysis of problem

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en7 Английский NikaraBika 2017-09-08 10:07:00 62
en6 Английский NikaraBika 2015-12-02 22:14:32 36
en5 Английский NikaraBika 2015-12-02 08:56:26 7 Tiny change: 'Hello\nThis([su' -> 'Hello :)<br>\nThis([su'
en4 Английский NikaraBika 2015-12-02 08:52:20 2
en3 Английский NikaraBika 2015-12-02 08:51:37 54
en2 Английский NikaraBika 2015-12-02 08:50:50 17
en1 Английский NikaraBika 2015-12-02 08:50:23 449 Initial revision (published)