Australian Informatics Olympiad: The AIO Paper Guide

The Australian Informatics Olympiad has one feature that makes it disproportionately useful to students worldwide: schools outside Australia may enter.

One paper, open entry

Most national computing olympiads are closed to foreign students, which leaves an ambitious student in India, Singapore or the UK with few genuine contests to sit. The Australian Informatics Olympiad is an exception.

It is sat as a single paper rather than a series of graded divisions, so there is no division to choose and no qualifying stage to clear first. Each task is solved by writing a program, which is judged against test data.

Team selection for international events is restricted to Australian students, as it is everywhere. The contest itself is open, and for an overseas student the point is the contest.

AIO is not AIMO

This needs stating plainly because the names cause real confusion and families register for the wrong thing.

AIO is the Australian Informatics Olympiad: a programming contest. AIMO is the Australian Intermediate Mathematics Olympiad: a mathematics competition with no programming whatsoever.

They are different contests with different preparation and different purposes. A student preparing for one is not preparing for the other.

Partial scoring decides most results

Tasks award marks for solving restricted versions of the problem — usually smaller input sizes, sometimes special cases.

This changes the correct strategy more than any other feature of the contest. On a task a student cannot fully solve, writing the obvious slow solution and banking the small-input marks is not a consolation prize. It is frequently the difference between a good score and a poor one.

Students arriving from mathematics competitions resist this, because a half-finished proof earns almost nothing there. Here a half-finished solution earns most of what is available, and submitting something always beats submitting nothing.

What to do in the first ten minutes

Read every task before writing any code. The tasks are not strictly ordered by how hard a particular student will find them, and the one that suits a student's strengths is sometimes last.

Then, for each task, look at the stated input limits before choosing an approach. A limit of a few hundred invites an approach that a limit of a few hundred thousand rules out entirely, and reading that number first saves an hour of wasted implementation.

Secure the full marks on the tasks that are reachable before attempting anything hard. A completely solved easy task outscores two half-solved hard ones in almost every case.

The algorithms that appear

The Australian Informatics Olympiad covers the standard entry-level olympiad ground, and the first tasks are reachable by a student who can program at all.

Careful simulation — modelling a described process exactly — solves more early tasks than students expect, and the difficulty is precision rather than cleverness.

Sorting and greedy reasoning with an argument for why the greedy choice is safe. Prefix sums and similar preprocessing, which turn a slow repeated computation into a fast one and are the first real efficiency technique most students learn.

Recursion and backtracking for the combinatorial tasks, and dynamic programming in the harder ones.

Our AIO preparation course works past papers under timed conditions, with the review focused on subtask strategy as much as on algorithms, because that is where most marks are actually won and lost.

What to do first

A student who cannot yet reason about procedures should not open with a programming contest, because the paper then tests reasoning and implementation simultaneously.

Computational and Algorithmic Thinking is the natural preparation. It is also run by the Australian Maths Trust, requires no programming, and builds exactly the reasoning the AIO then asks a student to implement. Sitting CAT first turns the AIO into a programming problem, which is learnable in months.

Younger students should start with Bebras or the Beaver Computing Challenge, which play the same role from around Class 3.

For international schools

If you are a school outside Australia looking for a programming olympiad your students can actually sit, this is one of a small number of options.

The others worth knowing are the Canadian Computing Competition, which also accepts international schools, and USACO, whose online contests are open to anyone anywhere. National routes such as INOI, BIO and NOI Singapore are restricted to students schooled in those countries.

Entering two open contests in a year gives a student two real attempts rather than one, and the algorithmic preparation is shared across all of them.

How much preparation it needs

A student who already programs confidently can prepare for the Australian Informatics Olympiad in a term, and most of that time goes on subtask strategy rather than on new algorithms.

A student new to programming needs longer, and the right sequence is reasoning first, implementation second. Trying to acquire both at once is the usual reason a capable student scores badly on their first paper and concludes they are not suited to it.

Two past papers worked under full timed conditions, with a careful review of where the time went, are worth more than a dozen worked at leisure. The contest constraint is time, so the practice has to include it.

Practical notes

Because it is one paper with no divisions and no qualifying round, the administrative burden on a school is low, and a student can be entered in their first year of programming without having to clear a gate first.

Dates, duration, task counts, permitted languages and the overseas registration process are set by the Australian Maths Trust each cycle. Confirm the current arrangements before planning around them.