Обсуждение @ 1196. Экзамен по истории @ Timus Online Judge

Is it possible to get faster than O(m log n) time?

Послано Junjie Liang 7 мар 2002 14:14

Re: Is it possible to get faster than O(m log n) time?

Послано raxtinhac 7 мар 2002 14:26

> I used algorithm with O(m log n) and got AC. But of course, when
you search, sometime you can see that it 's not necessary to
continue. Ex : if student's year < teacher's first year -> ignor this
year.

hashing is another idea ,but , but ... (-)

Послано MadPsyentist/Sam 7 мар 2002 14:38

Re: Is it possible to get faster than O(m log n) time?

Послано neoGolden 29 ноя 2006 16:19

My algorhitm is O(m). But it is not work :)

Edited by author 29.11.2006 16:19

Edited by author 29.11.2006 16:19

Re: Is it possible to get faster than O(m log n) time?

Послано Alias (Alexander Prudaev) 18 фев 2007 12:47

yes, use hash

Обсуждение задачи 1196. Экзамен по истории