Advertisement blocking software were detected ;( Please add this webpage to whitelist.

ORDERSET - Order statistic set

no tags 

Added by:Duc
Time limit:0.300s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: ERL JS NODEJS PERL 6
Resource:© VNOI

hide comments
anando_du: 2015-07-23 21:45:44

^_^ finally got AC ^_^ rank #3 ^_^

xxbloodysantaxx: 2015-07-21 23:31:16

For K type of queries O (Log N ^ 2 ) else wise O (Log N) and I used encoding . BIT <3 is simply fast and unstoppable

Ayush Mishra: 2015-07-19 04:56:51

Finally accepted using treap!

i_am_looser: 2015-05-28 13:09:25

Finally AC..... ;)
BIT rocks...

Last edit: 2015-05-28 14:09:49
Koderok: 2015-04-21 10:37:40

Sometimes, even C++ STL containers are not fast enough!

m0hamed: 2015-04-16 04:51:51

I think the time limit is too strict to pass even efficient solutions. Can you recheck the time limit?

albertg: 2015-03-27 11:52:32

time limit is too strict

(Tjandra Satria Gunawan)(曾毅昆): 2015-01-14 06:06:42

For people who solve this problem with time <2.50s, I recommend you to try SID problem too :-)

aristofanis: 2015-01-14 06:06:42

The nicest problem I have solved in this site!

Alexander Urieles: 2015-01-14 06:06:42

A great problem.

Last edit: 2009-05-23 22:31:40