OSN Bidang Informatika

Olimpiade Sains Nasional 2024 Bidang Informatika

We are pleased to invite everybody to our TOKI Indonesian NOI Open Contest 2024!

TOKI Indonesian NOI Open Contest 2024 is an open competition mirroring Indonesian NOI 2024 (OSN 2024 Bidang Informatika in Bahasa Indonesia).
The problemset is the same as the problemset in the original competition and will be given in both Bahasa Indonesia and English.
The contest will be held on TLX (you may need to register for a TLX account if you do not have one).
If you have any questions please contact sc-osn-2024@googlegroups.com.

There will be one trial session and 2 (two) competition days.
The 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. This limit may be increased for some problems.
The supported programming language is C++.
During the competition, each contestant can only see their own scores.

The contests will be held at the following time ranges:
- Day 0: 27 August 2024 11:00 - 28 August 2024 06:00 UTC (trial session)
- Day 1: 28 August 2024 07:00 - 29 August 2024 06:00 UTC
- Day 2: 29 August 2024 07:00 - 30 August 2024 06:00 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 available on TLX. Please register in those contests.
Each contestant may start the contest any time within the time range, by clicking the "start" 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. Not all problem types might be given.
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: Bogor Defence, OSN 2023
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: One-Day Delivery, OSN 2023
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: National Defence, KSN 2020.

For batch and interactive problems:
- A problem consists of multiple subtasks with various points.
- A subtask consists of multiple test cases.
- A submission gets a subtask's points if it solves all of its test cases.
- A problem may have open subtasks where the test cases are given to contestants.
For output-only problems:
- A problem consists of multiple test cases with various points.
- A submission gets the test case's points if it produces the correct output.
For each problem, the score can also be rewarded based on a given scoring formula.
- The scoring formula will vary for each problem and will be explicitly stated in the problem description.
- Example:
  - Batch: Tukar-Tukar, OSN 2013.
  - Interactive: One-Day Delivery, OSN 2023.
  - Output-only: National Defence, KSN 2020.

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.