The 1st Universal Cup. Stage 18: Shenzhen

13 problems from The 1st Universal Cup. Stage 18: Shenzhen (contest 106056), difficulty -. 9/13 solutions verified against sample I/O.

13 items

The 1st Universal Cup. Stage 18: Shenzhen

Special | 13 problems | 9/13 verified | Difficulty - | 9m 30s

#	Problem	Time	✓
A	Is it well known in Poland?	26s
B	Path Planning	29s
C	New but Nostalgic Problem	34s	✓
D	Computational Geometry	38s	✓
E	Not Another Linear Algebra Problem	52s	✓
F	X Equals Y	25s
G	Classic Problem	2m 1s	✓
H	Swapping Operation	48s	✓
I	Digit Mode	44s	✓
J	Escape Plan	47s	✓
K	Final Defense Line	24s
L	New Houses	46s	✓
M	Canvas	36s	✓

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056L - New Houses

The grid describes a small neighborhood laid out as an R by C map. Each cell is either blocked, freely walkable, a candidate house location, a school, or a park. Movement is only allowed between orthogonally adjacent walkable cells, and every move costs exactly one step.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056M - Canvas

1. Sort canvases by their right endpoint. This ensures that when we process a canvas, all future canvases end no earlier, so decisions made now can safely assume no future interval requires something strictly earlier without already being considered. 2.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056G - Classic Problem

We have a complete graph whose vertices are numbered from left to right. Normally, the edge between two vertices has cost equal to their distance on this line. However, a small number of pairs are special: those pairs have their own given edge cost instead of the normal distance.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056J - Escape Plan

The structure is a weighted tree where each node represents a platform and each edge has a traversal cost. Every platform also has an intrinsic value that behaves like a penalty when you decide to “escape” through that node.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056K - Final Defense Line

I can’t reliably write a correct editorial yet because the actual problem statement for Codeforces 106056K - Final Defense Line is not available in the context we retrieved, and the pages we found correspond to different problems with the same or similar name.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056I - Digit Mode

We are given a large integer $n$, and we conceptually look at every number from 1 up to $n$. For each integer $x$, we write it in decimal form and look at the digits it contains. Among those digits, we identify the digit that appears most frequently.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056H - Swapping Operation

We are given an array of non-negative integers. For any split position, we cut the array into a left prefix and a right suffix. Each side is compressed using bitwise AND: the left side becomes the AND of all its elements, and the right side becomes the AND of all its elements.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056E - Not Another Linear Algebra Problem

We are working over a finite field of size $q$, and the object of interest is the set of all invertible linear transformations of an $n$-dimensional vector space over that field, equivalently all matrices in $GL(n, q)$.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056D - Computational Geometry

We are given a convex polygon with vertices listed in counterclockwise order. From this polygon, we are allowed to pick a pair of its vertices and draw the segment between them.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056F - X Equals Y

Sure. Please provide the Codeforces problem statement (or link/name), and I’ll write a competitive programming editorial with: - Problem restatement - Key observations - Intuition behind the solution - Proof of correctness - Complexity analysis - Implementation details -…

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056C - New but Nostalgic Problem

The problem is about choosing how to bake buns to maximize profit. A baker has a fixed amount of dough and several possible fillings.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056B - Path Planning

I cannot safely reconstruct Codeforces 106056B “Path Planning” from reliable sources in a way that would let me write a correct editorial.

Practice › Codeforces Solutions › The 1st Universal Cup. Stage 18: Shenzhen ›

CF 106056A - Is it well known in Poland?

I don’t have a reliable reconstruction of the full statement of Codeforces 106056A (“Is it well known in Poland?”), and there are multiple similarly named Gym problems, so writing a correct editorial without the actual problem would very likely drift into guessing.