Fourth BU ACM Contest
September 18th, 2006
sponsored by Professor Lewis
September 18th, 2006
sponsored by Professor Lewis
Message from the contest committee chair
This was my first contest which I helped coordinate. Problems seemed to be harder a little bit harder than our last contest. I was glad that the contest went rather smoothly. Andrew Paroski the previous contest coordinator was kind enough to provide the questions for this competition. We also had our first professor (Professor Madden) participate in a competition, hopefully for future competitions we can get professors more active in the competitive part of the competitions.
The problems seemed to be ranked in order of difficulty according to the contests seemed to be 5, 6, 2, 4, 1, 3. With none of the students actually solving problem #3. Personally I thought that the order of difficulty was 5, 6, 3, 4, 2, 1. Problem 5, Last Minute Fix, was a relatively straight forward problem requiring one to build a sort that sorted on last name, then first name. Problem 6, Clocking Out, I also thought was relatively straight forward, although some people seemed to forget the fact that 12AM occurs before 1AM, and 12PM, occurs before 12PM. A simple little case that got some people screwed up. Problem #3 Unfinished Business had a greedy solution, so to solve it all that needed to be done was sort the houses in descending order of penalty/days. Problem #4, IT Hell could be solved in one of two ways. One using a depth first search to search through the people to determine how many unique groups there are. Another way was to create sets, then on each connection union the two sets that contain those people, returning the number of total remaining sets minus one. Problem #2, Back to the Basics, was a problem that required a little bit of problematic parsing, and the knowledge of order of operations (multiplication must occur before addition or subtraction). Problem #1, What are the Odds which I thought was the hardest problem, could be decided in one of two ways. One which was DP (dynamic programming), or use of memoization.
This semester started off with a good showing at our first competition. Hopefully for the following competitions we will continue to grow our attendance for these events. Special thanks to Professor Lewis for furnishing the prize money and the food and beverage.
-Nick Maliwacki
Contest Standings
Rank |
Name |
1 |
2 |
3 |
4 |
5 |
6 |
Total Time |
Problems Solved |
| * | pmadden | 1:42:15 | 37:12 | 1:35:54 | 1:52:24 | 5:10 | - | 5:52:55 | 5 |
| 1 | Jason Loew | - | - | - | 1:18:51 | 16:45 | 32:22 | 2:07:58 | 3 |
| 2 | Robert K Frank | - | 1:23:33 | - | - | 15:57 | 47:49 | 2:27:19 | 3 |
| 3 | Ari Ronen | - | - | - | - | 27:56 | 44:17 | 1:12:13 | 2 |
| 4 | Seymour | - | 1:14:52 | - | - | 1:47:54 | - | 3:02:46 | 2 |
| 5 | Marc Seicol | - | - | - | - | 32:34 | - | 32:34 | 1 |
| 6 | Dan Copel | - | - | - | - | 33:03 | - | 33:03 | 1 |
| 7 | Saugata Ghose | - | - | - | - | - | 41:27 | 41:27 | 1 |
| 8 | Noah Schwartz | - | - | - | - | 1:10:58 | - | 1:10:58 | 1 |
| 9 | Benjamin Kreuter | - | - | - | - | 1:15:00 | - | 1:15:00 | 1 |
| 10 | Leonid Domnitser | - | - | - | - | 1:16:34 | - | 1:16:34 | 1 |
| 11 | Jiri Stehlik | - | - | - | - | - | 1:24:44 | 1:24:44 | 1 |
| 12 | yash | 1:46:10 | - | - | - | - | - | 1:46:10 | 1 |
| 13 | Lawrence Brooks | - | - | - | - | 1:56:50 | - | 1:56:50 | 1 |
Honorable Mention
| terabyte GregoryStoddard Houtan Fanisalek Ryan Southard Zach Savishinsky |
Pstein hzeng9 Guang Ye Liu jwong12 Tim YourMom Reilly |
david mitchell James M Leddy Mike Hayes Joshua Casner |
Problem Statements
Problem 1 - Problem 2 - Problem 3 - Problem 4 - Problem 5 - Problem 6
Testcases
There is a folder of testcases for each problem. The input files are labelled "1.input", "2.input", etc. and their corresponding output files are labelled "1.output", "2.output", etc.
Problem 1 - Problem 2 - Problem 3 - Problem 4 - Problem 5 - Problem 6
Solutions
All the solutions provided are in C++.
Problem 1 - Problem 2 - Problem 3 - Problem 4 - Problem 5 - Problem 6
Submissions
For the purpose of anonymity, submissons have been posted by ID number rather than by name.
1071 - 1357 - 1525 - 2383 - 2438 - 2582 - 3432 - 3760 - 3900 - 4202 - 4281 - 4727 - 4882 - 6579 - 6640 - 7078 - 7380 - 8158 - 8365 - 8722 - 8794 - 9120 - 9214
Summary
| Contest Number |
BU4 |
| Date |
September 18th, 2006 |
| Location | Binghamton University, Academic A, Room G04 |
| Sponsors | Professor Lewis |
| Number of problems |
6 |
| Number of
competitors |
31 |
| Registration time |
7:40 PM |
| Contest start time |
7:50 PM |
| Contest end time |
9:50 PM |
| Supported Languages |
C/C++, Java |
| Timeout period |
10 seconds |
| Cash Prizes |
1st $216, 2nd $125, 3rd $64, 4th $27 |
| Food and beverage |
Nirchi's pizza, soda, juice boxes |