The 2021 ICPC Asia Taipei Regional Programming Contest

13 problems from The 2021 ICPC Asia Taipei Regional Programming Contest (contest 103443), difficulty -. 9/13 solutions verified against sample I/O.

13 items

The 2021 ICPC Asia Taipei Regional Programming Contest

ICPC/IOI | 13 problems | 9/13 verified | Difficulty - | 11m 21s

#	Problem	Time	✓
A	Ice Cream	50s	✓
B	Maximum Sub-Reverse Matching	49s	✓
C	Community Service	56s	✓
D	Largest Remainder	39s
E	Composition with Large Red Plane, Yellow, Black, Gray, and Blue	48s	✓
F	What a Colorful Wall	49s	✓
G	The Treasure of the Sierra Jade	46s
H	A Big Project	51s	✓
I	Seesaw	38s
J	Transportation Network	57s	✓
K	Insertion Array	43s	✓
L	Leadfoot	1m 52s
M	Escaping the Foggy Forest	43s	✓

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443L - Leadfoot

Let the given bit string be interpreted as an $(s,t)$-combination with $s=12$ zeros and $t=14$ ones, hence $n=s+t=26$. The string is $11001001000011111101101010.$ Chase’s sequence $C{st}$, as defined in equation (41), is a generating order on $(s,t)$-combinations.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443M - Escaping the Foggy Forest

The forest is represented as a small binary grid where each cell is either 0 or 1. A 1 means dense trees, a 0 means open bushes. The grid is surrounded by implicit zeros beyond its borders, so any step outside the matrix behaves like a 0 cell.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443K - Insertion Array

We are given two strings, a and b. The string a is inserted into every possible position of b, including before the first character and after the last one. If b has length m, this produces m + 1 different strings, each corresponding to a cut position in b.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443J - Transportation Network

We are given a complete graph where every pair of vertices is connected, but edge costs are not uniform. One special vertex acts as a warehouse (vertex 0), and every other vertex is either a “main street” store in set S or an “alley” store in set U.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443I - Seesaw

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443H - A Big Project

We are given a complete set of $2n$ people who must be paired into $n$ disjoint teams of size two. Between some pairs of people, a prior collaboration exists, and those pairs are considered “good” edges. Every other pair is “bad”.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443F - What a Colorful Wall

We are given a sequence of axis-aligned rectangular posters, each painted with a color and placed on a huge wall one after another. When a new poster is placed, it completely covers anything underneath it in its region.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443G - The Treasure of the Sierra Jade

Connection interrupted. Waiting for the complete answer

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443E - Composition with Large Red Plane, Yellow, Black, Gray, and Blue

We are given a rectangular frame with fixed integer width and height. Inside this frame, a layout is described as a hierarchical structure of blocks. Each block is either a horizontal split, a vertical split, or a leaf photo.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443D - Largest Remainder

We are given a multiset of digits, each between 1 and 9, and we are allowed to arrange all of them into a single number by permuting their order. Every permutation produces a different integer. We then divide that integer by a

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443B - Maximum Sub-Reverse Matching

We are given two strings of equal length. The initial score is simply the number of positions where the two strings already match character by character. We are allowed exactly one operation on the second string: choose a segment and reverse it in place.

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443C - Community Service

We are given a dynamic system of intervals placed on a number line from 0 to n − 1. Each new person arrives with an interval [a, b] and is assigned a strictly increasing identifier based on arrival order. Later, service requests arrive as query intervals [c, d].

Practice › Codeforces Solutions › The 2021 ICPC Asia Taipei Regional Programming Contest ›

CF 103443A - Ice Cream

We are given a promotion that works in cycles. If you purchase a certain number of ice cream units, say $X$, the company gives you $Y$ additional units for free.