Hello guys , I am having trouble solving this problem

You can read problem statement here also.

**Statement**

```
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 :)

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.

Initially, I tried the cycle approach which let to TLE for me. But if you notice it clearly its plain binary Lifting.

Precompute jumps for each node. and then in query node walk or jump in binary value of k. You will get the answer.

SpoilerThanks bro , will try it :)

I was thinking on exactly same line. Though a pure binary lifting approach works.