CollectingMarbles
SRM 397 · 2008-04-12 · by mateuszek
SRM 397 · 2008-04-12 · by mateuszek · Dynamic Programming
Problem Statement
Problem Statement
Maybe you don't know, but you are a fanatic of colored marbles. You want to collect them all, but you may not be able to carry them. You have numberOfBags bags, each of capacity bagCapacity grams. The i-th marble has a weight of marblesWeight[i] grams. You can go to the shop only once and you have enough money to buy all of the marbles. Return the largest number of marbles that you can carry home in the given bags.
Constraints
- marblesWeights will contain between 1 and 13 elements, inclusive.
- Each element of marblesWeights will be between 1 and 20, inclusive.
- bagCapacity will be between 1 and 20, inclusive.
- numberOfBags will be between 1 and 10, inclusive.
Examples
0)
{ 2, 2, 2, 2, 2 }
5
2
Returns: 4
We have 5 marbles, all weighting 2 grams and 2 bags with capacity of 5 grams each. We can put no more then 2 marbles into each bag.
1)
{ 1, 3, 5, 2, 4 }
5
2
Returns: 4
We can carry home marbles with weights 1, 2, 3 and 4.
2)
{ 7, 6, 6, 5 }
12
2
Returns: 4
We have enough space for all marbles.
3)
{ 2, 2, 2 }
1
10
Returns: 0
Here, we can't take anything.
4)
{9,10,2,8,9}
10
5
Returns: 5
Submissions are judged against all 121 archived test cases, of which 5 are shown here. Case numbers match the judge’s.
Coding Area
Language: C++17 · define a public class CollectingMarbles with a public method int mostMarbles(vector<int> marblesWeights, int bagCapacity, int numberOfBags) · 121 test cases · 2 s / 256 MB per case