Bulgarian solitaire

Hey everyone,

I started this puzzle a bit earlier, i think i have the correct logic but after some re thinking and changing container types and algorythms i still have the “Process has timed out. This may mean that your solution is not optimized enough to handle some cases.” message for the “Large Piles” and “Many Piles” tests

I do this puzzle in c++, i use multiset as container for my “piles” so i don’t have to sort everytime, a vector to store each pile turn, i use std::move at the only place i “add” something but even then, when i try the test cases i find it takes too much time … anyone willing to help ? dunno if i should post my code here or else.

5 posts were merged into an existing topic: [Community Puzzle] Bulgarian solitaire

2 posts were merged into an existing topic: [Community Puzzle] Bulgarian solitaire