Family Dinner

Family Dinner

Undefined
English

Dr. Mickhead's family is visiting him next Sunday to have dinner together. He wishes the party to be really special, so he plans to use his best plates for the table setting. Dr. Mickhead has N stacks of plates. Each stack contains K plates. Each plate has a positive beauty value, describing how beautiful it looks. Dr. Mickhead would like to take exactly P plates to use for dinner. If he would like to take a plate from a stack, he must also take all of the plates above it. Help Dr. Mickhead to calculate the maximum total sum of beauty values that can be achieved by picking P plates.

Note: P is always less than or equal to the total amount of plates in all stacks.

This mission was proposed by Ben Jacobson and Wajeb Saab for Google Kickstart Round A 2020.

Input: Two arguments

  • The first one is a list of lists of equal size. The i-th list contains positive integers, describing the beauty values of i-th stack of plates from top to bottom;
  • The second is a positive integer. The amount of plates Dr. Mickhead is willing to put on the table.

Output: An integer - the maximum total sum of beauty values that can be achieved with respect to the constraints.

Example:

Consider the following input: [[10, 10, 100, 30], [80, 50, 10, 50,]], 5 . So the best option would be picking 3 plates from the first stack and 2 plates from the second stack. In total, the sum of beauty values is 250.

	[10, 10, 100, _] -> total: 10 + 10 + 100 = 120
	[80, 50,   _, _] -> total: 80 + 50       = 130
	----------------------------------------------
	                    total: 120 + 130     = 250
	

best_plates([[10, 10, 100, 30], 
             [80, 50, 10, 50,]], 5) == 250
			 
best_plates([[80, 80],
             [15, 50],
             [20, 10]], 3) == 180

How it’s used: This is a variation of a very well-known knapsack problem.

Precondition: 1 ≤ len(stacks) ≤ 100 1 ≤ len(stacks[i]) ≤ 50 1 ≤ stacks[i][j] ≤ 200

Settings
Code:
Other:
Invalid hot key. Each hot key should be unique and valid
Hot keys:
CheckiO Extensions

CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.

In order to install CheckiO client you'll need installed Python (version at least 3.8)

Install CheckiO Client first:

pip3 install checkio_client

Configure your tool

checkio --domain=py config --key=

Sync solutions into your local folder

checkio sync

(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)

checkio serv -d

Alternatevly, you can install Chrome extension or FF addon

checkio install-plugin
checkio install-plugin --ff
checkio install-plugin --chromium

Read more here about other functionality that the checkio client provides. Feel free to submit an issue in case of any difficulties.

Pair Programming (Beta-version)

Welcome to Pair Programming! Engage in real-time collaboration on coding projects by starting a session and sharing the provided unique URL with friends or colleagues. This feature is perfect for joint project development, debugging, or learning new skills together. Simply click 'Start Session' to begin your collaborative coding journey!

Waiting for Pair Programming to start...

You are trying to join a pair programming session that has not started yet.

Please wait for the session creator to join.

Waiting for Pair Programming to reconnect...

It looks like the creator of the pair programming session closed the editor window.

It might happen accidentally, so that you can wait for reconnection.

×
 
 
<< <
> >>
exec show

Whats Next?

Free accounts will see Best CheckiO solutions with some delay.
Best Solutions will be opened in a moment
Become Awesome and Don't wait
The next stage is ""
Will be activated in
View More Solutions Random Review Solutions Go to the next mission