Обсуждение @ 1439. Поединок с И-Так-Понятно-Кем @ Timus Online Judge

Hey.What is the Time Complexity of your algorithm?

Послано sashimi 5 апр 2006 11:49

Mine is O(m*logn*logn)and got AC in 0.75s,958 KB.
I used a BST,a Hash table and Binary Search.
I think my algorithm is not good enough and I'm interested in how you solve this.

EM:tczw@sina.com

Re: Hey.What is the Time Complexity of your algorithm?

Послано H.H.Quan( DHSP ) 10 апр 2006 19:10

Mine is O(mlogm) and got AC in 0.109s, 474kb
I used balance binary search tree.

Re: Hey.What is the Time Complexity of your algorithm?

Послано Ludovic 19 сен 2006 13:01

What is your mlogm algorithm?

Re: Hey.What is the Time Complexity of your algorithm?

Послано Zhandos 14 апр 2011 09:25

How did you use it ?

Re: Hey.What is the Time Complexity of your algorithm?

Послано adamant 23 фев 2014 15:54

O(mlogn), lazy segment tree, 0.078.

Edited by author 16.03.2014 14:27

Re: Hey.What is the Time Complexity of your algorithm?

Послано Adhambek 15 сен 2015 21:48

Mine is simple tree O(mlog(m)) and accepted time is 0.015

Re: Hey.What is the Time Complexity of your algorithm?

Послано Umaru Doma 6 июл 2016 15:45

Mine is Q * log(10^9)

Re: Hey.What is the Time Complexity of your algorithm?

Послано NormanXpp 26 ноя 2016 23:23

Mine is (mlogn), implicit segment tree

Обсуждение задачи 1439. Поединок с И-Так-Понятно-Кем