In the heavy light decomposition explanation, what if the node for which we have to handle the get(v) query is heavy? In that case, the complexity would be O(number of edges from v) and not O(√n).
Read more… (36 words)
Active In
Competitive Programming
International Olympiad in Informatics
Artificial Intelligence
Algorithms and Data Structures
Computer Vision
Featured Contributions
NaN.
discussion
Sqrt-Decomposition [Tutorial]
I found this tutorial helpful for people learning Sqrt-Decomposition - http://acm.math.spbu.ru/~sk1/mm/lections/mipt2016-sqrt/mipt-2016-burunduk1-sqrt.en.pdf
This tutorial contains tutorial on -
Read more…(49 words)
reply in this discussion
NaN.
discussion
[INOI1302] Sequence Land (INOI 2013: India)
Constraints: The values in the ids are <= 10^9, not <= 109. (CodeChef has a typo).
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(49 words)
reply in this discussion
NaN.
discussion
[INOI1302] Sequence Land (INOI 2013: India)
Constraints: The values in the ids are <= 10^9, not <= 109. (CodeChef has a typo).
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(49 words)
reply in this discussion
Can anyone tell me why my code is getting a runtime error on every test case?
Thanks in advance!
Read more… (20 words)
NaN.
discussion
[ZCO16001] Bookshelves (ZCO 2016: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
I'm getting WA for the second subtask and can't spot my problem. Can someone please help me?
This is my code-
Read more… (27 words)