Leetcode 2836. Maximize Value of Function in a Ball Passing Game

Given a functional directed graph defined by receiver (each node points to one node), choose a start index to maximize the sum of visited node indices after k passes; the core challenge is efficiently handling long walks that traverse tails into cycles and accumulating sums for very large k (n ≤ 1e5, k ≤ 1e10).