UTPC Contest 12-01-23 Div. 1 (Advanced)

7 problems from UTPC Contest 12-01-23 Div. 1 (Advanced) (contest 104834), difficulty -. 3/7 solutions verified against sample I/O.

7 items

UTPC Contest 12-01-23 Div. 1 (Advanced)

Div. 1 | 7 problems | 3/7 verified | Difficulty - | 9m 19s

#	Problem	Time	✓
A	Baklava Cutting	1m 13s
B	Baklava Baking	1m 22s
C	Baklava Batches	1m 2s	✓
D	Deep Dish Cleaning	1m 39s
E	Sweetest Piece	1m 4s	✓
F	The Floor is Baklava	1m 30s	✓
G	Baklava's Baklava	1m 29s

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834G - Baklava's Baklava

We are given a sequence of integers representing flavors placed on a line of layers. A valid interval is any contiguous subarray, but only some of these intervals are counted.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834F - The Floor is Baklava

We are given a grid where each cell behaves like a piece of floor with a limited tolerance to being stepped on. Every friend starts at the top-left corner and tries to reach the bottom-right corner by moving only in four directions.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834D - Deep Dish Cleaning

We are given a circular structure with a fixed number of positions around it. Between these positions, there are intervals marked by non-overlapping “retainer wires”, which effectively partition the circle into consecutive cleaning segments.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834E - Sweetest Piece

We are given a grid of size $n times m$, where each cell has a height value. Syrup is poured onto some starting cells, and from each starting point it spreads across the grid following a rule that depends on height and movement constraints.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834B - Baklava Baking

We are working with nine-digit integers that represent possible configurations of Janise’s baklava layers. Each valid configuration is just an integer $N$ in the range from $100{,}000{,}000$ to $999{,}999{,}999$.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834A - Baklava Cutting

We start with a square pastry of side length $l$. Mila performs a repeated geometric construction: each round she draws a smaller square inside the current one using midpoints of its sides, producing a new, rotated, and strictly smaller square.

Practice › Codeforces Solutions › UTPC Contest 12-01-23 Div. 1 (Advanced) ›

CF 104834C - Baklava Batches

We are given two arrays of equal length. One array represents target quantities for different orders, and the other represents current quantities in prepared batches.