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

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

7 items

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

Div. 1 | 7 problems | 2/7 verified | Difficulty - | 9m 53s

#	Problem	Time	✓
C	Hatter's Party	1m 11s	✓
D	Noodling with Knights	1m 27s	✓
E	Riddle Me This (Easy Version)	1m 15s
F	Noodles and Random Walk	1m 37s
G	Spaghetti Game	1m 14s
H	Alice Learns Eertree!	1m 32s
I	Riddle Me This (Hard Version)	1m 37s

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

CF 104665I - Riddle Me This (Hard Version)

Each input item is a permutation of a finite length, and you are allowed to cyclically rotate it. A rotation means taking the last element and moving it to the front, repeated any number of times.

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

CF 104665H - Alice Learns Eertree!

We are given a tree with $N$ nodes, and each node carries a single uppercase letter. The structure of the tree is fixed, but we are allowed to choose any node $u$ as a root. Once rooted, every node defines a rooted subtree consisting of itself and all nodes below it.

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

CF 104665F - Noodles and Random Walk

We are given a process that starts at position 0 and evolves for $T$ steps. At every second, we either increase the position by 1 or decrease it by 1. The sequence of positions over time forms a walk on the integers, starting at 0.

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

CF 104665G - Spaghetti Game

Two players are playing a turn-based game that changes a single integer, the current number of spaghetti strands in a shared pile. The game always starts from zero. Lario moves first, then Muigi, and they alternate for up to 100 moves each.

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

CF 104665D - Noodling with Knights

We are given a square chess board of size $N times N$. Each cell is identified by integer coordinates, and a single knight piece starts on one cell while a target cell is fixed elsewhere on the board.

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

CF 104665E - Riddle Me This (Easy Version)

We are given an even number of permutations, all of the same length. Each permutation represents a cyclic object: we are allowed to rotate it any number of times, meaning we can choose any cyclic shift of its elements.

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

CF 104665C - Hatter's Party

We are given a collection of noodle strands, each carrying a numeric flavor value. We need to divide these strands into several dishes. Every dish must contain at least $K$ strands, and the value of a dish is defined as the maximum flavor among the strands placed into it.