Can the DP state for this question be considered as DP(pos,t) as if we how many places can be visited from this pos to N with t time left.
Different state for Journet Codeforces
This is just not possible because t ≤ 1e9.
Can the DP state for this question be considered as DP(pos,t) as if we how many places can be visited from this pos to N with t time left.
This is just not possible because t ≤ 1e9.