All submissions for this problem are available.
Dave has several rectangular blocks with which he wishes to build a tower. He may only
place a block on another if its base fits within the other's base with the edges parallel.
So he could place a block with a base of 1x9 on top of a block with a base of 2x9, but not on top of a block
with a base of 8x8. Help Dave make the tower as tall as
possible. Blocks may be rotated by any multiple of 90 degrees about any axis. Each block may only be used once, and you must use at least 3 blocks.
Input begins with an integer T (about 500), the number of test cases. Each test case
begins with an integer N (chosen uniformly between 10 and 200, inclusive), the number of
blocks. N lines follow, each containing 3 integers that give the dimensions of a block.
All dimensions are chosen uniformly between 1 and 100, inclusive. A blank line separates
For each case, first ouput an integer P>=3, indicating the number of blocks you wish to
use. Follow with P lines, each containing the dimensions of a block, with the height of
the block listed first (the order of the other 2 dimensions does not matter). Output
the blocks in order from the top of the tower to bottom of the tower.
Your score for each test case is the height of your tower divided by N. Your total score
is the average of your scores on the individual test cases.
1 10 7 2 10 8 8 8 7 1 1 2 7 9 6 8 1 6 6 5 3 2 5 10 3 9 10 10 8 4 4 1
5 4 1 4 1 1 7 10 2 7 2 7 9 8 10 10
Score: (4+1+10+2+8)/10 = 2.5
|Tags||challenge, july10, pieguy|
|Time Limit:||1.33 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, rust, SCALA, swift, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, SQL, kotlin, PERL6, TEXT, SCM chicken, PYP3, CLOJ, R, COB, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.