Hello guys , I am having trouble solving this problem
You can read problem statement here also.
Statement
So , any hint to solve this problem will be grateful.
Thanks in advance :)
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hello guys , I am having trouble solving this problem
You can read problem statement here also.
You are playing a game consisting of n planets. Each planet has a teleporter to another planet (or the planet itself).
Your task is to process q queries of the form: when you begin on planet x and travel through k teleporters, which planet will you reach?
n , q can be upto 2.10^5.
k can be upto 10^9.
So , any hint to solve this problem will be grateful.
Thanks in advance :)
Name |
---|
Hey this is a classic Binary Lifting problem.
my own explanation for me
See if you can understand it and try the problem on ur own. Cheers
Hey bro , Here is what I had tried.
Detect all cycles and keep track of all cycles where each node in cycle is given node no.
then for node x in query , if x is already part of some cycle then it's very easy to ans. the kth node.
but for case where node isn't part of any cycle , I tried binary lifting on inverted tree (in which edge causing cycles are erased.) FOR THIS CASE , I am unable to code.
I was thinking on exactly same line. Though a pure binary lifting approach works.