UTPC Contest 09-08-23 Div. 2 (Beginner)

8 problems from UTPC Contest 09-08-23 Div. 2 (Beginner) (contest 104574), difficulty -. 7/8 solutions verified against sample I/O.

8 items

UTPC Contest 09-08-23 Div. 2 (Beginner)

Div. 2 | 8 problems | 7/8 verified | Difficulty - | 10m 35s

#	Problem	Time	✓
A	Iguana Playground	1m 7s	✓
B	Preferred Valley	1m 6s	✓
C	Iridescent Iguanas	1m 59s	✓
D	XP Challenge	1m 5s	✓
E	Shifty Shuffling	1m 28s	✓
F	Egg	1m 4s	✓
G	Iguana Walking	1m 19s	✓
H	Go Iguanas!	1m 27s

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574H - Go Iguanas!

We are given a partially played Go board where each cell is either black, white, or empty. For each query, we are asked to imagine placing a single stone of a given color on an empty cell and decide whether that move would immediately result in at least one connected group of…

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574G - Iguana Walking

We are given a directed functional graph: each iguana i has exactly one outgoing edge to p[i], so from every node there is exactly one deterministic next position.

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574F - Egg

Each egg comes with two independent ways of extracting value: frying it gives one score, scrambling it gives another, and skipping it gives zero contribution. The constraint is that Ivan cannot freely choose all positive options.

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574E - Shifty Shuffling

We are given a fixed 52-card deck where each position contains a number from 1 to 13, with each value appearing exactly four times. Among these, the cards with value 1 are the aces and are the only cards that matter for winning.

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574D - XP Challenge

We are given a sequence of enemies lined up along Iggy’s escape path. Each enemy has some amount of health, and Iggy starts with a fixed amount of health as well.

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574C - Iridescent Iguanas

We are given a collection of iguanas, each described by two numbers: the number of scales and the number of camouflage colors. We must rank these iguanas from best to worst and output the top three IDs. The ordering rule is not a simple comparison of two values.

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574A - Iguana Playground

We are given two identical rectangular sheets, each of size $M times N$. We are allowed to cut each sheet into smaller axis-aligned rectangles using straight cuts parallel to the sides.

Practice › Codeforces Solutions › UTPC Contest 09-08-23 Div. 2 (Beginner) ›

CF 104574B - Preferred Valley

We are given a sequence of terrain heights that forms a very rigid shape: it starts high, goes down, comes up, goes down again, and finally rises again.