Weak test cases?

Правка en1, от puss_in_boots, 2015-10-18 00:48:22

There is strange problem with test cases in this problem: 429D - Tricky Function.

Author's solution is O(nlog(n)), but you can see this solution: 11245064.

It works O(n2) in worst but doesn't achieve it because of s[i] - s[i + l] < l * 104 or because of some other constraints.

Moreover my O(nlog(n)) doesn't work here: 13704572

What's going on in both cases?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский puss_in_boots 2015-10-18 00:48:22 410 Initial revision (published)