BSUIR Open X. Reload. Students final

9 problems from BSUIR Open X. Reload. Students final (contest 104255), difficulty -. 2/9 solutions verified against sample I/O.

9 items

BSUIR Open X. Reload. Students final

Special | 9 problems | 2/9 verified | Difficulty - | 15m 34s

#	Problem	Time	✓
A	Stickers for BSUIR Open	1m 11s	✓
B	Two trees	1m 51s
C	Sum of fractions	2m 6s
D	Binary tree	1m 43s
E	Kitten rescue	1m 53s
G	Borrow checker	2m 11s
H	Birthday	1m 34s
I	Palindrome tree	1m 34s
J	Interdimensional Traveler	1m 31s	✓

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255J - Interdimensional Traveler

Each dimension of the system behaves like an independent one-dimensional random walk. The ship starts at position $ai$ in dimension $i$, and while the system is unstable in that dimension (meaning the coordinate is at least 1), it moves one step right with probability $pi$ and…

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255I - Palindrome tree

We are given a tree where each vertex carries a lowercase character. We are allowed to delete vertices, but after deletions the remaining vertices must still form a connected subgraph, meaning they induce a connected subtree.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255G - Borrow checker

Let $Gamma6 = g(0), g(1), dots, g(2^6-1)$ be the 6-bit Gray binary code, where $$g(k) = k oplus lfloor k/2 rfloor.$$ A Gray cycle of length $2^6$ is a cyclic ordering of all $6$-bit strings in which consecutive strings differ in exactly one bit, including the last and first.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255H - Birthday

We are given a convex polygon with $n$ vertices. The only allowed operation is drawing a diagonal between two existing vertices. Each diagonal splits one polygonal region into two smaller regions.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255E - Kitten rescue

The grid describes a small world where a cat must reach a kitten while a dog actively tries to intercept it. Each cell is either blocked, empty, or contains one of the three actors: the cat (start), the kitten (goal), and optionally a dog that moves after every cat action.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255D - Binary tree

We are given a binary tree with a value stored at every node. The tree structure is fixed: each node already knows its left and right child. What is not fixed is the placement of values. All values are distinct, but they are currently scattered arbitrarily across the nodes.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255C - Sum of fractions

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255B - Two trees

We are given a connected undirected simple graph with up to 100 vertices and up to 200 edges. The task is to assign each edge one of three labels so that the graph can be interpreted as the union of two spanning trees defined over the same vertex set.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Students final ›

CF 104255A - Stickers for BSUIR Open

We are given a rectangular sheet of paper with dimensions $n times m$. From this sheet, we want to cut out $k$ identical square stickers, where each sticker is a square with side length $x$. The squares must be fully contained in the sheet, and they are not allowed to overlap.