##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Union-Find with sorting
Given an grid of elevations, find the minimum time such that you can swim from to .
At time , you can swim to any cell with elevation . Water rises uniformly across the grid. Example: grid = [[0,2], [1,3]] At , all cells are reachable. Answer: .
This combines Union-Find with time-based activation. Constraints: from to , elevations from to .
