OSN Bidang Informatika

Olimpiade Sains Nasional 2019 Bidang Informatika

TOKI OSN Open Contest 2019 is an open competition mirroring the National Science Olympiad in Informatics 2019 in Indonesia (OSN Informatika 2019 in Bahasa).
OSN Informatika is a national olympiad in informatics for high school students. It is one of the stages required for Indonesian students to represent Indonesia in IOI (International Olympiad in Informatics)
The problemset is the same as the problemset in OSN Informatika 2019 and will be given in Bahasa Indonesia and English.
The contest will be held on TLX (TOKI Online Judge) (you may need to register for a TLX account if you do not have one).
If you have any questions please contact sc-osn-2019@googlegroups.com.

There will be one trial session and 2 (two) competition days.
Result of the trial session does not affect scoring.
There will be 3 (three) problems on each day to be solved in 5 (five) hours.
Each contestant may submit up to 50 submissions for each problem.
The supported programming languages are C, C++, and Pascal.
During the competition, each contestant can only see their own scores.

The contests will be held at the following time ranges:
- Day 0: 1 July 2019 08:35 - 23:05 UTC (trial session)
- Day 1: 2 July 2019 02:35 - 23:05 UTC
- Day 2: 3 July 2019 02:35 - 23:05 UTC
Each contestant can select any 5-hour window within the time range to do the contest for each competition day.
All three contests are now available on TLX. Please register in those contests.
Each contestant may start the contest any time within the time range, by clicking the timer button.
There will be no additional time given if a contestant starts the contest in less than 5 hours before the contest ends.
The open contest does not support clarifications, but all important announcements from the original contest will be broadcast as well.

There are 3 possible problem types. Some problem type might not be tested.
Batch problems:
- The most common problem type.
- Given an input, contestants write a program that reads input from stdin and writes output to stdout.
- The program must run within the given time and memory limits.
- Example: Pekanbaru Defense, OSN 2017
Interactive problems:
- Contestants write a program that interacts with judge's program: judge's program writes to stdout and is given as the stdin for contestant's program, then contestant's program writes to stdout and is given as the stdin for judge's program, and the interaction continues until a given goal is reached.
- Contestant's program must output the answer within the given time and memory limits.
- Example: Lands and Glaciers, OSN 2017
Output-only problems:
- Contestants will be given all the input test cases.
- Contestants submit output for each input test case.
- Contestants do not have to write a program; the outputs may be solved manually.
- Example: Tourism in Palembang, OSN 2016.

For batch and interactive problems:
- On creative scoring, for each submission, the score of a subtask is the minimum score among all its test cases.
- A subtask final score is the maximum of its score among all submissions.
- Contestant's score for a problem is the sum of all its subtasks final score.
For example, if the first submission got 30 points for the first subtask and 0 points for the second subtask, and the second submission got 0 points for the first subtask and 40 points for the second subtask, then the contestant's score for the problem is 70 points.
For output-only problems:
- A test case final score is the maximum of its score among all submissions.
- A contestant's score on a problem is the sum of all its test cases final score.
A contestant's total score is the sum of all of problems score on both competition days.
Contestants will be ranked by the total score (descending).
Two contestants with the same total score will achieve the same rank.
Submission time will not affect contestant rank at all.