razor123's blog

Assign(dp+bitmask)
By razor123, history, 8 years ago, In English

Hi, most of us are aware of a classical assignment problem. It involves use of dp+ bitmasking. Now if the number of subjects increased to 80(instead of 10 which was equal to number of students) such that the number of students =10 and no of subjects =80. Can anyone help me in coming up with a bottom up solution?

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (1)
| Write comment?
»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Let dp(i, mask) be the number of ways to assign first i works to some students who likes they and set of free students we store in mask.

→ Reply