UTPC Contest 09-08-23 Div. 1

8 problems from UTPC Contest 09-08-23 Div. 1 (contest 104573), difficulty -. 6/8 solutions verified against sample I/O.

8 items

UTPC Contest 09-08-23 Div. 1

Div. 1 | 8 problems | 6/8 verified | Difficulty - | 10m 15s

#	Problem	Time	✓
C	Iridescent Iguanas	1m 9s	✓
D	XP Challenge	1m 34s	✓
E	Shifty Shuffling	1m 3s	✓
F	Egg	1m 6s	✓
G	Iguana Walking	1m 9s	✓
H	Go Iguanas!	1m 31s	✓
I	Iguana Islands	1m 22s
J	Stacking Trick	1m 21s

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

CF 104573J - Stacking Trick

We are given a line of stacks, each stack holding some number of blocks. We are allowed to move blocks only between neighboring stacks, and we may also remove blocks from the two ends of the line by pushing them off the table.

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

CF 104573I - Iguana Islands

We are given a line of islands. Each island has a fruit type and an initial quantity. On every day, a contiguous segment of islands is exposed to visitors; everything outside that segment is unavailable due to storms.

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

CF 104573H - Go Iguanas!

The crash is not coming from the game logic itself but from a broken test harness / input handling layer combined with unsafe assumptions about input structure. From the traceback: the failure happens during assertion setup, not during the algorithmic computation.

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

CF 104573G - Iguana Walking

We are given a directed graph where each iguana sits on a node from 1 to N, and every node has exactly one outgoing edge defined by the array p. In one time step, every iguana moves simultaneously from i to p[i].

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

CF 104573F - Egg

We are given a collection of eggs, and each egg can be used in one of three ways: it can be fried, it can be scrambled, or it can be ignored completely. Each choice yields a different satisfaction value for that egg, and the values are independent across eggs.

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

CF 104573D - XP Challenge

We are given a sequence of enemies, each with some health, and a creature with an initial amount of health points. The goal is to decide whether she can defeat every enemy in order while ensuring her own health never drops to zero or below. There are two attack options.

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

CF 104573C - Iridescent Iguanas

We are given a collection of iguanas, each identified by an ID from 1 to N. Every iguana has two attributes: a number of scales and a number of colors. The goal is to rank these iguanas from best to worst using a pairwise comparison rule, then output the top three.

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

CF 104573E - Shifty Shuffling

We are given a deck of 52 cards. Each card is represented by an integer from 1 to 13, where each value appears exactly four times.