2019-2020 ACM-ICPC Latin American Regional Programming Contest

13 problems from 2019-2020 ACM-ICPC Latin American Regional Programming Contest (contest 102428), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2019-2020 ACM-ICPC Latin American Regional Programming Contest

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 33m 18s

#	Problem	Time	✓
A	Algorithm Teaching	2m 36s	✓
B	Build the Perfect House	2m 3s	✓
C	Cut Inequality Down	7m 32s	✓
D	Dazzling stars	3m 34s	✓
E	Eggfruit Cake	1m 27s	✓
F	Fabricating Sculptures	2m 5s	✓
G	Gluing Pictures	1m 58s	✓
H	Hold or Continue?	2m 55s	✓
I	Improve SPAM	1m 47s	✓
J	Jumping Grasshoper	2m 29s	✓
K	Know your Aliens	1m 40s	✓
L	Leverage MDT	2m 5s	✓
M	Mountain Ranges	1m 7s	✓

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428E - Eggfruit Cake

The cake border is a circular sequence of distinct fruits. We represent an eggfruit by E and a persimmon by P. A valid slice consists of a consecutive circular segment of fruits, contains at most S fruits, and must contain at least one eggfruit.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428A - Algorithm Teaching

Each teacher knows a small set of algorithms. A student trained by that teacher can learn any non-empty subset of those algorithms. Two students can coexist in the final team exactly when neither student's learned set contains the other's learned set.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428K - Know your Aliens

We have a string S describing citizens at positions (2,4,6,ldots,2N). A character H means the polynomial must be positive at that position, while A means it must be negative. We need a polynomial with integer coefficients and integer roots.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428J - Jumping Grasshoper

We have an array of distinct plant heights, indexed from left to right. A grasshopper starts at some index and looks either left or right. It jumps to the first index in that direction whose height is strictly larger than the height of the plant where it currently stands.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428M - Mountain Ranges

The trail contains N viewpoints in the order encountered while walking toward the mountain peak. Their altitudes form a non-decreasing array, so moving forward never requires going downhill. The couple may choose any viewpoint as their starting point.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428L - Leverage MDT

The grid has N rows and M columns, with every cell initially marked either G or B. Javasar wants to take a square region and have every cell in that square be good when he visits it. The useful part of the route is that he crosses the kingdom one complete row at a time.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428I - Improve SPAM

Think of every mailing list as a vertex in a directed graph. When mailing list i contains mailing list j, draw an edge from i to j. Client emails are terminal vertices.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428H - Hold or Continue?

At every decision point, Catelyn has a permanent score C and a temporary turn total X. Hoster has permanent score H. Catelyn must choose between banking the current turn total or rolling the die again.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428G - Gluing Pictures

The city name is a string C. A picture can capture any contiguous section of C, so every substring of C is a possible picture. We may arrange the pictures in any order and concatenate their contents to obtain a friend's name.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428F - Fabricating Sculptures

A sculpture base can be represented by an array of positive integers [ a1,a2,ldots,aS, ] where (ai) is the number of blocks in the (i)-th stack. We need exactly (S) stacks and exactly (B) blocks, so [ a1+a2+cdots+aS=B, qquad aigeq 1. ] The order of the stacks matters.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428B - Build the Perfect House

We have a set of vegetable plants represented by points in the plane. The desired house is a square whose center is fixed at the origin, but its orientation is completely free. A plant may lie on the boundary of the square, but it cannot lie strictly inside it.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428D - Dazzling stars

Each star has a fixed position (X, Y) and a brightness B. Bernie may rotate the entire picture, and then the printer scans from top to bottom. After rotation, a star with a larger transformed Y coordinate is printed earlier.

Practice › Codeforces Solutions › 2019-2020 ACM-ICPC Latin American Regional Programming Contest ›

CF 102428C - Cut Inequality Down

For each month, the farmer's wealth changes by the corresponding value in A. After adding that month's income, the wealth is immediately forced back into the interval [L, U]: values above U become U, and values below L become L.