Обсуждение @ 1592. Китайские часы @ Timus Online Judge

Test 14 WA, please help

Послано Kant SU -Dmitry - DIVAN 28 окт 2007 02:59

Re: Test 14 WA, please help

Послано Lifanov Aleksey 31 окт 2007 13:46

I Have TLE on test 14, but my solution work O(n*log(n)).
Qsort and linear algorithm O(n)! I don't understant why TLE.

Re: Test 14 WA, please help

Послано svr 31 окт 2007 14:08

Instead of qsort better O(n) sort using arr[43200] (busket)

Re: Test 14 WA, please help

Послано Skrebnev 17 дек 2007 02:21

or maybe use

for i := 1 to n do
swap(a_[random(n)+1],a_[random(n)+1]);

Re: Test 14 WA, please help

Послано Denis Koshman 20 июл 2008 16:57

It's O(MAXTIME), MAXTIME=12*60*60

Re: Test 14 WA, please help

Послано KantSU: Vashegin Roman 23 июл 2008 21:29

WA 12....=(

Re: Test 14 WA, please help

in promblem say that all clock difrent
but in 14 test some clock have same time and it amount >255 :)

Re: Test 14 WA, please help

Послано Piratek-(akaDK) 15 сен 2008 21:42

xMagGTU Дмитрий Тишкин GPRS писал(a) 30 июля 2008 11:37

in promblem say that all clock difrent
but in 14 test some clock have same time and it amount >255 :)

Judge Look!!!

Re: Test 14 WA, please help

Послано Crash_access_violation 16 дек 2008 20:28

I got WA#14 too :( ... please give me some usefull tests... thX

Обсуждение задачи 1592. Китайские часы