UTPC Contest 03-03-23 Div. 2 (Beginner)

8 problems from UTPC Contest 03-03-23 Div. 2 (Beginner) (contest 104217), difficulty -. 4/8 solutions verified against sample I/O.

8 items

UTPC Contest 03-03-23 Div. 2 (Beginner)

Div. 2 | 8 problems | 4/8 verified | Difficulty - | 8m 25s

#	Problem	Time	✓
A	Swapped Signs	1m 2s	✓
B	Max Difference	1m 1s	✓
C	Sled Circle	1m 11s	✓
D	Outfit Ordeal	33s
E	Snowy Hill	1m 22s
F	The Austin Longhorn Race	1m 39s
G	Journey to Nome	30s
H	Sled Ordering	1m 7s	✓

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

CF 104217H - Sled Ordering

We are building ordered sequences of length $N$, where each position is filled with one of two indistinguishable types: spotted or brown. Because cows of the same type are identical, a valid configuration is fully described by a binary string of length $N$.

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

CF 104217F - The Austin Longhorn Race

We are given a set of checkpoints scattered in a 2D plane. Each checkpoint appears only at a specific time, and if we happen to be exactly at its coordinates at that exact time, we can collect some amount of reward.

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

CF 104217G - Journey to Nome

Let the given BDD for $f(x1,dots,xn)$ be a rooted directed acyclic graph whose branch nodes are labeled by variables $V(u)in{1,dots,n}$ and whose sink nodes are $bot,top$, with orderedness ensuring that along every directed path the labels strictly increase.

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

CF 104217E - Snowy Hill

We are given an array representing snow heights along a straight hill. The array is monotonic non-decreasing, meaning as we move from index 0 to index N−1, values never decrease.

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

CF 104217D - Outfit Ordeal

Connection interrupted. Waiting for the complete answer

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

CF 104217C - Sled Circle

We are dealing with a circular track of n evenly spaced positions, labeled from 0 to n-1. Each dog starts at a unique position i, and every dog moves clockwise at a constant speed vi, meaning that after t time steps, dog i will be located at position (i + t · vi) mod n.

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

CF 104217A - Swapped Signs

We are given two uppercase strings, one representing the current word displayed on a board and another representing the word we want to replace it with.

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

CF 104217B - Max Difference

We are given a single integer $n$, and we are asked to look at all permutations of the sequence $(1, 2, 3, dots, n)$. Each permutation is interpreted as a number formed by concatenating its elements in order.