CSES Labyrinth : time limit is exceeding in one test case

Правка en2, от salt_n_ice, 2020-11-27 09:32:15

Here is my implementation: * Here, sn and en stands for starting node and ending node respectively, and mini_map is the 2d array showing path of shortest distance from starting node to all other reachable nodes. Rest is Breadth-First Search.

I don't see whats making this solution so long

Code
Теги #graph, #bfs, time complexity, #c++

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский salt_n_ice 2020-11-27 09:47:20 147
en4 Английский salt_n_ice 2020-11-27 09:36:01 56 Tiny change: 'Here is my' -> '[Problem Link](https://cses.fi/problemset/task/1193)\n\nHere is my'
en3 Английский salt_n_ice 2020-11-27 09:33:05 5 Tiny change: '="Code">\n...\n~~~~~\nc' -> '="Code">\n~~~~~\nc'
en2 Английский salt_n_ice 2020-11-27 09:32:15 47
en1 Английский salt_n_ice 2020-11-27 07:38:20 2451 Initial revision (published)