jatinxkirito's blog

How to handle this kind of questions?
By jatinxkirito, history, 5 months ago, In English

Can anybody please tell how do you handle this kind of questions. I can't seem to find a solution.

Fofo, the richest man in the city has a big problem and he believes that you are the only one capable of solving it. He has recently completed N projects and earned A[i] profit for every project. He now wants to build M warehouses such that each warehouse can accommodate K bundles of money. The money bundles must be distributed such that the following conditions are true: • The profit earned from a project is not distributed among more than one warehouse. • The warehouse can contain more than one project's profit, provided that the total number of bundles does not exceed K. Now he wants your help by determining the smallest value for K so that he can place all the bundles in the M warehouses. Find the smallest possible value of K such that the profit earned from all projects is distributed across the M warehouses.

Tags dp, help
  • Vote: I like it
  • +5
  • Vote: I do not like it

»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by jatinxkirito (previous revision, new revision, compare).

→ Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

i think we can solve this by binary search ,since for all the possible values of k ( greater than the minimum ) we can accomodate the bundles of money so we can see a monotonic graph which proves we can apply binary search.

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    actually problem is after that. how do we check that if the given k is possible. We have to optimally fit the cash blocks without breaking them.

    → Reply
»
5 months ago, # |
  Vote: I like it +2 Vote: I do not like it

Strongly NP-complete.

There are multiple approaches if the constraints are low enough for bitmask DP.

→ Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Can you please provide a reference

    → Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    From the article:

    On the other hand, bin packing is solvable in pseudo-polynomial time for any fixed number of bins K

    And in case of binary search

    solvable in polynomial time for any fixed bin capacity B

    → Reply
    • »
      »
      »
      5 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      "fixed" means it's treated like a constant in complexity analysis, for example $$$N^K$$$ is a polynomial for fixed $$$K$$$.

      → Reply
  • »
    »
    5 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks a lot

    → Reply
»
5 months ago, # |
  Vote: I like it 0 Vote: I do not like it

infosys

→ Reply