DISQUERY - Distance Query



hide comments
changyouren: 2021-09-30 11:04:32

use persistent segment tree + LCA
your algorithm should O(nlgn) not O(nlgn*lgn)

samarth5611: 2021-09-07 13:45:52

I am getting Wrong answer on test Case 10,
could someone tell me test case

nikhil0010: 2021-07-13 20:26:50

solve codeforces 609E after this problem :)

aldgebu: 2021-03-22 16:47:25

I just print "answer" and I got 10 tests AC. have this task checker or something like that ? Whata fuck re you doin ?

[NG]: You haven't got anything AC. You do realize anyone can view your submission history, don't you?

Last edit: 2021-03-22 23:44:56
rahul_raj8651: 2021-02-05 12:28:00

AC, now back to hot sex with my goat.

Last edit: 2021-02-05 15:52:33
pinku7499: 2020-06-23 10:21:12

How simple...!

shawnliang: 2019-12-21 09:49:58

AC in 2s.why?

abhimanyu_1998: 2019-02-20 20:35:42

binary lifting should do the job

sarwar__05: 2018-09-24 22:49:54

[100002][17] ==> AC in 0.70
[17][100002] ==> AC in 0.55

vaibhav2303: 2018-06-11 13:54:20

Simple sparse table(without binary search) and LCA concept gives AC.


Added by:~!(*(@*!@^&
Date:2009-02-28
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:COI 06