ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1439. Battle with You-Know-Who

Hey.What is the Time Complexity of your algorithm?
Posted by sashimi 5 Apr 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?
Posted by H.H.Quan( DHSP ) 10 Apr 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?
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?
Posted by Adhambek 15 Sep 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?
Posted by Umaru Doma 6 Jul 2016 15:45
Mine is Q * log(10^9)
Re: Hey.What is the Time Complexity of your algorithm?
Posted by NormanXpp 26 Nov 2016 23:23
Mine is (mlogn), implicit segment tree