Welcome to the Qualification Round of the Swiss Olympiad in Informatics! You will find below an overview of what you’ve done so far as well as a few things that you should know before getting started.
Contest ends at 2024-11-30T23:59:59+01:00
Category | Task | Total | Subtask 1 | Subtask 2 | Subtask 3 | Subtask 4 | Subtask 5 |
---|---|---|---|---|---|---|---|
Junior only | cheesemachine | ‒/100 | ‒/10 | ‒/13 | ‒/17 | ‒/26 | ‒/34 |
Junior only | rotation | ‒/100 | ‒/10 | ‒/16 | ‒/11 | ‒/27 | ‒/36 |
Both | landscaping | ‒/100 | ‒/13 | ‒/19 | ‒/17 | ‒/22 | ‒/29 |
Both | trampoline | ‒/100 | ‒/8 | ‒/14 | ‒/29 | ‒/14 | ‒/35 |
Both | train | ‒/100 | ‒/23 | ‒/15 | ‒/20 | ‒/16 | ‒/26 |
Both | hikingsigns | ‒/100 | ‒/13 | ‒/15 | ‒/16 | ‒/27 | ‒/29 |
Regular only | circuit | ‒/100 | ‒/20 | ‒/20 | ‒/20 | ‒/20 | ‒/20 |
Regular only | cakeicing | ‒/100 | ‒/10 | ‒/15 | ‒/75 | ||
Regular only | qrh | ‒/100 | ‒/25 | ‒/25 | ‒/25 | ‒/25 |
You may use any programming language to solve the tasks of the Qualification Round. To solve a practical task, you have to design a program, download an input file, run the program on the data in that file, write the results in another file and upload it along with the source code to the website, which will grade your submission and display the number of points that you’ve earned as well as an explanation if you did not get all the possible points. In order to read the data in the input file, make sure that your program either reads directly in that file or redirect the standard input to it (in a terminal running on Linux, Windows or macOS, you can do that by using the command ‘yourprogram < inputfile’, replacing ‘yourprogram’ and ‘inputfile’ by the paths to the actual program and input file). More elaborate explanations about how to solve the tasks of the Qualification Round await you on our wiki and our training page. Note that in case you get stuck on the tasks, you can move to next task and try again later: no need to solve them in order.
You should also hear about our workshops! In October and November, we offer workshops about algorithmics. It’s a great opportunity to learn all you need for the Qualification Round and to meet other like-minded participants. Whether you’re a beginner or an experienced programmer, it’s worth it to come. More info and registration here.
Don’t hesitate to contact us at info@soi.ch if you have any question about programming or the tasks.
The Qualification Round has two categories: Junior and Regular. You can participate in the Junior category if you are eligible to participate in this year’s edition of SOI as well as the two next ones. If you are eligible as a junior, you can choose to participate in the Junior or in the Regular category or in both.
You qualify for the finals and the Sarnen Camp if you are placed under the
Additionally, we may distribute wildcards.
We wish you good luck, hope you will enjoy solving our tasks and look forward to meeting you at our workshops.
Binna designed a new machine to produce the best cheese throughout Mouseland. She is now testing it to make sure the cheese produced is in fact the best you can find before revealing the machine to the public. Each second, she notes down the results of her test: a number which combines the flavor of the cheese, the size of the cheese, the time elapsed since the machine was turned on, and the quantity of cheese produced. After gathering some amount of data, she would like to know if there is an anomaly in the results she received. If such an anomaly occurred, she would need to dismantle the machine to fix the issue. If no anomaly occurred, then the machine should be working correctly and she would like to predict the next result she should receive.
The machine’s output is easily predictable if the machine is working correctly. In fact, if everything works correctly, the machine’s result should always increase or always decrease by the same amount each second. An anomaly has occurred if the results Binna received don’t respect this rule at some point.
Knowing that, could you tell Binna if the machine produced an anomaly or, in the case no anomalies are detected, which result she should receive next?
All subtasks have the same input and output format.
The first line contains the number of test cases . The test cases follow in the following format:
For the -th testcase, output a single line:
Binna only ran her test for two seconds because she didn’t want to stress her machine too much, and was eager to try the first wheel of cheese her machine produced.
Input:
5 2 1 2 2 10 15 2 10 5 2 5 -5 2 42 42
Output:
Case #0: 3 Case #1: 20 Case #2: 0 Case #3: -15 Case #4: 42
Comment:
To submit for this subtask, please log in.
Binna improved her machine and assures you that no anomalies were produced during her test, but she only ran it for three seconds.
Input:
3 3 10 15 20 3 13 8 3 3 42 42 42
Output:
Case #0: 25 Case #1: -2 Case #2: 42
Comment:
To submit for this subtask, please log in.
Binna didn’t like the taste of the cheese produced by her last machine. Unfortunately, her machine wasn’t perfect after all, even if she didn’t catch any anomalies. Because of an urgent meeting, Binna was once again only able to test her machine for three seconds before leaving. However, her test has a great chance to contain anomalies because of the bad taste.
Input:
3 3 10 12 15 3 10 15 20 3 42 42 42
Output:
Case #0: NO Case #1: 25 Case #2: 42
Comment:
To submit for this subtask, please log in.
Binna worked really hard on this new prototype and it now works perfectly. Thus, the test she ran doesn’t contain any anomalies. She also learned from her mistakes and ran the test for much longer than before.
Input:
4 4 9 12 15 18 5 10 15 20 25 30 3 9 7 5 2 42 42
Output:
Case #0: 21 Case #1: 35 Case #2: 3 Case #3: 42
Comment:
To submit for this subtask, please log in.
Binna’s last machine was used so many times to produce cheese for the entire population of Mouseland that some parts broke. After fixing them, the machine unfortunately doesn’t work as well as before and may produce some anomalies when testing it.
Input:
4 4 10 12 15 18 5 10 15 20 25 30 3 9 7 5 2 42 42
Output:
Case #0: NO Case #1: 35 Case #2: 3 Case #3: 42
Comment:
To submit for this subtask, please log in.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Disaster strikes! Stofl was going for a hike in the rainforest when he fell down a sinkhole and ended up trapped in an underground tomb. In the center of the room there is a huge wheel with letters on it. Stofl can rotate the wheel however he likes as well as swap letters. Only once all the letters are brought into the correct position and the wheel is brought into the correct orientation will the door unlock. Stofl has found some clues on the walls but is not quite sure of the correct solution, so he would like to try out a few modifications and then check what letters are in specific positions on the wheel. Help him by writing a program that can simulate repeatedly rotating the wheel and repeatedly swapping two letters on the wheel and can answer his questions about what letter is currently located at a given position.
Formally the task can be formulated as follows: You are given a string consisting of lowercase letters and rituals. Each ritual is one of the following types:
The first line contains the number of test cases . test cases follow of the following format:
Ritual type is performed transforming = “programming” into = “prmgramoing” ( and ):
Ritual type is performed transforming = “programming” into = “ngprogrammi” ():
For the -th test case, print a line “Case #i:” followed by a string of lowercase letters where the -th character of the string is the answer to the -th ritual of type .
To make sure that you know what you are doing, Stofl wants to test you first whether you can accurately answer rituals whose answers he already knows, namely questions about the original, unmodified wheel. Therefore, in this subtask there are no rituals of types and .
Input:
3 3 4 soi 1 0 1 2 1 1 1 0 5 4 binna 1 1 1 0 1 2 1 4 5 6 mouse 1 0 1 4 1 0 1 1 1 2 1 3
Output:
Case #0: sios Case #1: ibna Case #2: memous
Comment:
To submit for this subtask, please log in.
Mouse Stofl has found another smaller wheel inside the tomb which must also be solved to open the door. As this one is easier, Stofl will solve this one first. He could do it on his own, but to reassure him of your programming skills (after all, his life is on the line), he still asks you to simulate his rituals and will give you questions to answer.
Input:
2 3 5 pjp 3 2 2 1 2 1 0 1 1 1 2 6 14 mfegaw 1 5 3 0 1 5 3 0 2 4 5 1 2 2 0 3 1 3 3 4 3 2 3 3 3 5 1 1 1 0
Output:
Case #0: jpp Case #1: wwemaw
Comment:
To submit for this subtask, please log in.
Now assured that your program is correct, Stofl will start solving the large wheel. His strategy is to initially only swap some letters and only in later subtasks to rotate the wheel. Again, simulate his operations and answer his queries.
Input:
3 3 9 soi 1 0 1 2 1 1 1 0 2 0 2 1 0 1 2 1 1 1 0 5 7 binna 2 0 1 1 1 1 0 1 2 1 4 2 1 2 1 1 5 8 mouse 1 0 1 4 2 0 4 1 0 1 1 1 2 2 1 3 1 3
Output:
Case #0: siosisoi Case #1: binan Case #2: meeouo
To submit for this subtask, please log in.
Now that most letters are in the correct positions, Stofl must rotate the wheel into the correct orientation. As the wheel is very large, he can’t see most of the letters on the other side. Help him by again simulating the rotations he makes and answering his questions.
Input:
2 3 16 bul 1 0 3 1 1 0 3 1 1 0 3 1 1 0 3 0 1 0 3 1 1 0 3 1 1 0 3 1 1 0 3 0 5 6 stofl 3 2 1 0 1 1 1 2 1 3 1 4
Output:
Case #0: blubblub Case #1: flsto
Comment:
To submit for this subtask, please log in.
To finish solving the wheel, Stofl will need you to be able to handle all three types of rituals.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Still mesmerized by the pyramids Mouse Binna saw while participating at the MOI (Mouse Olympiad in Informatics) last year in Egypt, she concludes that the world needs more pyramids! Inspired by a picture of a pyramid-shaped mountain in Bolivia, Mouse Binna is determined to try and carve out such mountains herself once she gets there.
Having learned that simplification is a vital problem solving technique, Mouse Binna decides to make use of it here by modeling the terrain as a list of heights given as .
The goal is to form a pyramid out of the terrain by making it into a pyramid sequence. A pyramid sequence is defined as a list of integers of the form .
After wasting investing countless hours looking for the most efficient digging techniques, Mouse Binna concludes it is best to use a combination of two different landscaping methods.
Since Mouse Binna is ready to use all means necessary to create the best pyramid mountains, both operations can be performed any number of times. Can you help Mouse Binna by carving out the biggest pyramid mountains?
Mouse Binna is looking at a hillside and wants to know whether it already forms a pyramid mountain, without applying any of the landscaping methods just yet.
The first line contains the number of test cases . test cases follow in the following format:
The first line of the test case contains , the number of tiles. On the second line values follow, where the -th value is the height of the terrain at position .
For the -th test case, output a line “Case #i: YES/NO” depending if the list of numbers forms a valid pyramid sequence.
There are test cases. In every test case, and .
Input:
2 3 1 2 1 3 1 2 2
Output:
Case #0: YES Case #1: NO
Comment:
To submit for this subtask, please log in.
In this subtask, Mouse Binna wants to start carving up some mountains. To start of, however, she only wants to test out her first technique (the explosive one), i.e. you are only allowed to perform operations of type 1 on the list. Can you help her form the longest pyramid sequences?
Same as subtask 1.
For the -th test case, output a line “Case #i: l”, where is the length of the longest pyramid mountain that can be formed by landscaping.
There are test cases. In every test case, and . You are only allowed to perform operations of type 1.
Input:
2 5 5 1 2 1 1 7 1 2 1 2 3 2 1
Output:
Case #0: 3 Case #1: 5
Comment:
To submit for this subtask, please log in.
Similar to the previous subtask, Mouse Binna now wants to try the second landscaping method. Or in other words, you are only allowed to perform operations of type 2 in this subtask.
Same as subtask 2.
Same as in subtask 2, but now you are only allowed to perform operations of type 2.
Input:
2 3 1 2 2 5 1 2 3 4 1
Output:
Case #0: 3 Case #1: 5
Comment:
To submit for this subtask, please log in.
Being satisfied by the results from the previous tests, Mouse Binna now wants to use both techniques in conjunction to carve out the biggest pyramid mountains possible.
Same as subtask 2.
Same as subtask 2, but now you can perform operations of type 1 and 2.
Input:
2 4 1 1 2 2 6 1 2 3 3 2 3
Output:
Case #0: 3 Case #1: 5
Comment:
To submit for this subtask, please log in.
In this final subtask, Mouse Binna wants to apply her plans on even bigger mountains.
Same as subtask 2.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Mouse Stofl is going to visit an amusement park. He is very excited to go to his favorite attraction, the trampoline park.
There are trampolines in a line. Each trampoline has a jumpiness value associated with it. More formally, the -th trampoline has a jumpiness value of . Jumping on the -th trampoline will launch Stofl up and Stofl will land on exactly the -th trampoline, where Stofl will continue jumping, until he reaches the -th trampoline where he stops. All trampolines have a jumpiness except the -th one which has jumpiness . It is guaranteed that for all , meaning that Stofl will never jump past the last trampoline.
All subtasks have the same input and output format.
The first line contains the number of test cases . The test cases follow in the following format:
For the -th testcase, output a single line containing “Case #t: x” where is equal to the maximum number of trampolines Stofl can visit.
How many trampolines Stofl can visit if he starts at the first trampoline?
Input:
3 3 2 1 0 3 1 1 0 5 1 1 2 1 0
Output:
Case #0: 2 Case #1: 3 Case #2: 4
Comment:
To submit for this subtask, please log in.
How many trampolines Stofl can visit if he selects the starting trampoline optimally?
Input:
3 3 1 1 0 4 2 1 1 0 5 4 1 2 1 0
Output:
Case #0: 3 Case #1: 3 Case #2: 3
Comment:
To submit for this subtask, please log in.
The subtask is the same as subtask 2, but with more trampolines.
Input:
3 3 1 1 0 4 2 1 1 0 5 4 1 2 1 0
Output:
Case #0: 3 Case #1: 3 Case #2: 3
Comment:
To submit for this subtask, please log in.
Stofl can choose the starting trampoline optimally, but he can also adjust the jumpiness of exactly one (any) trampoline with any jumpiness he likes.
Input:
3 3 2 1 0 5 4 3 1 1 0 5 1 2 2 1 0
Output:
Case #0: 3 Case #1: 4 Case #2: 4
Comment:
To submit for this subtask, please log in.
The subtask is the same as subtask 4, but with more trampolines.
Input:
3 3 2 1 0 5 4 3 1 1 0 5 1 2 2 1 0
Output:
Case #0: 3 Case #1: 4 Case #2: 4
Comment:
To submit for this subtask, please log in.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Mouse Binna is a railway engineer. She is designing a straight railway line with stations, numbered . Each station has a level. Various trains will operate on this line. Some long-distance trains may only stop at major high-level stations, some local trains may stop at almost all stations.
There is a rule: if a train stops at station , it must also stop at all stations between its starting & terminal stations (inclusive) whose level is greater than or equal to the level of station .
For example, with the following levels of these stations, the IC, IR, RE, R trains comply with the rule. However, the “invalid train” doesn’t comply because it stops at station but not station which has the same level.
Mouse Binna starts from designing a mini railway line.
The first line contains the number of test cases . test cases follow in the following format:
For the -th test case, output a line “Case #i: K”, where is the largest number mentioned above.
There are test cases. In each test case we have:
Input:
2 4 2 3 0 1 3 3 0 2 3 15 6 3 0 1 14 5 0 1 3 8 14 10 0 1 2 3 4 5 6 8 12 14 9 6 7 8 9 10 11 12 13 14 4 5 6 8 9 4 0 1 2 4
Output:
Case #0: 1 Case #1: 5
Comment:
To submit for this subtask, please log in.
There are a considerable number of stations and trains. All the trains have starting station and terminal station .
Same as Subtask 1
Same as Subtask 1
There are test cases. In each test case we have:
Input:
2 6 2 5 0 1 2 3 5 5 0 2 3 4 5 5 3 5 0 1 2 3 4 3 0 2 4 2 0 4
Output:
Case #0: 1 Case #1: 3
To submit for this subtask, please log in.
There are a considerable number of stations and trains.
Same as Subtask 1
Same as Subtask 1
There are test cases. In each test case we have:
To submit for this subtask, please log in.
There are a lot of stations and trains. All the trains are direct; in other words, they don’t have any intermediate stop except the starting and terminal station.
Same as Subtask 1
Same as Subtask 1
There are test cases. In each test case we have:
Input:
2 6 6 2 1 2 2 1 4 2 2 3 2 3 4 2 2 5 2 2 4 5 2 2 1 2 2 1 2
Output:
Case #0: 4 Case #1: 2
To submit for this subtask, please log in.
There are a lot of stations and trains.
Same as Subtask 1
Same as Subtask 1
There are test cases. In each test case we have:
To submit for this subtask, please log in.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Mouse Binna has been appointed as director of tourism for Bolivia. She identified the lack of hiking infrastructure as one of the biggest problems and decided this to be the big point she wants to address. The nature is beautiful, there are plenty of interesting landmarks, and there already is a quite extensive road network.
The road network can be described as a set of intersections and a set of roads where each road connects exactly two intersections. The existing road network has the property that between any pair of intersections there is at most one path. Some of the intersections are especially beautiful and are called landmarks.
One piece of feedback Mouse Binna received is that mice can get lost in the wilderness. For that end, Mouse Binna decided to place hiking signs at each intersection. Each hiking sign shows a list of landmarks that can be reached and their respective distances.
Binna wants to build new roads in order to ensure the following:
Is it possible to build new roads such that the constraint is satisfied? If yes, find a minimal set of roads that Binna needs to build.
All subtasks have the same input and output, and the same limits.
The first line contains the number of test cases . The test cases follow in the following format:
For the -th testcase:
In all subtasks we have:
In this subtask we have . This means one can go from any intersection to any other intersection using a seqeuence of adjacent roads.
Input:
3 5 4 2 0 3 4 1 2 4 4 3 1 0 5 4 2 1 4 4 1 2 4 4 3 1 0 4 3 1 0 0 1 1 2 2 3
Output:
Case #0: 0 Case #1: Impossible Case #2: 0
To submit for this subtask, please log in.
In this subtask roads only connect intersections with index at most . (In other words for all edges .) Additionally all intersections larger than are guaranteed to be landmarks.
Input:
1 10 3 7 1 4 5 6 7 8 9 2 3 3 1 0 1
Output:
Case #0: 1 0 4
To submit for this subtask, please log in.
In this subtask any intersection has at most 2 adjacent roads.
Input:
4 3 1 1 1 1 2 3 2 1 1 0 1 1 2 5 2 2 1 3 0 1 1 2 6 0 1 1
Output:
Case #0: 0 Case #1: Impossible Case #2: 1 2 3 Case #3: 4 1 0 0 2 2 3 3 4
To submit for this subtask, please log in.
In this subtask all components of the road network contain at least one landmark.
No further constraints.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Stofl is really tired of solving conventional tasks in Rust, so he decided to study circuits — a much simpler way of programming than the standard programming languages.
A program defining a circuit consists of several operations, where each operation is defined in the form X = Y op Z, where is a variable name for the new value, and reference some previously computed variables or constants, and op is a binary operation, which is restricted to +, - or max. Additionally, there is a special variable in, that represents a 2D-array of size that is being fed as an input to the circuit, and one special variable out, that represents the output of the circuit.
Below you can find an example circuit that computes the sum of the input elements, assuming and :
column1 = in[0][0] + in[1][0] column2 = in[0][1] + in[1][1] two_columns = column1 + column2 column3 = in[0][2] + in[1][2] out = two_columns + column3
There are the following restrictions for the circuits:
Stofl already knows how to compute the sum of integer values using his favorite programming language, so to try out programming with circuits he decided to solve a different task. Given a 2D-array with integers from range , a cross is defined as any vertical segment intersecting any horizonal segment. Furthermore, a cross must contain at least one element of the array, i.e. a 0x0 cross is not allowed. An example of a cross can be found below:
Stofl is interested in designing a circuit that computes the value of the maximum sum among all crosses in a given grid. Please help him to design it!
The first line contains a single integer – the number of test cases. Then test cases follow, each of them contains one line with two integers and – the size of the grid (). Note that for a given subtask the input will never change.
For each test case, output a circuit that computes the maximum cross in a grid .
Input:
2 1 1 1 2
Output:
Case #0: out = in[0][0] + 0 Case #1: max_single = in[0][0] max in[0][1] together = in[0][0] + in[0][1] out = max_single max together
Comment:
This task has 5 subtasks. The score for each test case in each of those subtasks depends on the size of the circuit and its depth . The size is defined as the total number of operations (i.e. lines) in your circuit. Meanwhile, the depth is defined as the maximum distance between the out variable and any input variable in terms of operations. Or, in other words, if you were to substitute all the equations into one, the depth is the maximum amount of nested brackets. For example, in the second test case above the combined equation would look like this:
out = (in[0][0] max in[0][1]) max (in[0][0] + in[0][1])
which gives a depth of 2. The score for such a circuit will then be given according to the following snippet (no closed formula as we are not at the math olympiad here, formulas are overrated anyways):
double get_score(double ratio) const { return min(1.0, 0.3 + 0.7 * ratio * ratio); } double score(int n, int m, double depth, double size, int max_score) const { double S = get_score(n * m / size); double D = 0.3 * get_score(n * m / depth) + 0.7 * get_score(2 * log(n * m) / depth); return S * D * max_score; }
Then, the score for a test is defined as the minimum score across all test cases. If your circuit is not valid (i.e. contains syntax errors or is not correctly computing the maximum sum among all crosses), you will get Wrong answer and therefore 0 points for the entire subtask.
To submit for this subtask, please log in.
To submit for this subtask, please log in.
To submit for this subtask, please log in.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Binna and Stofl both have a pot with ml of Icing. For each pour, they can fill some part of the remaining icing into the jar. The amount of icing must be equal to , where is the amount of pieces in the pour and the thickness.
At the end of the game, the importances of all pieces with the icing of a mouse get added. The sum counts as the score for this mouse.
The program communicates with the grader over stdin / stdout.
The jar is not allowed to go off the cake.
When it’s the opponents turn, your program gets the pour the opponent made in the same format.
A program should print a pour with if it can’t or does not want to pour. However, this still counts as one of its turns.
These limits hold for all possible maps. They are thus too loose for the majority of map configurations. More details about the map configurations are in the section Maps.
Open the example in the visualization
The cake in the beginning of the game. The importances are represented as black squares. The bigger the square, the greater the importance.
The cake after the first pour of the orange mouse. Three pieces were iced with thickness 7.
The cake after the first pour of the blue mouse. The piece at the bottom left was iced with thickness 8 and now has the blue icing, because 8 > 7.
The cake after the second pour of the orange mouse. The piece at the bottom right was iced with thickness 2.
The cake after the second pour of mouse blue, at the end of the game. Mouse blue iced all the pieces at the right with thickness 3. The piece at the bottom right now has the blue icing (3 > 2), but the piece in the middle right stays orange (3 <= 7).
Here is the communication from the perspective of the orange mouse. The input of the program is marked with “<”, the output with “>”.
< 2 3 3090 2 < 8 166 < 558 706 < 753 430 < Y > 1 1 7 3 > L D < 0 0 8 1 < > 1 0 2 1 > < 1 0 3 3 < U U
The creativity task will take place on the creativity platform. There you can create new bots, upload the source code for your bots, play games against other participants (or your own bots), view the results of tournaments, and see a ranking of all bots. If you have any questions about the platform do not hesitate to ask us.
A few notes about the platform:
Write a bot that follows the rules and can beat the example bot. Just play and win any game against the random bot on the creativity platform. We have to manually update the scores, so it might take a few days until they show up on the qualification round ranking.
Write a bot which is able to beat our smart bot. Play and win games on at least 5 different map layouts against the smart bot on the creativity platform. You may choose the other map parameters freely. We have to manually update the scores, so it might take a few days until they show up on the qualification round ranking.
You play against other participants of SOI in multiple tournaments. Based on the rankings of these you will get points.
Each tournament is worth a certain amount of points and you will get a fraction of these based on your rank: 100% for rank 1, then 10% less for every following rank until rank 6 (50%), then 5% less for every following rank. Some of the bots are not from participants, so the points you receive might not match the displayed ranking.
In the end, your score for this subtask will be the maximal score you achieved during any tournament. There will be the following tournaments:
We will update the scores on the qualification round ranking after every tournament, but as we do this manually it might take a few days.
The Creativity tournament does not count for the qualification. The results will be hidden until the SOI-Camp. In the SOI-Camp we will present the results and award the winner with a prize. The maximum number of points one can get from this task for Qualification is thus 85.
On the creativity platform you can view additional details about the tournaments. A tournament consists of multiple map configurations. For each configuration you will play against every other bot. For a win on a map you will get , for a draw and for a loss score. The ranking will be according to the sum of these scores across all played games.
There are a few map configurations on which we will run the bots. A configuration consists of the following parameters:
The number of pieces with importance larger than zero will be noted as .
It is important for interactive tasks to flush the output buffer after every turn to make sure the server can see your output.
Use the following commands:
Furthermore it is important that you don’t wait for more characters than the server gives you as an input. For example spaces or line endings in C format strings are a common source for errors. For example if you read the last variable in the input with “scanf("%d ", &x);” it will wait for the next character that is not a space or a line break. You will receive such a character only after you printed your next turn. To solve this use “scanf("%d", &x);” instead (no non-printable characters after the “%d”).
If you want to run your bots locally you can download the judge and the visualization here. This also includes a sample C++ bot. There is a short explanation on how to run the judge and visualization included. They are the exact same version which is used on the creativity platform.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
The homework part of the qualification round (QRH) consists of 4 tasks, each of which is worth 25 points. You can gain a maximum of 100 points counting towards your score of the regular round.
QRH GraderThis helps you get familiar with our grading system which we will use in all our events after the qualification round, including workshops, camp, finals, and team selection.
You can submit in C++ (recommended), Java or Python.
C++: | If you don’t have a setup already, we recommend installing VSCode. |
---|---|
Java: | Read Java on the SOI Grader. |
Python: | Read Python on the SOI Grader. |
For QRH you can discuss solutions with friends or publicly on Discord, as long as you don’t share source code. We are also happy to help you! If you need help with the grading system or have questions regarding the theory or tasks, don’t hesitate to ask here or in Discord.
Don’t hesitate to ask us any question about this task, programming or the website via email (info@soi.ch).
Rank | Username | Total (600) | cheesem… (100) cheesemachine | rotation (100) | landsca… (100) landscaping | trampoline (100) | train (100) | hikings… (100) hikingsigns |
---|---|---|---|---|---|---|---|---|
loading ... |
Rank | Username | Total (700) | landsca… (100) landscaping | trampoline (100) | train (100) | hikings… (100) hikingsigns | circuit (100) | cakeicing (100) | qrh (100) |
---|---|---|---|---|---|---|---|---|---|
loading ... |