Блог пользователя Foysal_Ahmmed

Why Memory limit exceeded
Автор Foysal_Ahmmed, история, 6 лет назад, По-английски

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

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится

»
6 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

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://codeforces.net/contest/20/submission/43596615

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

→ Ответить
  • »
    »
    6 лет назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

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

    → Ответить
    • »
      »
      »
      6 лет назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      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)

      → Ответить
      • »
        »
        »
        »
        6 лет назад, # ^ |
          Проголосовать: нравится 0 Проголосовать: не нравится

        Ok that's great I understood now thank you .

        → Ответить
        • »
          »
          »
          »
          »
          6 лет назад, # ^ |
          ← Rev. 2   Проголосовать: нравится +4 Проголосовать: не нравится

          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.

          → Ответить