ACM Qualifier Problems - 2004
Problem List
Submission
Use the standard CS Department
Turnin. Select course CS302, and the appropriate submission
directory. I will check them as quickly as possible and tell you one
of the following:
- Correct - Good job, you get the point for this.
- Time limit exceeded - You only get 1 minute for your program to
terminate
- Runtime error - Your program segfaults, has a bus error, an
uncaught exception, or some other critical error on my tests
- Wrong answer - doesn't look like you are calculating the right
thing.
- Bad formatting - looks like the right answer but isn't formatted
correctly
You will NOT get any more detailed information than this back.
Scoring
The team with the most correct problems solved wins. In the (likely)
event of a tie, time-elapsed is used as a tie-breaker as follows:
- For each problem correctly submitted, the time since the START of
the contest is counted AGAINST the team. Solving the easiest problem
first is therefore important
- For each problem correctly submitted, a 10 minute penalty is
applied for each INCORRECT submission of that problem. Thus it never
hurts to submit something you think is correct (it won't harm your
current standings if you got it wrong), but you do need to minimize
the number of incorrect submissions.
Clarifications
If you have questions about the problems or the rules, email them to
titus@cs.ucr.edu and I'll post
the responses here.
- Do we have to do the problems in order?
No, you can do them in any order.
- Will the inputs for the bicoloring problem be sorted in any
manner
Not necessarily. The inputs may be in any order.
- What is the maximum number of nodes we must
accomodate for in the bicoloring problem?
Read the problem statement.
- How do I read the input?
All input and output is through cin/cout.
- Will invalid input be provided or can we assume all input will
match the spec?
All input will conform to the spec provided.
- Do we need a makefile?
No
Current Standings
Here is a list of the current team standings. I'll try to keep this
up-to-date, but I will focus on getting submissions graded first.
| Team Name | Solved | Time (w/ penalties) | Bicoloring | Hanoi | Check |
| Caltech 2 | 1 | 84:00 (94:00) | | 2 attempt | |
| Amniotic Snack | 1 | 97:00 (97:00) | | 1 attempt | |
| Partial Fraction | 1 | 91:00 (141:00) | 6 attempts | 1 attempt | |
| Monkey Pirates | 0 | 00:00 | 2 attempts | | |
| Team 0 | 0 | 00:00 | 3 attempt | | |