BSUIR Open X. Reload. Semifinal

10 problems from BSUIR Open X. Reload. Semifinal (contest 104254), difficulty -. 5/10 solutions verified against sample I/O.

10 items

BSUIR Open X. Reload. Semifinal

Special | 10 problems | 5/10 verified | Difficulty - | 16m 8s

#	Problem	Time	✓
A	Galactical exam	1m 18s	✓
B	Maximize	1m 26s
C	Function	1m 46s	✓
D	Exponentiation calculator	2m 9s
E	Cosmo Go	1m 28s
F	Why 42?	2m 25s	✓
G	Broken boards	1m 53s
H	Road to Student union	1m 6s	✓
I	From one to six	1m 35s
J	Reload	1m 2s	✓

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254I - From one to six

We are given an array of length up to one hundred thousand, and every element is restricted to a very small domain: only values from 1 to 6 appear. Over this array we must support two kinds of operations on subsegments. One operation rearranges a chosen segment into sorted order.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254J - Reload

We are given a long string whose length is exactly nine times some number $n$. This means the string can naturally be seen as a sequence of $n$ consecutive blocks, each block having length 9. We are also given a fixed target word, “BSUIROPEN”.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254G - Broken boards

We are given a broken plank whose bottom edge is fixed on the x-axis and whose top edge is described by a polyline with strictly increasing x-coordinates.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254H - Road to Student union

We are given a directed structure over numbered nodes from 1 to n. Each node has a value a[i], which is the number of points Egor gains when he visits that node. Egor always starts at node 1, and his goal is to reach node n.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254F - Why 42?

We are given a tree whose nodes represent planets. Each planet initially belongs to one of K labeled groups called galaxies. These galaxies are not connected structures by default, they are just color labels on nodes.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254D - Exponentiation calculator

We are given a single arithmetic expression written in a very restricted “calculator language”. The expression contains multi-digit positive integers and two unusual binary operations.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254E - Cosmo Go

We are working on an $N times N$ grid where each column has a vertical “blocked” prefix. In column $x$, all cells from row $1$ up to row $Ax$ are forbidden. Everything above that prefix is potentially usable space.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254C - Function

We are given a recursively defined function that behaves in two different regimes depending on the input value. If the input is larger than a threshold $a$, the function immediately performs a simple linear transformation by subtracting $b-1$.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254B - Maximize

We are given two arrays of equal length, and we are allowed to permute only the second array freely. After fixing a pairing between elements of the first array and the permuted second array, we compute the sum of gcd values over all pairs.

Practice › Codeforces Solutions › BSUIR Open X. Reload. Semifinal ›

CF 104254A - Galactical exam

We are given multiple independent queries. Each query describes a square multiplication table of size n × n, where both row and column indices range from 1 to n. Each cell contains the product of its row index and column index.