My algo works with 255 Kb memory and 1ms. what can I improve in code to get ~120 KB, as in best results?

[code deleted]

Edited by moderator 04.12.2019 20:44

1) You don't need d.
2) If you'd like to improve speed even further, I suggest you to flag out elements in P that you have reached. In this case you'll get O(N) instead of O(N^2).