UTPC Contest 02-10-23 Div. 1 (Advanced)

9 problems from UTPC Contest 02-10-23 Div. 1 (Advanced) (contest 104181), difficulty -. 7/9 solutions verified against sample I/O.

9 items

UTPC Contest 02-10-23 Div. 1 (Advanced)

Div. 1 | 9 problems | 7/9 verified | Difficulty - | 10m 37s

#	Problem	Time	✓
C	Brownie Baking	58s	✓
D	Grumble Gym	1m 18s
E	After School	56s	✓
F	Prime Precipitation	57s	✓
G	Rose and Collection	1m 27s
H	Not-so Beautiful Painting	1m 4s	✓
I	A Rainy Delivery	1m 6s	✓
J	Dangerous Driving	1m 32s	✓
K	Rain on Birthday	1m 19s	✓

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181J - Dangerous Driving

We are given a directed graph where every intersection has exactly one outgoing road. If we start at any node and keep following the outgoing edge, we deterministically move to another node in one minute per step.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181K - Rain on Birthday

We maintain a dynamic collection of integers, each representing a chemical. Over time, we insert new values into this set.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181I - A Rainy Delivery

We are given a directed graph where each node represents a friend’s house and each directed edge represents a one-way road. You are allowed to choose any starting house, then repeatedly travel along directed roads, possibly revisiting houses and roads multiple times.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181G - Rose and Collection

Each rose can be thought of as an independent “encounter” that offers a reward: if Rose successfully deals with that rose, she earns one point toward the total number of roses collected.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181H - Not-so Beautiful Painting

We are given a very large grid, conceptually of size $10^9 times 10^9$, but we never work with it explicitly. Instead, we are told about $N$ non-overlapping axis-aligned rectangles drawn on this grid. Each rectangle contributes a set of unit cells that are initially painted.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181F - Prime Precipitation

Each integer height from 1 up to H represents a raindrop that is released once, and each drop falls independently until it reaches height 1.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181D - Grumble Gym

We are given a sequence of energy sources that Alberto consumes strictly in order. Each source contributes a fixed amount of energy, and once consumed it cannot be revisited or split. After every completed workout set, Alberto’s energy is fully reset to zero.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181C - Brownie Baking

We are given a set of friends, each of whom wants a brownie of at least a certain minimum size. We are also given a collection of baking tins, each tin producing exactly one brownie of a fixed size.

Practice › Codeforces Solutions › UTPC Contest 02-10-23 Div. 1 (Advanced) ›

CF 104181E - After School

We are given an $n times n$ grid where each cell is determined by its row $i$ and column $j$. The value in that cell is the integer division result $leftlfloor frac{j}{i} rightrfloor$. In other words, each row $i$ is formed by dividing all column indices by $i$, rounding down.