Foysal_Ahmmed's blog

Why Memory limit exceeded
By Foysal_Ahmmed, history, 8 years ago, In English

I am getting Memory limit exceeded for this problem C. Dijkstra? But why I can not understand this. My Solution

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (5)
| Write comment?
»
8 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

The size of queue is getting very large during execution you can either use set like this solution and clear the entry for v line number 29 this will restrict the size of set to at max O(N) http://mirror.codeforces.com/contest/20/submission/43596615

or like this solution you can free some memory by clearing the vectors you are not going to use. http://mirror.codeforces.com/contest/20/submission/43596568

→ Reply
  • »
    »
    8 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    But I can not understand how the set (is it work like priority queue ? )work in here please can you explain it .

    → Reply
    • »
      »
      »
      8 years ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      the purpose of priority queue is to extract the minimum element. In set the 1st element is the smallest element. While set provide an option to erase a element while the same operation is not supported in priority queue. priority queue is implemented as Heap while set is implemented as red black tree(Binary search tree)

      → Reply
      • »
        »
        »
        »
        8 years ago, hide # ^ |
         
        Vote: I like it 0 Vote: I do not like it

        Ok that's great I understood now thank you .

        → Reply
        • »
          »
          »
          »
          »
          8 years ago, hide # ^ |
          ← Rev. 2  
          Vote: I like it +4 Vote: I do not like it

          Actually, set has higher overhead compared to priority queue due to additional book-keeping such as balancing. In this case, blue__legend was able to achieve a much better runtime and memory limit because of the fact that we can efficiently search for and remove irrelevant nodes from the set, whereas we can't do so in a priority queue.

          Anyway, I think that your main problem is that you didn't terminate your loop, in your dijkstra shortest path implementation, when your destination has been visited. As such, a lot of irrelevant nodes might be stored in the priority queue and cause the MLE to occur.

          → Reply