Scribd
Upload
34 views8 pages

Bitmask DP - TLE 4

The document outlines a plan for a session on Bitmask Dynamic Programming, including topics such as Bitmasking Revision, the Subset Sum Problem, and the Min Cost Task Assignment Problem. It emphasizes the importance of understanding submasks of masks in relation to these problems. Additional tips and resources are also mentioned for further learning.

Uploaded by

padhlebhai2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views8 pages

Bitmask DP - TLE 4

The document outlines a plan for a session on Bitmask Dynamic Programming, including topics such as Bitmasking Revision, the Subset Sum Problem, and the Min Cost Task Assignment Problem. It emphasizes the importance of understanding submasks of masks in relation to these problems. Additional tips and resources are also mentioned for further learning.

Uploaded by

padhlebhai2
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Bitmask DP

Bharat Singla (singlabharat)


Expert on CodeForces
5⭐ on CodeChef
Today’s plan :

● Bitmasking Revision
● Subset Sum Problem
● Task Assignment Problem
● Other Tips & Stuff
Revision Time
Subset Sum Problem
Min Cost Task Assignment Problem
Min Cost Task Assignment Problem
Min Cost Task Assignment Problem
Submasks of Masks

You might also like