2023 USP Try-outs

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

13 items

2023 USP Try-outs

Special | 13 problems | 5/13 verified | Difficulty - | 25m 35s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Metaverse Real Estate				1m 37s
B	Maracas				2m 12s
C	Quasi-Palindrome				3m 33s
D	Supermarket queue				2m 18s
E	Long Live Mexico				1m 6s	✓
F	Goalkeeper of 7 games (or less)				1m 45s
G	Choice hero				59s	✓
H	The infinite festival				1m 35s
I	Help the Aztecs				1m 54s
J	Indiana Jiang and the Temple of Kukulkan				1m 30s	✓
K	Missing Cyan				3m 41s	✓
L	Tourist circuits				1m 47s	✓
M	Chavo's Barrel				1m 38s

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505K - Missing Cyan

Let’s walk the sample structurally: Key point: sadness is about observing cross-queue activity while waiting, not about “any event existing”. The previous solution effectively computed: where timeline counts all events globally.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505M - Chavo's Barrel

We are given two fixed streetlights on a plane. Each streetlight defines a circular illuminated region. The key geometric detail is that the origin lies exactly on the boundary of both circles, so the radius of each circle is simply the distance from its center to the origin.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505I - Help the Aztecs

We are maintaining a changing undirected graph whose vertices represent fields and whose edges represent roads between them. Over time, some fields get destroyed, and whenever that happens, all roads incident to that field disappear as well.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505H - The infinite festival

The festival can be viewed as a circular timeline of $N$ days that repeats forever, and a progression system with $M$ levels.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505D - Supermarket queue

We are simulating a supermarket with several checkout queues. Customers arrive, choose a queue, and then stay in that queue until they are processed in order.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505F - Goalkeeper of 7 games (or less)

We are maintaining a dynamic array of glove sizes arranged in a line. At any moment, two things can happen. Either a single position changes its value, or we are given a query that focuses on a fixed subsegment of the array, and we must decide whether we can pick four distinct…

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505B - Maracas

We are given a circle of positions, each holding some number of maracas. The only thing that matters about each position is whether its count is even or odd, because only even counts are acceptable in the final configuration.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505L - Tourist circuits

We are given an undirected, connected graph with $N$ vertices and $M$ edges. Each vertex represents a tourist attraction, and edges represent streets that can be traveled in both directions.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505J - Indiana Jiang and the Temple of Kukulkan

We are given a system of $m$ symbols, each initially in one of two states, and a set of $n$ switches (levers). Each lever is connected to exactly two distinct symbols. Pulling a lever flips the state of both connected symbols: a 0 becomes 1 and a 1 becomes 0.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505G - Choice hero

We are given a sequence of levels played in a fixed order. At the start, a hero has some initial power, and at each level there are two monsters available.

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505E - Long Live Mexico

We are given a set of drones fixed in three-dimensional space. Each drone i has coordinates (xi, yi, zi) and a weight wi. We are free to choose the position of a special primary drone at any integer coordinate (x, y, z).

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505C - Quasi-Palindrome

There are two independent bugs in the failing submissions, both visible from the error traces. First, the input is being parsed using input() or int(input()), assuming a clean token structure like: But the provided test input is heavily malformed from the program’s…

Practice › Codeforces Solutions › 2023 USP Try-outs ›

CF 104505A - Metaverse Real Estate

We are working in a $k$-dimensional grid space where a large axis-aligned hypercube $A$ spans from the origin to the point $(n, n, dots, n)$. Inside this big hypercube, we consider every possible smaller axis-aligned integer-coordinate hypercube $B$ that fits entirely inside $A$.