|
|
back to boardThanks :) I used bitwise operations (we can represent each subset as number between 1 and 2^n - 1), this AC'ed with 0.031s, may be you can further improve it .. Well, I used DP on subsets, but can't get faster than 0.093. Is there any special trick? I used bitmask... AC on 0.015 probably they just upgraded the machine from 2011, that's why you are faster than others :P I get 0.015 and used queue for each recount |
|
|