2025 USP Try-outs

13 problems from 2025 USP Try-outs (contest 106039), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2025 USP Try-outs

Special | 13 problems | 13/13 verified | Difficulty - | 10m 51s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Yuyuan Market				47s	✓
B	The Search for Balance				1m	✓
C	Echoes of the Jade Library				58s	✓
D	The Seals of Shanghai				47s	✓
E	Complexity of Quicksort				45s	✓
F	Chinese Innovation				50s	✓
G	Incompatible Pairs				45s	✓
H	The Wisdom of Master Wei				39s	✓
I	Bath				50s	✓
J	The Messenger's Disguise				1m 13s	✓
K	Cake Hater				43s	✓
L	Game of Life				43s	✓
M	Nomad				51s	✓

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039C - Echoes of the Jade Library

We are given a sequence of N strings, each string representing a “scroll” written with lowercase letters. From each scroll, we care about all substrings that are palindromes, and we treat two substrings as the same if their character sequences are identical, regardless of…

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039A - Yuyuan Market

We are given a sequence of length $2N$, where each value from $1$ to $N$ appears exactly twice. You can think of it as pairs of identical symbols placed along a line. The task is to choose pairs of equal symbols under a strict movement rule.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039M - Nomad

We are given a fixed number of nights, D, and a collection of N possible places where a person can sleep. Each place i comes with a constraint di that limits how many consecutive nights can be spent in that place.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039L - Game of Life

We are given a very small grid, at most 8 by 8, where each cell can be in one of three states. A cell can be alive, dead, or blocked. Blocked cells never change and also never participate as active contributors in the dynamics. The system evolves in discrete steps.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039K - Cake Hater

We are given a set of ingredients and a list of ingredients that Antonio refuses to use. The recipe is split into several stages, and each stage specifies a subset of ingredients required for that step. When Antonio prepares a stage, he simply omits every ingredient he dislikes.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039I - Bath

We are given a simple polygon representing a room, with the first vertex acting as a door. Inside this polygon lies a single point representing a towel. A person starts at the door vertex, walks entirely within the polygon, reaches the towel, and must return to the same door.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039H - The Wisdom of Master Wei

We are given two starting years, one for Master Wei and one for Kai. From those years onward, each person accumulates “experience” equal to the number of years that have passed since they started programming.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039G - Incompatible Pairs

We are given a sequence consisting only of two types of symbols, an opening bracket ( representing a Yang dancer and a closing bracket ) representing a Yin dancer. Each ( must be matched with a later ) to form a valid pairing, and every dancer participates in exactly one pair.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039E - Complexity of Quicksort

We are given a sequence of distinct integers and a specific version of quicksort that behaves in a very particular way. The pivot is always chosen as the middle index of the current segment, not by value but by position.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039D - The Seals of Shanghai

We are given a sequence of integers, and we are allowed to choose a modulus value $M$ with $1 < M le 10^9$. Once $M$ is fixed, each “move” consists of picking a remainder value $x$, and in that move we remove all numbers whose value modulo $M$ equals $x$.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039J - The Messenger's Disguise

We are given an undirected graph representing cities connected by roads, where each road has the same travel cost. A traveler starts at a source city S and wants to reach a destination city T.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039F - Chinese Innovation

We are given a weighted undirected graph of cities connected by normal roads, where every road can be used in both directions and has a fixed travel cost. In addition to roads, cities may contain special teleportation devices of different types.

Practice › Codeforces Solutions › 2025 USP Try-outs ›

CF 106039B - The Search for Balance

We are given up to 35 power-ups, each of which contributes a fixed change to two attributes: attack and defense. Starting from zero in both dimensions, we choose any subset of these power-ups, apply all chosen ones (order does not matter because addition is commutative), and…