| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | maroonrk | 133 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
I got confused in this problem from LightOJ http://lightoj.com/volume_showproblem.php?problem=1011
As i am newbie in DP so i want some help in solving this problem using bitmask . Please explain me the steps so that i can use the technique in future . I cant understand how the calculations are done using DP and bitmasks .
You can solve this problem following this steps: 1. What will be state? It can be d[i][mask], how many couples and which women are free. 2. Transitions. If j — th woman is free, we can marry her to i — th man. So we are building new pair. 3. Where is answer? Answer will be in d[n][FULL_MASK].
Also you can write this dynamic by using one parameter. Logically, if j — th woman is not free, it means that she has a pair. So instead first parameter we can use number of ones in mask.
Hope you will get AC.
If you want I can give you code.