CerealCodes III Advanced Division

10 problems from CerealCodes III Advanced Division (contest 105310), difficulty -. 0/10 solutions verified against sample I/O.

10 items

CerealCodes III Advanced Division

Special | 10 problems | 0/10 verified | Difficulty - | 17m 9s

#	Problem	Time
A	Cereal Grids III (Easy Version)	1m 54s
B	Red Pandaships	1m 26s
C	Red Pandacakes	1m 25s
D	Range Flips	1m 34s
E	math problem	1m 30s
F	Red Pandatrees	1m 34s
G	Cereal City	2m 38s
H	Cereal Trees IV	2m 8s
I	Vines	1m 34s
J	Cereal Grids III (Hard Version)	1m 26s

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310J - Cereal Grids III (Hard Version)

We are given a square grid of size $n times n$ and a multiset of exactly $k$ ones and $n^2 - k$ zeros. The task is to place all values into the grid. Once the grid is built, we read every row as a binary string and every column as a binary string.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310G - Cereal City

We are given a set of points inside an $n times n$ grid, and we need to connect all of them using a very unusual construction process that produces axis-aligned roads. Every road starts from the outer boundary of the grid and is drawn straight inward along a grid line.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310I - Vines

We are maintaining a vertical structure of layers indexed from 0 at the top down to n at the bottom. Some layers may contain a “vine”, and each vine has a current integer length.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310F - Red Pandatrees

We are given an undirected tree and a target permutation of its nodes. The goal is to transform the tree, through a special repeated “shuffle” operation, into a final rooted tree that is a simple path and whose depth-first traversal from the root visits nodes exactly in…

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310E - math problem

We are given an array $a$ of length $n$, but it is not independent. There is another hidden array $b$ of the same length, and every value of $a$ is defined as a sum over certain multiples in $b$.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310A - Cereal Grids III (Easy Version)

We are asked to construct an $n times n$ binary grid containing exactly $k$ ones and the remaining cells zeros. The grid is judged by a quantity called Super Rank, which counts how many distinct row strings and column strings appear in the final matrix when you read rows left…

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310D - Range Flips

We are given two strings of equal length, and we want to transform the first string into the second using range operations.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310B - Red Pandaships

We are given a circle of n red pandas, numbered in clockwise order. Some pairs of pandas are already connected by non-crossing chords.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310H - Cereal Trees IV

We are given a rooted tree where node 1 is the root and every node carries a value that can be positive or negative. The tree does not change structurally, but the values at nodes change over time through updates.

Practice › Codeforces Solutions › CerealCodes III Advanced Division ›

CF 105310C - Red Pandacakes

We are given a circular arrangement of stores, each store containing some number of pancakes. Two players, Lura and Oscar, will each end up visiting a contiguous segment of stores along the circle, but their segments are constrained by a key rule: neither of them is allowed to…