Matrix and queries

Revision en1, by ___---___, 2017-02-15 16:50:16

Given an n x m matrix filled with non negative values. Each value in a cell represents a weighted edge to reach each of its adjacent cells. We need to calculate the shortest path from 1,1 to n,m after each of the q queries. They are of two types Type 1 : block cell x,y Type 2 : unblock cell x,y How can we achieve this? n,m <= 1000 q <= 1000

Tags graphs, shortest paths, matrix, queries

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English ___---___ 2017-02-15 16:52:44 0 Tiny change: 'ypes\nType 1 : block' -> 'ypes\nType\n~~~~~\nYour code here...\n~~~~~\n\n 1 : block' (published)
en1 English ___---___ 2017-02-15 16:50:16 365 Initial revision (saved to drafts)