Summary of Test Data Characteristics for Task Mean Sequence (IOI 2005, Day 1) ======= == ==== ==== =============== === ==== ==== ======== # n m_1 m_n min.dist. max.dist. Answer Remarks --- ------- ------- ---------- ---------- ---------- ---------- ------- 0 3 2 9 3 4 4 Example --- ------- ------- ---------- ---------- ---------- ---------- ------- 1a 2 0 0 0 0 1 type 4 1b 4 0 5 1 3 0 type 4 2 4 0 7 2 3 2 type 4 3a 5 1 16 1 8 2 type 4 3b 6 0 6 0 5 0 type 4 4 6 0 6 1 2 1 type 4 5a 10 1 181 19 21 19 type 3 5b 12 100 346 0 80 0 two duplicate m_i pairs 6a 325 57 19959 57 66 1 m_i from random s_i 6b 404 40 19960 0 99 0 random m_i 7 100 5000 14780 60 100 51 type 3 8 26 1809 15460 2 4096 2 dist. incr. then decr. 9a 880 36 11229 2 22 3 m_i from random s_i 9b 890 2 9921 0 22 0 random m_i 10a 1000 0 20000 10 10020 11 all dist. 10 except first 10b 1000 0 19976 0 719 0 random m_i --- ------- ------- ---------- ---------- ---------- ---------- ------- 50% boundary 11a 2100000 1232123 781231923 200 800 1 dist. pattern repeats 11b 9 1 101010101 1 99000000 0 dist. incr. then decr. 12a 100000 4132 501365577 23 9991 3 m_i from random s_i 12b 98484 22 499994903 22 10149 0 random m_i 13 1000000 15 999996605 510 1000 31 type 3 14 99990 1 999799101 9999 10000 9999 dist. pattern repeats 15a 4 0 1000000000 250000000 500000000 1 max. min.-dist & answer 1 15b 4 0 1000000000 249999999 500000002 0 max. min.-dist & answer 0 16a 2 0 1000000000 1000000000 1000000000 1000000001 largest answer 16b 4000000 300 1000000000 200 300 0 distances alternate 17 3850001 0 996649871 129 500000000 130 one large distance 18 4000000 150497 988150274 247 258 248 type 3 19a 4700000 147 505244448 2 212 3 m_i from random s_i 19b 4800000 12 494294176 12 194 0 random m_i 20 5000000 153 849999823 90 170 11 type 3 --- ------- ------- ---------- ---------- ---------- ---------- ------- # n m_1 m_n min.dist. max.dist. Answer Remarks where # = case/run identifier n = length of mean sequence (input) m_1, m_n = first/last element of mean sequence (input) min.dist. = minimum distance between successive m_i max.dist. = maximum distance between successive m_i type 3 = most distances equal with a few distances changed type 4 = specially constructed case Max. score per case: 5 points