Soy Cup #2: Vivian

13 problems from Soy Cup #2: Vivian (contest 105928), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Soy Cup #2: Vivian

Special | 13 problems | 13/13 verified | Difficulty - | 13m 44s

# Problem Rating Tags Accepted Time ✓
A Balanced Eating 56s ✓
B Adventure for Black 53s ✓
C Knight 1m 20s ✓
D Phaethon's Melody 54s ✓
E LCM Queries 57s ✓
F Where the West Wind Ends 1m 15s ✓
G Navigation Compass 52s ✓
H An AtCoder-style Problem 1m 15s ✓
I FST: First Search Traversal 59s ✓
J k-MEX 1m 3s ✓
K Pleasure of Hope 1m 3s ✓
L AL-1S 1m 8s ✓
M Bridge IV 1m 9s ✓
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928J - k-MEX

We are given a rooted tree with a value written on every vertex. The root is fixed at vertex r. Alongside this tree, we are allowed to repeatedly perform a structural modification that targets a vertex v (different from the root).
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928M - Bridge IV

Two players are dealt full information about a bridge-like game. For every suit, each player already knows exactly how many tricks they would win if they became the declarer and chose that suit.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928C - Knight

We are given a large rectangular chessboard and a single starting square. A piece called a knight can move in a generalized way: from any square it can jump either k steps in one axis and 1 step in the other, or the reverse, with all sign variations as long as the destination…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928I - FST: First Search Traversal

We are given two sequences of length $n$, each of which is a permutation of the numbers from $1$ to $n$. We are asked whether it is possible to construct a rooted tree on these $n$ labeled nodes such that one of the permutations can be obtained as a valid depth-first search…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928E - LCM Queries

We are maintaining a dynamic array where elements can change over time, and we must answer range queries about a multiplicative structure derived from those elements. Each query either updates a single position or asks about a segment of the array.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928K - Pleasure of Hope

We are asked to construct an array of length $n$ consisting of distinct positive integers. The array is not arbitrary: every pair of adjacent elements must be coprime, meaning their gcd is exactly 1.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928H - An AtCoder-style Problem

We are given a sequence of integers and we repeatedly look at its prefixes. For each prefix of length i, we must decide whether we can construct a permutation of positions and a permutation of values so that the prefix values appear as “window maxima” of a carefully chosen…
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928G - Navigation Compass

We are given a cyclic structure with $n$ rotating rings, each ring associated with a step size $ai$ and an initial position $bi$ on a regular $m$-gon.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928B - Adventure for Black

We are maintaining a dynamic array that starts with an initial sequence and then grows over time by appending elements. Over this evolving array, we are asked to process two kinds of operations that are intentionally obfuscated so that each query depends on the previous answer.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928D - Phaethon's Melody

We are given a set of weapon choices and a separate set of support sets. Each weapon has a base attack value and a bonus that contributes either to critical rate or critical damage depending on its type.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928L - AL-1S

We are given a string that contains lowercase letters, uppercase letters, digits, and wildcard characters. Each wildcard can be replaced independently by any lowercase letter, uppercase letter, or digit.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928F - Where the West Wind Ends

We are given an array of length $n$, where every element is one of the values $1, 2, 3$. We are guaranteed that all three values appear at least once somewhere in the array. The array itself is hidden.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › Soy Cup #2: Vivian ›

CF 105928A - Balanced Eating

We are given several test cases. In each test case there are multiple skewers, and each skewer has a certain number of meat pieces.
codeforces competitive-programming Jun 21, 2026