Whalica Cup (Round 2)

9 problems from Whalica Cup (Round 2) (contest 106367), difficulty -. 9/9 solutions verified against sample I/O.

9 items

Whalica Cup (Round 2)

Special | 9 problems | 9/9 verified | Difficulty - | 10m 7s

# Problem Rating Tags Accepted Time ✓
A The World Is Full of Colors 44s ✓
B Whalica's Permutation Construction 50s ✓
C Shichieichou's Guidance 2m 25s ✓
D Whalica's Lottery Game 56s ✓
E Eight-thousand-year Wait 1m 5s ✓
F Magicology 1m 12s ✓
G True Blue 47s ✓
H Whalica's Mysterious Set 1m 8s ✓
I Fireflies Lead the Way 1m ✓
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367E - Eight-thousand-year Wait

We are given an array and we consider every subsequence formed by deleting any subset of elements while keeping order. For each resulting sequence, we count how many times two adjacent elements are equal. This count is called the number of flashes.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367H - Whalica's Mysterious Set

We maintain a dynamic subset of integers from the fixed universe $[1, n]$. The set supports insertion and deletion with idempotent behavior, meaning repeated inserts or deletes on the same element do not change anything after the first effect.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367D - Whalica's Lottery Game

We are given a collection of fan strings over a tiny alphabet and a sequence of events that either mutate all strings simultaneously or evaluate a “draw” against a given winning string.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367I - Fireflies Lead the Way

We are given a line of $n$ lamps placed along a river at increasing coordinates $x1 < x2 < dots < xn$. A traveler starts at lamp 1 and wants to reach lamp $n$. At each lamp $i$, there are two ways to move forward.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367C - Shichieichou's Guidance

We are given a rooted tree whose root is node 1. Every leaf lies at the same depth, so the tree is perfectly balanced with respect to leaf depth, although the branching structure can be arbitrary. Each butterfly is attached to a node and disappears at a specified time.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367G - True Blue

We are given an array of non-negative values, where each position represents how much “blue resource” a block currently holds. Over time, we receive operations of the form asking about a segment of this array and a threshold value.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367B - Whalica's Permutation Construction

We are asked to construct a permutation of numbers from 1 to n such that a specific divisibility condition holds at every prefix. For a permutation p, define a running prefix sum Si as the sum of the first i elements.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367F - Magicology

We are given a rooted tree where each vertex stores an initial value. A transformation is applied to this tree-valued array: every vertex replaces its value with the sum of values in its subtree.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › Whalica Cup (Round 2) ›

CF 106367A - The World Is Full of Colors

We are given a sequence of RGB colors written in the standard hexadecimal web format, where each color starts with followed by six lowercase hexadecimal characters.
codeforces competitive-programming Jun 19, 2026