The 2020 ICPC Asia Jakarta Regional Contest - Problem Repository

Repository Structure

Each problem (from A to M) has their own folder. The folder name is the slug of the problem, which is the codename we used when we internally prepare the problems. The following table describes the slug for each problem

Problem Code	Problem Slug	Problem Title
A	comic	Comic Binge
B	moonsun	Moon and Sun
C	parade	Cul-De-Sac Parades
D	forbidden	Forbidden Card
E	bottleneck	Exchange Bottleneck
F	change	Shopping Changes
G	transformation	Permutation Transformation
H	task	Writing Tasks
I	redblack	Red Black Ball
J	token	Token Distance
K	beauty	Tree Beauty
L	robust	Robust Defense
M	police	Police Stations

In the problem folder, there should be exactly the following file/folder:

• description.pdf. The problem statement distributed to the contestants during the contest.
• data/. A folder consisting of all testcases. The sample inputs given in the problem statement will be in the form of sample/<slug>_sample_<testcase number>.in/ans, while the hidden testcases will be in the form of secret/<slug>_1_<testcase number>.in/ans.
• solution.cpp. The official solution used to generate the outputs of the testcases
• scorer.cpp. A validator used to validate contestants' output. The code accepts three arguments.
  • The first parameter will be used as the filename of the input file
  • The second parameter will be used as the filename of the judge's output file
  • The third parameter will be used as the filename of the contestant's output file
  • This code will print WA to stdout if the contestant's output is intended to be judged WRONG ANSWER, while it will print AC to stdout if the contestants's output is intended to be judged CORRECT.
• verifier.py. A verifier used to validate the input of the testcases. The code will crash if the input violates the problem constraint, while it will exit gracefully and will not output anything if the input satisfies the problem constraint.

Limitations

The following table describes the time limit for each problem.

Problem Code	Problem Slug	Time Limit
A	comic	1 sec
B	moonsun	1 sec
C	parade	1 sec
D	forbidden	1 sec
E	bottleneck	1 sec
F	change	2 sec
G	transformation	1 sec
H	task	1 sec
I	redblack	1 sec
J	token	2 sec
K	beauty	2 sec
L	robust	6 sec
M	police	1 sec

The memory limit for all problems is 256MB.

Solutions

Note that while there is only one official published solution, we have a lot of other solutions prepared for our internal testing. These other solutions include, but not limited to:

• Solutions in several other languages
• Solutions that is intended to be incorrect (e.g. WA, TLE, etc.)
• Other correct solutions (especially on problems with more than one correct outputs for each input)

Errata

Note that the following announcement for problem J was broadcasted to all teams during the contest:

There is a minor typo in the problem text for this problem.

On the 3rd bullet point of the "Explanation for the sample input/output #1",
the distance between two neighbouring tokens should be "0, 0, 0, 9" instead of
"0, 0, 0, 10".
The corrected problem text has been uploaded. Please re-download the problem
text if you would like to get the updated problem text.

We are sorry for the inconvenience.

The soft copy of the problem statement provided in this repository is the one distributed after the fix was made.