Brief problem description : Given a permutation of length n <= 12 and a list of m <= n*(n-1)/2 possible swaps, what is the minimum number of swap operations required to change the permutation to an identity permutation ( i.e p_1 = 1, p_2 = 2, ... p_n = n). Here's the problem link : https://wcipeg.com/problem/coci092p5.↵
↵
The editorial uses A* algorithm with heuristics to solve this problem. I was only able to come up with a 90 pts (here's the [code](https://ideone.com/93uJrO)) solution using A*. Can anyone share any idea on how to get 100 pts efficiently ? ↵
↵
↵
The editorial uses A* algorithm with heuristics to solve this problem. I was only able to come up with a 90 pts (here's the [code](https://ideone.com/93uJrO)) solution using A*. Can anyone share any idea on how to get 100 pts efficiently ? ↵
↵
