Skip to Content

Scoring Rules

Scoring Rules

Competition Process
At the start time of the Domestic Contest, the problems are published on the WWW pages announced in advance.
Each team freely chooses any of the problems and starts to write programs.
When they have a completed program for a problem, they run it with the given input data.
They then submit the output (execution result) and the program (source codes) to the judges by using a predefined method (through the web), in order to have judgment on whether their answer is right or not.
By repeating this process, each team competes to solve more problems in less time.

Answer Judgment and Input Data
A team is considered to have solved a problem when an identical program written by them could give the right outputs for two successive inputs, for both of which the team had not made a right output.
4 different inputs are prepared for each problem, and the first one is given in the problem statement.
When a program by a team makes the right output for one input, then they receive another input to check whether the same program can make the right output for the latter input.
When a submitted program makes the right output for one input but not for the next input, the latter input is used upon the next program submission.

An example is described below.

Suppose a team submitted a program p1, which made the right output for the input d1.
Then the team is required to make the right output using the same program p1.
If the right output is made, it means the team has solved the problem.
If not, the team needs to try with another program p2 for the input d2 (not d1).
If the second program p2 made the right output for the input d2, then another input d3 was provided and checked.

This implies that an input is "consumed" if a program submission makes the right output for one input but not for the next input.
So if the team has such situations three times, then it does not have sufficient inputs to solve the problem anymore.

At the Domestic Contest, execution time or memory consumption is not evaluated as all the programs are executed on the local machine of each team.

Standings
The standings are determined by applying the following rules.

1. The more problems a team solves, the higher order it has.
2. If multiple teams have the same number of solved problems, a team with a smaller penalty value has a higher order than a team with a larger penalty value. The penalty value is the sum of the following values for each of the problems that have been solved by the team.
  - The duration between the start time of the contest and the time the team solved the problem (minutes).
  - The number of submissions with wrong answers multiplied by 20 minutes
(no penalty for wrong submissions for problems that have not been solved by the team)

An example is described below.

Suppose the contest started at 16:30.
- Problem A Solved at 17:10 - Penalty of 40 minutes
- Problem B Wrong submissions at 17:30 and at 17:50 Solved at 18:10 - Penalty of 100 + 20 * 2 minutes
- Problem C Wrong submissions at 18:55 and at 19:25 Not solved finally
- Problem D Wrong submissions at 18:00 Not solved finally
- Problem E Not solved finally
In this case, the team has solved 2 problems and has the penalty value of 180 minutes.