2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)
11 problems from 2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred) (contest 1252), difficulty 1000-3000. 4/11 solutions verified against sample I/O.
2019-2020 ICPC, Asia Jakarta Regional Contest (Online Mirror, ICPC Rules, Teams Preferred)
ICPC/IOI | 11 problems | 4/11 verified | Difficulty 1000-3000 | 57m 7s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Copying Homework | 1000 | 5,997 | 1m 50s | ✓ | |
| B | Cleaning Robots | 2300 | dp, trees | 585 | 1m 58s | ✓ |
| C | Even Path | 1600 | data-structures, implementation | 3,982 | 12m 16s | |
| D | Find String in a Grid | 3000 | data-structures, dp, strings | 412 | 5m 48s | |
| F | Regular Forestation | 2400 | hashing, trees | 1,069 | 4m 24s | |
| G | Performance Review | 2100 | data-structures | 1,553 | 2m 5s | ✓ |
| H | Twin Buildings | 1800 | greedy, implementation | 2,846 | 4m 48s | |
| I | Mission Possible | 3000 | 35 | 4m 41s | ||
| J | Tiling Terrace | 2300 | brute-force, dp | 783 | 6m 44s | ✓ |
| K | Addition Robot | 2100 | data-structures, math, matrices | 2,064 | 4m 47s | |
| L | Road Construction | 2300 | flows, graphs | 642 | 7m 46s |
CF 1252L - Road Construction
Each city proposes exactly one potential road: city $i$ wants to connect to a single partner $Ai$. If we interpret these as undirected edges, we get exactly $N$ edges over $N$ vertices.
CF 1252J - Tiling Terrace
We are given a one-dimensional yard of length $N$, where each position is either usable soil or blocked by a rock. We want to place tiles on this line to maximize total “ghost repelling power”.
CF 1252K - Addition Robot
The problem defines a string of instructions, where each character is either A or B. This string is not just data, it defines how two numbers evolve when we process a segment of it. Starting from an initial pair of integers, we scan a range of the string from left to right.
CF 1252C - Even Path
We are given an $N times N$ grid where each cell value is not stored explicitly but defined by two arrays: the value at cell $(i, j)$ equals $Ri + Cj$. So every row contributes a fixed offset and every column contributes another fixed offset.
CF 1252I - Mission Possible
We are given a rectangular region and a small number of circular “forbidden zones” inside it. Each zone is defined by a center point and a radius, and any point strictly inside that circle is unsafe.
CF 1252H - Twin Buildings
We are given several rectangular plots of land, and we want to place two identical rectangular buildings of size $A times B$.
CF 1252D - Find String in a Grid
We are given a rectangular grid of uppercase letters. From any cell, we are allowed to build a path that first moves only to the right and then, after stopping horizontal movement, only moves downward.
CF 1252F - Regular Forestation
We are given a tree with up to 4000 nodes, and we are allowed to pick a single node and remove it. Removing a node splits the tree into several connected components, each of which is itself a tree. The number of components equals the degree of the removed node.
CF 1252G - Performance Review
We are tracking whether a single employee, Randall, remains employed after a sequence of yearly “pruning” operations in a company where employees are ranked by a fixed performance value. The company always keeps exactly $N$ employees.
CF 1252B - Cleaning Robots
We are given a tree with $N$ junctions and $N-1$ roads connecting them. A tree means that every pair of junctions is connected by exactly one path.
CF 1252A - Copying Homework
We are given a permutation of integers from 1 to N, which represents Danang's completed homework. Darto wants to submit his own permutation, different enough from Danang's, but still using numbers 1 through N exactly once.