UTPC Contest 03-01-24 Div. 1 (Advanced)

7 problems from UTPC Contest 03-01-24 Div. 1 (Advanced) (contest 105006), difficulty -. 2/7 solutions verified against sample I/O.

7 items

UTPC Contest 03-01-24 Div. 1 (Advanced)

Div. 1 | 7 problems | 2/7 verified | Difficulty - | 8m 50s

#	Problem	Time	✓
C	The Corgi Genes	1m 8s	✓
D	Dog	1m 24s
E	Colorful Corgis	1m 29s
F	Walk in the Park	36s	✓
G	The Great Escape	1m 34s
H	Favorite Treat	1m 38s
I	Corgi Counting	1m 1s

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006H - Favorite Treat

We are given a tree with up to 20 nodes, where each node represents a treat with a fixed tastiness value. Two players repeatedly remove nodes until nothing remains. In each move, Bob first selects any two nodes that are currently leaves in the remaining tree.

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006G - The Great Escape

We are working inside a rectangular park that can be treated as a continuous 2D plane from the bottom-left corner $(0,0)$ to the top-right corner $(N,M)$. A corgi starts at $(0,0)$ and wants to reach $(N,M)$.

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006I - Corgi Counting

We are given a collection of corgis, each assigned a 22-bit integer personality value. If we pick any subset of these corgis, every pair inside that subset contributes a “happiness” equal to the bitwise AND of their personalities.

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006F - Walk in the Park

Each dog-walking job can be seen as an item that Alice may choose at most once. A job comes with two pieces of information: a 7-day requirement pattern and a payment value. The pattern is a length-7 binary vector indicating on which days of the week the dog must be walked.

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006E - Colorful Corgis

We are given a circular arrangement of $N$ corgis. Each corgi carries a very small “color set”, either one color or two colors, both represented by lowercase letters. The circle means that the first and last corgi are also adjacent.

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006D - Dog

We are given a rooted tree with node 1 acting as the root of a “proof structure”. Each node represents a subgoal, and leaves are the only things that can be removed during a verification step.

Practice › Codeforces Solutions › UTPC Contest 03-01-24 Div. 1 (Advanced) ›

CF 105006C - The Corgi Genes

We are given a single string representing a long sequence of genetic markers, where each character is one of 26 possible letters. Our task is to count how many substrings are “valid palindromic gene segments” under an additional biological constraint.