Baozii Cup 3

13 problems from Baozii Cup 3 (contest 106328), difficulty -. 13/13 solutions verified against sample I/O.

13 items

Baozii Cup 3

Special | 13 problems | 13/13 verified | Difficulty - | 12m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
A	DeepTreek				1m 20s	✓
B	Odd Cycle				58s	✓
C	Count Cubes				1m 14s	✓
D	Xor And Mul				48s	✓
E	MiniC				37s	✓
F	Random Walk				48s	✓
G	HDZ's Legendary Problem				1m 12s	✓
H	Distinct Substrings				56s	✓
I	Operating System				44s	✓
J	Someone's Favourite Problem				51s	✓
K	One Line				51s	✓
L	Perimeter				59s	✓
M	Classic Revisited				1m 8s	✓

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328E - MiniC

We are given a permutation of numbers from zero to n minus one. For every position i, we want to look strictly to the right and find the first position j where the value becomes smaller than the value at i. If no such position exists, the answer for i is n.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328I - Operating System

We are given two parameters, a value limit m and a window size k. We must construct a sequence a, where each element is between 1 and m, such that a certain process produces different results when the window size is k versus when it is k+1.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328G - HDZ's Legendary Problem

A monster is defined by four base stats: attack, defense, health, and speed. On top of that, it has a fixed number of enhancement points that can be distributed freely, one point increasing exactly one of the four stats by one unit.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328L - Perimeter

We start with an empty grid of size $n times m$, where every cell is initially white. We repeat a random process $k$ times: each time we pick one of the $nm$ cells uniformly at random, and if that cell has never been painted before we color it black, otherwise we do nothing.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328J - Someone's Favourite Problem

We are dealing with a directed graph on n vertices, but the graph is not given explicitly. Instead, we can only probe it by asking whether a directed edge exists between any ordered pair of distinct vertices.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328A - DeepTreek

We are given a rooted tree with root at vertex 1. Each vertex has a parent except the root, and depth is defined in the standard way as the distance from the root. We consider ordered pairs of vertices $(u, v)$ with three restrictions. First, $u neq v$.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328C - Count Cubes

We are given a 3D structure made of unit cubes placed on integer lattice points. Each column at position $(x, y)$ forms a vertical stack starting from $z = 0$, and gravity forces stacks to be solid from the bottom: if a cube exists at height $z$, then all positions below it in…

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328M - Classic Revisited

We are given a sequence of integers and asked to extract a subsequence that reads the same forward and backward, with the additional constraint that its length must be even.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328H - Distinct Substrings

We are given a string over lowercase English letters. For every position in this string, we want to count how many distinct substrings of the string “cover” that position.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328D - Xor And Mul

We are given two integers $n$ and $m$, and we need to count how many ordered pairs $(x, y)$ exist such that $0 le x le n$ and $0 le y le m$, and a bitwise identity holds: $$(x & y) cdot (x oplus y) = x cdot y.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328K - One Line

We are working on a grid of integer coordinates, where both x and y must lie between 1 and n inclusive. The task is to construct a fairly large set of points inside this n by n grid while satisfying a geometric constraint: no three chosen points are allowed to lie on the same…

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328F - Random Walk

We start at the origin of an infinite grid and perform a random walk of exactly $n$ steps. At every step, we move uniformly to one of the four neighboring cells.

Practice › Codeforces Solutions › Baozii Cup 3 ›

CF 106328B - Odd Cycle

We are given a directed graph and asked, for every vertex, whether it belongs to at least one directed cycle whose length is odd.