UTPC Contest 1-28-2026

9 problems from UTPC Contest 1-28-2026 (contest 106339), difficulty -. 9/9 solutions verified against sample I/O.

9 items

UTPC Contest 1-28-2026

Special | 9 problems | 9/9 verified | Difficulty - | 7m 27s

# Problem Rating Tags Accepted Time ✓
A Cups of Cocoa 52s ✓
B Supply Chain 56s ✓
C Frosted Highway 49s ✓
D Snowball 47s ✓
E Snowfake 44s ✓
F Frosted Highway (Hard) 51s ✓
G Ski Obstacle Course 44s ✓
H Do You Want to Build a Snowman? 52s ✓
I Snow Clearing 52s ✓
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339G - Ski Obstacle Course

The problem describes a skier moving down a slope that is divided into discrete lanes. Time progresses in steps, and at each step the skier’s possible positions form a set of lanes. Initially the skier starts in a single lane at the top.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339E - Snowfake

We are given a set of points on a triangular lattice defined by two basis vectors, typically denoted $e1$ and $e2$. Every point in the input is expressed as an integer combination $u cdot e1 + v cdot e2$.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339B - Supply Chain

We are given a linear production pipeline where a sequence of workers processes snowballs one after another. Each worker takes a fixed amount of time to handle one snowball, and every snowball must pass through all workers in order before it is finished.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339A - Cups of Cocoa

We are given a collection of cocoa cups, each associated with a heat value. There is also a cooling process that decreases temperatures uniformly over time at a fixed rate.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339H - Do You Want to Build a Snowman?

We are given a sequence of non-negative integers representing available snow amounts along a line. The task is to choose three contiguous or non-overlapping portions of this sequence and assign them to three snowballs, whose sizes are denoted s1, s2, and s3 after sorting so…
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339D - Snowball

We are given a sequence of skeleton spawn times along with a final time horizon $k$. A single action can be performed exactly once: at some chosen time $t$, a snowball is thrown that instantly destroys all skeletons that have already appeared.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339I - Snow Clearing

We are given a line of road split into segments, each segment having an initial snow height. The process repeatedly modifies these heights.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339F - Frosted Highway (Hard)

We are given an array indexed from 1 to n, where each position i contains a value h[i]. Alongside this array, there are multiple queries.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 1-28-2026 ›

CF 106339C - Frosted Highway

We are given a highway represented as a sequence of markers. Each marker has a fixed height value and an index in the array.
codeforces competitive-programming Jun 19, 2026