ColorfulBoxesAndBalls

SRM 464 · 2009-11-12 · by lyrically

SRM 464 · 2009-11-12 · by lyrically · Simple Math, Simple Search, Iteration

Show categories

Class Name: ColorfulBoxesAndBalls

Return Type: int

Method Name: getMaximum

Arg Types: (int, int, int, int, int)

Problem Statement

You are playing a game where you have numRed red boxes, numBlue blue boxes, numRed red balls, and numBlue blue balls.
You must place a single ball into each box. Each box is then scored as follows:

If the box is red and it contains a red ball, you get onlyRed points.
If the box is blue and it contains a blue ball, you get onlyBlue points.
In all other cases, you get bothColors points.

Your total score is the sum of the scores of all the boxes.
Return the maximum possible total score you can get.

Constraints

numRed and numBlue will each be between 1 and 100, inclusive.
onlyRed, onlyBlue, and bothColors will each be between -1000 and 1000, inclusive.

Examples

2
3
100
400
200
Returns: 1400

In this example, you should put two red balls into red boxes, and three blue balls into blue boxes. Then you can get 100 * 2 + 400 * 3 = 1400 points in total.

2
3
100
400
300
Returns: 1600

bothColors is a larger value here than it was in the previous example. You should put two blue balls into red boxes, and two red balls and one blue ball into blue boxes. Then you can get 300 * 4 + 400 * 1 = 1600 points.

5
5
464
464
464
Returns: 4640

No matter how you place the balls, your score will always be the same.

1
4
20
-30
-10
Returns: -100

The maximum total score may be less than zero.

9
1
-1
-10
4
Returns: 0

Submissions are judged against all 59 archived test cases, of which 5 are shown here. Case numbers match the judge’s.

Coding Area

Language: C++17 · define a public class ColorfulBoxesAndBalls with a public method int getMaximum(int numRed, int numBlue, int onlyRed, int onlyBlue, int bothColors) · 59 test cases · 2 s / 256 MB per case