Обсуждение @ 1028. Звёзды @ Timus Online Judge

Показать все сообщения Спрятать все сообщения

Maybe there are weak tests!? Lomir 1 июл 2007 04:10

My solution with O(n*x) get AC in 0.171.
However for max test it would have 15000*32000=480 000 000 iterations.
On my not so fast PC(ADM 1800+) it works 1 - 1.3 sec, so i think it wouldn't pass TL of 0.25sec.

The test is:
15000
32000 1
32000 2
32000 3
..........
32000 15000

Re: Maybe there are weak tests!? svr 1 июл 2007 10:41

Very good information.
Admins should pay attention on it.
This question about real effectivness of our algorithms.

Edited by author 01.07.2007 10:41

Edited by author 01.07.2007 10:41

Your test was added. Thank you. (-) Sandro (USU) 2 июл 2007 01:46

Re: Your test was added. Thank you. (-) Lomir 26 июл 2007 15:53

Nevertheless some other algo with complexivity O(n^2) works well...

Re: Your test was added. Alexander Georgiev 26 июл 2007 20:20

... which is quite sad for the ones that spent all eternity, which means about 10 minutes, to write the most straight-forward index tree and produce an N*logN algorithm...

Re: Your test was added. Alexander J. Villalba G. 14 сен 2009 07:46

10 minutes are not forever
eternity are days, months, years, centuries, millennia ...

Обсуждение задачи 1028. Звёзды