problem:
giving a grid of size 1e6*1e6 (in the beginning its all inf), we have 2 queries:
1 x y p: assign a[x][y]=p
2 x1 y1 x2 y2: print minimum element of subgrid start from (x1,y1) and end at (x2,y2)
I have some ideas like Dynamic 2D segment tree but I don't really sure thats work, can anyone suggests some other sol:>








It's the exact definition of the dynamic 2D segment tree