UTPC Contest 09-22-23 Div. 1

8 problems from UTPC Contest 09-22-23 Div. 1 (contest 104618), difficulty -. 4/8 solutions verified against sample I/O.

8 items

UTPC Contest 09-22-23 Div. 1

Div. 1 | 8 problems | 4/8 verified | Difficulty - | 9m 45s

#	Problem	Time	✓
C	Sweet Selections	1m 8s	✓
D	Ice Cream Lasagna	1m 15s
E	Cone Coloring	1m 19s	✓
F	Bing is Chilling	1m 6s	✓
G	Ice Cream Gambling	33s
H	Cone Factory	1m 36s	✓
I	Magic Sprinkles	1m 14s
J	Starfruit Ice Cream	1m 34s

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618J - Starfruit Ice Cream

We are asked to choose exactly $n$ distinct cells in an $n times n$ grid. Each chosen cell is a “pouring point” where a unit of milk is placed.

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618I - Magic Sprinkles

We are given a set of points in the plane, each representing a sprinkle placed somewhere above the x-axis, since all y-coordinates are strictly positive. Each sprinkle has a color, either red or blue.

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618H - Cone Factory

Each cone mold sits at a distinct integer coordinate on the X-axis. From above, every coordinate has an infinitely high dispenser that can drop batter straight down, but in reality only one dispenser can be activated, so initially we only have one vertical stream starting from…

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618F - Bing is Chilling

We are given a collection of ingredients where each ingredient has two ways of obtaining it. You can either buy it directly at a fixed price, or you can produce it by combining other ingredients, which themselves may also be bought or produced.

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618G - Ice Cream Gambling

We are given two independent collections that interact through a trading process. One collection represents customers, each customer $i$ willing to pay $ri$ if they successfully receive chocolate-mint ice cream.

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618E - Cone Coloring

We are given a line of $N$ dyes, each with a positive integer beauty value. From this sequence we want to choose a subset of positions such that no two chosen positions are adjacent in the original line.

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618D - Ice Cream Lasagna

We are given a vertical stack of $n$ ice cream layers. Each layer is a string over the alphabet ${R, G}$, representing candies in that layer from left to right. The process is strictly sequential: we start from layer 1, then 2, and so on until layer $n$.

Practice › Codeforces Solutions › UTPC Contest 09-22-23 Div. 1 ›

CF 104618C - Sweet Selections

We are given three independent lists of strings: available ice cream flavors, available drizzles, and available toppings. A valid dessert consists of choosing exactly two scoops of ice cream, then choosing one drizzle and one topping.