Can someone help me with this problem http://www.spoj.pl/problems/HIST2 ?
I know how to solve the maximum perimeter, but how can I count the number of permutations?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can someone help me with this problem http://www.spoj.pl/problems/HIST2 ?
I know how to solve the maximum perimeter, but how can I count the number of permutations?
Name |
---|
Look at the constraints. N <= 15 is shouting bitmasks.
Generally speaking, if a state S can be reached from the states A1,A2,A3....AK, and the function G(state) is the number of ways to generate the state. We have that:
G(S) = G(A1)+G(A2)+G(A3)....+G(AK)
Hope it helps.
You mean to do a function to calculate maximum and another one that count the permutations?
I try to code that problem ... here's my code ... http://pastebin.com/MKUZA75W ... but it doesn't count properly the permutations ... :(
I am getting TLE in this question . Did you solve it ? I used dp+ bitmask . Here is the link for code : http://ideone.com/vnLa8S Can you tell how to optimise it .