The problem statement is :↵
``` We are g↵
"Given a 2D grid with multiple source cells. F, we need to compute for every cell (x, y), we need to compute the minimum cost to any source, where the cost between two cells is defined as the squared Euclidean distance:↵
cost((x,y),(u,v))= = (x−-u)^2 + (y−-v)^2 ↵
```."↵
↵
I am interested inthe reasonunderstanding why dDijkstra would fail suchfails for this task if Iwe start propagation from all source nodes, while keeping only the best_source[x][y] (nearest node to cell{x , y}) for each visited cell.↵
↵
I understand that the issue is related to the non-linearity of the cost function, but I don’t have a strong intuition for whyexactly Dijkstra fails here.this approach is incorrect.↵
↵
What are some goodideasways to think about or models to easily get why it fails?↵
also, any instances of this problemhis behavior?↵
↵
Also, if there are known problems (e.g., on Codeforces or AtCoder) that involve similar ideas, I wouldbe appreciated references.
"Given a 2D grid with multiple source cells
cost((x,y),(u,v))
```
↵
I am interested in
↵
I understand that the issue is related to the non-linearity of the cost function, but I don’t have a strong intuition for why
↵
What are some good
also, any instances of this problem
↵
Also, if there are known problems (e.g., on Codeforces or AtCoder) that involve similar ideas, I would
