Baozii Cup 2

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

13 items

Baozii Cup 2

Special | 13 problems | 13/13 verified | Difficulty - | 11m 59s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Beautiful Substrings				1m 10s	✓
B	Firefly's Favourite Problem				53s	✓
C	Large Graph				1m 2s	✓
D	Why Does Every Baozii Cup Have a GCD Problem				54s	✓
E	Another GCD				46s	✓
F	WTF Another GCD?				1m 3s	✓
G	Fatalerror: Implementation Failed				49s	✓
H	Dilworth's Theorem				49s	✓
I	Two Squared Equals Four				48s	✓
J	HDZ Explosion				52s	✓
K	Boring Tree				1m 16s	✓
L	OR + AND				48s	✓
M	ABAB				49s	✓

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883D - Why Does Every Baozii Cup Have a GCD Problem

We are maintaining an array of integers under two kinds of destructive updates and range sum queries. One update forces a single position to become a new value.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883M - ABAB

We are given a sequence of integers and asked to count ordered index quadruples $(i, j, k, l)$ such that the indices are strictly increasing and the values form an alternating pattern.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883L - OR + AND

We are given an array of integers, and we repeatedly need to answer queries on subsegments. For any chosen subarray, we are allowed to split its elements into two groups. One group contributes the bitwise OR of its elements, the other contributes the bitwise AND of its elements.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883J - HDZ Explosion

We are given a permutation of the numbers from 1 to n. Each position has a unique “height”, and there is exactly one position that contains the maximum value n. That position is the target we want to reach. A robot starts at an arbitrary index i. It has a movement range d.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883I - Two Squared Equals Four

We are given a collection of distinct lattice points on the plane. From these points, any subset of four points is considered “good” if those four points can serve as the vertices of a square in any orientation, not necessarily axis-aligned.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883H - Dilworth's Theorem

We are asked to construct a permutation of the numbers from 1 to n such that two classical order statistics of the sequence coincide: the length of the longest increasing subsequence and the length of the longest decreasing subsequence must be equal.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883G - Fatalerror: Implementation Failed

We are dealing with a hidden 64-bit non-negative integer, and our only way to learn about it is by probing it with carefully chosen masks.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883E - Another GCD

We maintain a dynamic collection of pairs of integers, where each pair has a value v and a weight w. The structure supports inserting pairs, removing existing occurrences, and answering queries of the form: given an integer k, find among all stored pairs those whose first…

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883A - Beautiful Substrings

We are given a string and asked to count how many of its substrings have a very specific three-part structure. A substring is called valid when it can be split into three consecutive equal-length blocks where the first and last blocks are identical, and the middle block is the…

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883B - Firefly's Favourite Problem

We are given a very large integer $N$ written in decimal form and a digit $x$ between 1 and 9. The task is to examine every positive integer $M$ from 1 up to $N$, count how many times the digit $x$ appears inside each $M$, and group numbers by that count.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883K - Boring Tree

We are given a tree where some vertices contain stones, and we are allowed to move each stone along edges, one step at a time.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883F - WTF Another GCD?

We maintain a dynamic collection of pairs $(v, w)$. Each operation either inserts a pair, removes one occurrence of a pair, or asks a query with a number $k$.

Practice › Codeforces Solutions › Baozii Cup 2 ›

CF 105883C - Large Graph

We are maintaining a graph on vertices labeled from 1 to n, but n itself can be extremely large, so large that we cannot even think of storing anything indexed by vertices directly. Initially there are no edges, and we receive a sequence of queries.