UTPC Spring 2024 Open Contest

12 problems from UTPC Spring 2024 Open Contest (contest 105109), difficulty -. 1/12 solutions verified against sample I/O.

12 items

UTPC Spring 2024 Open Contest

Special | 12 problems | 1/12 verified | Difficulty - | 18m 19s

#	Problem	Time	✓
A	Skipping Songs	1m 36s
B	6th heaven	1m 31s
C	A Noteworthy Debut	2m 1s
D	Counting Records	1m 24s
E	Is It Vinyl?	1m 19s
F	Lost in the Album Store	1m 55s
G	Making Records	1m 32s
H	Prefix Tower	1m 44s
I	Record Compression	1m 21s	✓
J	Record The Record Record	1m 5s
K	Sample Heat	1m 24s
L	Two Pizzas	1m 27s

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109L - Two Pizzas

We are given two circular arrays representing pizzas, each of length $n$. Each position may contain a single topping value or be empty. The key rule is that a topping only contributes to the final score if, after combining the two pizzas, it is the only topping at its position.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109K - Sample Heat

We are given a string made of lowercase letters, which we can think of as a row of musical samples laid out on a disk. Any contiguous segment of this string is a candidate “clip”.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109J - Record The Record Record

Bob has a collection of numbered records from 1 to n. Over the next n days, he listens to some subset of these records each day. A record is considered new on a given day if Bob has never listened to it on any earlier day.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109I - Record Compression

We are given a collection of songs, where each song has two properties: a storage cost measured in bytes, derived from the length of its title, and a reward value. Amber has a digital vinyl with a fixed capacity in bytes.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109H - Prefix Tower

We are given an array of numbers and a transformation that repeatedly replaces the array with its prefix product version. One application of the transformation takes an array and turns each position into the product of everything up to that index.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109G - Making Records

We are given a directed structure over $n$ labeled positions, where each position $i$ points to exactly one next position $bi$. This defines a functional graph: every node has outdegree 1, so the graph decomposes into directed cycles with trees feeding into those cycles.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109F - Lost in the Album Store

The grid represents a store where each cell has a non-negative value. George starts in the bottom-right corner and wants to reach the top-left corner. He can only move one step at a time either upward or leftward, so every valid route is a monotone path on the grid.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109E - Is It Vinyl?

We are given ten points in the plane, each supposed to lie on the boundary of a hidden object. The object is guaranteed to be exactly one of two types: either a vinyl record, whose boundary is a circle, or a cassette tape, whose boundary is an axis-aligned rectangle.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109D - Counting Records

We are given the first few values of a sequence $f(1), f(2), dots, f(n)$, and the sequence is defined recursively in a way that depends multiplicatively on all previous values.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109C - A Noteworthy Debut

We are given an array of song “excitement” values. We need to count how many contiguous segments of this array can be selected such that inside the segment there exists at least one element that is unusually large compared to the rest of the segment.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109A - Skipping Songs

We are given an album represented as a fixed sequence of songs in a circular disc player. The disc starts at the first song and always moves forward in order, wrapping back to the beginning after the last song. Noah does not simply listen sequentially.

Practice › Codeforces Solutions › UTPC Spring 2024 Open Contest ›

CF 105109B - 6th heaven

We are given a set of $n$ distinct disks labeled from $1$ to $n$. The goal is to place all of them on a single line, forming a permutation of these labels.