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

Show all messages Hide all messages

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
Mine is O(mlogm) and got AC in 0.109s, 474kb
I used balance binary search tree.
What is your mlogm algorithm?
How did you use it ?
O(mlogn), lazy segment tree, 0.078.

Edited by author 16.03.2014 14:27
Mine is simple tree O(mlog(m)) and accepted time is 0.015
Mine is Q * log(10^9)
Mine is (mlogn), implicit segment tree