|
|
back to boardHey.What is the Time Complexity of your algorithm? 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? 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? Posted by Ludovic 19 Sep 2006 13:01 What is your mlogm algorithm? Re: Hey.What is the Time Complexity of your algorithm? Posted by Zhandos 14 Apr 2011 09:25 How did you use it ? Re: Hey.What is the Time Complexity of your algorithm? Posted by adamant 23 Feb 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? Mine is simple tree O(mlog(m)) and accepted time is 0.015 Re: Hey.What is the Time Complexity of your algorithm? Mine is Q * log(10^9) Re: Hey.What is the Time Complexity of your algorithm? Mine is (mlogn), implicit segment tree |
|
|