Paths IT translation

• Under “Spiegazione” the following: “(1, 2), (2, 3), (3, 4), (2, 5), (1, 7) e (7, 9)” should be “(1, 2), (2, 3), (3, 4), (2, 6), (1, 7) e (7, 9)”.

Nom RO translation

• The following: “daca distanta dintre doua pietre care au acelasi numar scrie pe ele este egala cu un multiplu de M inchi” should be “daca distanta dintre doua pietre care au acelasi numar scris pe ele este egala cu un multiplu de M inchi”.

NoM Clarification

• The phrasing “if the distance between two stones that have the same number written on them is a multiple of M inches” means “if there exist two stones with the same number written on them such that the distance between them is a multiple of M inches”.

Weirdtree Clarification

• The restriction that l = 1 and r = N is valid for both operations (both cut and inspect operations).

General

• The testing interface is provided “as is”, and we do not endeavour in providing support for it, unfortunately, as per the competition rules.
• This means that, for example, the testing interface most likely will not work properly for task Weirdtree.

Scoring

• Points are awarded only for correctly solved groups of inputs. If there are partial grading rules for the problem, then the score for an input group will be the lowest among the scores for the particular test inputs contained in the group.
• The score of a contestant for a task is the sum of the scores obtained for each group of this task. The score obtained for a group is the highest score obtained on this group among all contestant’s submissions for the task.

Weirdtree Clarification Subtask 5

• For subtask 5 what the constraints tells is that:
  1. All 3 types of schedule entries are possible (cut, magic, inspect).
  2. For operation cut, it always holds that l = 1, r = N (no constraint on k).
  3. For operation inspect, it always holds that l = 1, r = N.

Last 10 Minutes

• We removed the constraint to submit at most once per minute per problem.