https://cses.fi/problemset/task/1664 need help on how to solve this problem? I am storing for each i the closest time when a picture finishes if we start at i. This preprocess is O(n) but query worst case is o(n).help pls!

Can someone upload their solutions of the CSES problem set on github or any other site. Thank You!