CerealCodes II Advanced

10 problems from CerealCodes II Advanced (contest 104523), difficulty -. 2/10 solutions verified against sample I/O.

10 items

CerealCodes II Advanced

Special | 10 problems | 2/10 verified | Difficulty - | 23m 25s

#	Problem	Time	✓
A	Cascading Sums	1m 37s
B	Panda-monium	2m 15s
C	Aquamist	3m 6s
D	Removing Subarrays	1m 56s
E	Mark and Add	2m 6s	✓
F	Vacation II	3m 18s
G	Cereal Bushes	2m 51s
H	Date	1m 51s	✓
I	Magical Zoo	2m 45s
J	Purchasing Cereal	1m 40s

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523I - Magical Zoo

We are given a tree with up to three hundred thousand nodes. The first part of the nodes are special locations called exhibits, and the remaining nodes are feeding stations, each carrying a fixed food color. Red pandas travel along shortest paths between pairs of nodes.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523J - Purchasing Cereal

We are given a directed graph that forms a rooted structure starting from city 1, since every city is reachable from city 1. Each city has a fixed cereal price, and Larry may buy cereal only at cities he visits.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523G - Cereal Bushes

We are asked to design a grid of size at most $64 times 64$, then place obstacles in some cells so that the number of valid monotone paths from the top-left corner to the bottom-right corner equals a given integer $k$, possibly up to $10^{18}$.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523F - Vacation II

Your current output already shows something important: the move count is correct, but the structure of moves is wrong in a systematic way, not random. Compare expected vs actual: Expected begins with: Actual begins with: So two concrete bugs are visible: 1.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523H - Date

The amusement park is a tree where each node represents a ride. Visiting a ride for the first time grants a fixed enjoyment value, but only if the ride is operational on the current day. Each ride has a periodic schedule: it is open only on days that are multiples of its period.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523E - Mark and Add

We are given an array of length $n$, initially all zeros, together with a dynamic set of special positions called marked indices. The set changes over time through toggle operations. At any moment, a position is either in this marked set or not. There are two kinds of operations.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523D - Removing Subarrays

We are given an array and a rule that allows us to erase any contiguous segment as long as two conditions hold. The segment must have length at least two, and the values inside it must be “tight” in the sense that the difference between its maximum and minimum is at most $k$.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523C - Aquamist

We are given several stacks of blocks. Each stack has a capacity limit, and blocks can only be moved one at a time from the top of one stack to the top of another.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523B - Panda-monium

We are given a tree rooted at node 1, and each node initially contains exactly one panda. Over time, we “release” pandas from their home nodes. Once released, a panda moves upward toward the root, advancing exactly one edge per second.

Practice › Codeforces Solutions › CerealCodes II Advanced ›

CF 104523A - Cascading Sums

We are working with a transformation on positive integers. Given a number $x$, we write it in base 10 and repeatedly take prefixes from the left: the full number, then everything except the last digit, then everything except the last two digits, and so on until a single digit…