Give me some tests or write if there are some sly tests.
I solve this problem by 2^K*N*N.

I have the same problem.
Where is bag?

Edited by author 09.07.2008 23:49

Also WA8. Give some tests

WA8. Small Code, but can not find any bug/

[code cut]

Edited by moderator 18.04.2013 21:14

My solution is O(2^k).
I think, that main problem's are - how reduce amount of DFS  (check the route existence's with current set of licenses) and reduce brute-force to find all possible combinations of licenses.
Binary search for number of licenses helped me to avoid TLE.

Edited by author 08.01.2010 01:39