UTPC Contest 03-03-23 Div. 1 (Advanced)

8 problems from UTPC Contest 03-03-23 Div. 1 (Advanced) (contest 104218), difficulty -. 7/8 solutions verified against sample I/O.

8 items

UTPC Contest 03-03-23 Div. 1 (Advanced)

Div. 1 | 8 problems | 7/8 verified | Difficulty - | 13m 20s

# Problem Rating Tags Accepted Time ✓
C Sled Circle 1m 3s ✓
D Outfit Ordeal 1m 6s ✓
E Snowy Hill 1m 16s ✓
F The Austin Longhorn Race 1m 8s ✓
G Journey to Nome 1m 7s ✓
H Sled Ordering 5m 20s
I Balto's Training 1m 10s ✓
J March March 1m 10s ✓
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218H - Sled Ordering

Codeforces 104218H: Sled Ordering
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218F - The Austin Longhorn Race

We are given a set of events, each located at a point on a 2D plane and occurring at a specific time. Each event also has a value.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218C - Sled Circle

We have n dogs placed on n equally spaced points arranged in a circle. Dog i starts at position i at time 0, and each dog moves forward clockwise with a fixed step size vi every unit of time. Because movement is modular around the circle, positions are always taken modulo n.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218J - March March

We are given a directed graph on $n le 20$ labeled cities, where some one-way roads already exist. The intended goal is to ensure that there is a valid “March March route” that visits cities in order from 1 through $n$, meaning that for every consecutive pair $i to i+1$, we…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218I - Balto's Training

We are given a directed structure over $N$ villages. From every village there are exactly two outgoing roads: one labeled left and one labeled right, each pointing to some (possibly the same or different) village.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218G - Journey to Nome

We are given a fixed number $M$, and we are interested only in positive integers that share no prime factor with $M$. In other words, we filter the natural numbers and keep only those that are coprime to $M$, then index this filtered sequence starting from 1.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218E - Snowy Hill

We are given an array representing snow heights along a straight hill. The values are non-negative and the sequence is monotonic non-decreasing from left to right. Each query asks for a contiguous segment whose elements sum exactly to a given value $K$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › UTPC Contest 03-03-23 Div. 1 (Advanced) ›

CF 104218D - Outfit Ordeal

We are simulating a stack-like wardrobe where clothing items are inserted, removed from the top, and occasionally removed from the middle by name. Each operation modifies or queries this pile. There are three operations.
codeforces competitive-programming Jul 1, 2026