Summary of Test Data Characteristics for Task Mountains (IOI 2005, Day 1) ======= == ==== ==== =============== === ==== ========= # n I Q min. h max. h min. d max. d Remarks --- --------- ----- ----- --------- --------- ------- --------- ------- 0 4 2 4 1 3 0 4 type 1 1 10 16 16 3 101 1 9 type 1 2 50 36 12 0 2443 7 50 type 1 3 257 32 16 164523 438774 68 257 type 1 4 2047 64 32 353173 1935354 419 2047 type 1 5 8192 128 64 5730625 32088030 1579 8160 type 1 6 20000 132 66 183438435 973035950 4057 19846 type 1 7 20000 334 664 46686684 974161902 1343 19991 type 1 8 19999 500 498 79950 5611844 1543 19999 type 1 9 19998 505 452 0 24986346 2581 19998 type 1 10 19998 510 454 794200 72261289 1117 19998 type 1 11 20000 900 98 11268924 994080751 272 19912 shrinking intervals * 12 20000 950 48 0 988015660 1802 20000 growing intervals * --- --------- ----- ----- --------- --------- ------- --------- ------- 50% boundary 13 200000000 98998 998 214858 761296910 58180 199992205 shrinking intervals * 14 1000000000 49999 49999 0 940238009 14866 1000000000 chained intervals * 15 249999999 90000 9998 8625048 956714220 8624961 249999955 type 3 * 16 50000001 95030 4968 981453 998365388 943929 49867808 every a < every b; a, b incr. * 17 50000001 95030 4968 378822 999826515 21813 49998826 every a < every b; a, b decr. * 18 30303030 66666 33332 166394 999532713 6141 30302694 mostly random 19 925048833 97652 2346 25235163 708456474 9102882 915222627 growing intervals + random intv. * 20 100000000 201 300 1188777 994182008 396259 100000000 random, few input lines 21 200000 66664 33332 0 999682953 0 200000 every a < every b, but random 22 62499997 40000 4000 196780 659562299 133110 62499188 growing intervals + random intv. * 23 62500003 10000 600 2953455 300044975 2286649 62488740 shrinking + long chain * 24 100000000 1001 80000 2992 394855118 748 99999795 chain of intervals ** --- --------- ----- ----- --------- --------- ------- --------- ------- # n I Q min. h max. h min. d max. d Remarks where # = case/run identifier n = number of rails in roller coaster trail (input) I = number of 'I' lines in input Q = number of 'Q' lines in input min. h = minimum height in 'Q' lines max. h = maximum height in 'Q' lines min. d = minimum distance in output max. d = maximum distance in output type 1 = specially constructed, avoiding too many answers equal n type 3 = shrinking + forward seq. of nonoverlapping + backward seq. of nonoverlapping * = with slight random modification to break the pattern ** = with significant random modification to break the pattern N.B. Max. score per case: 4 points; except cases 11, 12, 23, 24: 5 points