KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto)

18 problems from KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) (contest 106461), difficulty -. 18/18 solutions verified against sample I/O.

18 items

KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto)

Special | 18 problems | 18/18 verified | Difficulty - | 16m 25s

#	Problem	Time	✓
A	Kendama Challenge	51s	✓
B	Cat Cut	1m	✓
C	Partition AND/OR Aggregation	58s	✓
D	Campaign Speech	53s	✓
E	Ball Dumping Golf	58s	✓
F	1e16 Cities	48s	✓
G	The Symbolic Tree	50s	✓
H	How to Validate Such a Program	44s	✓
I	Xor Magic Square	48s	✓
J	Sum of max of iai	50s	✓
K	Square Resistance Value	49s	✓
L	Make Many KUPC	46s	✓
M	Linked VERSE	51s	✓
N	Cellular Component Constellation	50s	✓
O	Xor Triangle	53s	✓
P	N-day Long Event	41s	✓
Q	Calendar Square	2m 13s	✓
R	Rock Paper Scissors	42s	✓

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461G - The Symbolic Tree

We are given a rooted tree with $N$ vertices. Each vertex $i$ is assigned an integer, and all integers are constrained to lie in the range $[0, K]$. The assignment is not arbitrary: it must respect a structural counting rule that is defined recursively over subtrees.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461H - How to Validate Such a Program

We are given a tree, but we do not directly work with edges. Instead, we are given access to its distance matrix, where entry $D{i,j}$ stores the length of the unique path between vertices $i$ and $j$.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461D - Campaign Speech

We are given a simple polygon described by its vertices in order along its boundary, so consecutive vertices form edges of the polygon. On this polygon, there are special “speech locations” placed on some of the grid points that lie on the boundary.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461A - Kendama Challenge

We are modeling a sequence of independent trials where each trial is either a success or a failure with known probabilities.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461Q - Calendar Square

The task describes a simplified combinatorial setting involving a calendar-like structure, but the only meaningful variable is the size of a month in days.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461R - Rock Paper Scissors

We are given two integers that describe aggregate information about a group of people playing a simplified Rock-Paper-Scissors setting. Instead of tracking individual interactions, we only care about how many people choose each hand: rock, scissors, and paper.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461O - Xor Triangle

We are counting ordered pairs of integers $(a, b)$ where both numbers lie in the range $1 le a, b < 2^N$. Each number is represented using exactly $N$ bits.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461P - N-day Long Event

The problem describes an event that spans a fixed number of consecutive days, and the task is to compute a value associated with that span.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461N - Cellular Component Constellation

We are working with a square grid of size $N times N$, where each cell must be colored in one of two colors, conceptually black and white. After coloring, we look at connected components formed by 4-directional adjacency among cells of the same color.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461M - Linked VERSE

We are given a sequence of integers that naturally splits into two kinds of blocks: positive values and the value −1.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461L - Make Many KUPC

We are given a string consisting of uppercase letters, and we are interested in extracting weighted structures of the form “U followed later by P followed later by C”, with an additional C appearing even later.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461K - Square Resistance Value

We are asked to construct an electrical network whose effective resistance approximates a given real value $D$, with very high precision.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461J - Sum of max of iai

We are working with a structure where, for each integer threshold $k$, we can count how many permutations of size $N$ satisfy a constraint derived from the values $ai$.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461I - Xor Magic Square

We are asked to construct an $N times N$ grid of positive integers that satisfies a set of XOR constraints on its rows, columns, and both main diagonals.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461E - Ball Dumping Golf

We are looking at a system where each object simultaneously acts like a source and a target of directed connections. Concretely, every ball induces a directed edge from the box it currently sits in to the ball’s own index.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461F - 1e16 Cities

We are asked to construct an undirected graph on positive integers up to a very large limit (up to $10^{16}$). Each valid pair of integers can be connected by an edge if it satisfies a specific arithmetic condition involving their gcd.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461B - Cat Cut

We are given a sequence of strings and a target length $M$. We start building a new string by taking the first string in full, then for every next string we are allowed to append any prefix of it, possibly empty.

Practice › Codeforces Solutions › KUPC 2025 (The 4th Universal Cup. Stage 22: GP of Kyoto) ›

CF 106461C - Partition AND/OR Aggregation

We are given a sequence of integers and asked to split it into a fixed number of contiguous segments. Each segment has a value defined by combining all elements inside it with a bitwise operation score (constructed from AND/OR aggregation, depending on the formulation in the…