***** CONTEST SCOREBOARD ***** Contest time: 05:00:00 1:boy_scouts 2:parity 3:hash 4:disjoint_paths 5:company 6:edit 7:restaurant Total ------------------------------------------------------------------------------------------------------------------------------------------------ ecprice 03:42+20 04:37+0 03:10+80 04:00+40 01:25+0 5/19:17 jsteinha 04:15+20 01:48+0 04:47+0 02:01+0 4/13:12 rumenov 00:42+0 03:37+20 01:16+0 3/05:56 zero 03:12+0 01:04+20 02:54+60 3/08:32 davidben 03:13+0 02:23+0 03:20+20 3/09:17 tdmorgan 01:24+0 02:18+40 2/04:22 mangpo 04:52+40 02:55+0 2/08:28 Qingchun 01:07+0 1/01:07 tonyliu 01:58+20 1/02:18 gbujokas 03:05+0 1/03:05 vatsa 03:18+0 1/03:18 mergen 03:22+0 1/03:22 emarion 04:41+100 1/06:21 cvnguyen 0/00:00 ecprice: - jsteinha: - rumenov: - zero: - davidben: - tdmorgan: - mangpo: - Qingchun: - tonyliu: - gbujokas: - vatsa: - mergen: - emarion: - cvnguyen: - ***** CLARIFICATIONS ***** (problem 1): The path traces out the boundary of a convex polygon. (problem 4): The students want to find routes to class that don't intersect at any *intersection*. (problem 4): The sample output is wrong for the first case. It should read: Case 1: 1 3 2 1 4 2 1 5 2 (problem 6): All labels fit in a 32-bit signed integer. (problem 7): half-point available if you solve problem correctly when no quarters or 20-dollar bills. Time to get the half-point is not counted, but it does count toward penalty time if you solve the problem properly later. half-point receivers: rumenov, emarion (minor clarification): The contest software uses the -O2 option when compiling C and C++ submissions. i.e.: g++ -O2 -o probX probX.cc (for C++) gcc -O2 -o probX probX.c -lm (for C)