Can Someone please help me out with optimizing my solution?

Question Link -> https://codeforces.me/contest/2037/problem/G

My Solution -> https://codeforces.me/contest/2037/submission/298945671

Its obvious what I am trying to do. I simply create DAG by adding edges between indexes where transition is possible. Then I run Kahn's algo to sort the nodes and then its simple dp to find number of ways to reach the ending node.