2024 ICPC Belarus Regional Contest

12 problems from 2024 ICPC Belarus Regional Contest (contest 105535), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2024 ICPC Belarus Regional Contest

ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 12m 22s

#	Problem	Time	✓
A	Arithmetics and That's It	1m 2s	✓
B	Byte Pair Encoding	58s	✓
C	Confusion	1m 8s	✓
D	Desired Distance	1m 1s	✓
E	Enter the Museum	57s	✓
F	Fairly Easy Problem	1m 12s	✓
G	Gorgeous Summation	1m 21s	✓
H	Huh? Oh, Yes, Welcome to the Contest!	53s	✓
I	Imperial Decree	52s	✓
J	Jolly Polygon	1m 13s	✓
K	Know Your Duration of Stay	54s	✓
L	Late Autumn Set of Cards	51s	✓

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535G - Gorgeous Summation

We are given a sequence and asked to consider every contiguous subarray whose length is even. For each such subarray, we pair elements from the ends inward: first with last, second with second-last, and so on.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535K - Know Your Duration of Stay

We are given a calendar that is no longer the standard one year structure, but instead consists of a sequence of months, each with its own number of days. A date is represented as a pair of integers: a day inside a month and the month index.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535I - Imperial Decree

We are given an $n times m$ grid where each cell has a non-negative weight. A random process picks two points in the grid, and those two points define a rectangle whose sides are parallel to the grid. The task is to compute the expected area of that rectangle.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535A - Arithmetics and That's It

We are given a sequence of integers and allowed to delete at most k of them. After deletions, the remaining numbers must form an arithmetic progression when read in their original order.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535D - Desired Distance

We are given a set of points in the plane, except one point is missing. There are already $n-1$ fixed points, and we are allowed to choose the coordinates of the final $n$-th point.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535L - Late Autumn Set of Cards

We are given a multiset of positive integers written on cards. From these cards, we may select any subset, and the value of that subset is defined as the product of all selected numbers.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535J - Jolly Polygon

We are asked to construct a simple polygon with exactly n vertices placed on integer grid points within a large bounding box.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535H - Huh? Oh, Yes, Welcome to the Contest!

The task simulates a fixed registration dialogue for a contest team, where the only variable part is the team name.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535F - Fairly Easy Problem

We are given a sequence of fixed points $C1, C2, dots, Cn$ on a plane and a special point $D$. For each $Ci$, we must choose a circle centered at $Ci$, with radius $ri$.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535E - Enter the Museum

We are given a connected undirected graph that forms a tree, rooted at room 1. Each room contains a number of exhibits, and the total number of exhibits across all rooms is at most 2 · 10^5. Petya starts at room 1 and must end at room 1.

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535C - Confusion

We are given a fixed 32-bit unsigned integer $a$. For each test case, we must find all 32-bit unsigned integers $b$ such that two quantities become identical when viewed modulo $2^{32}$: the first quantity is the power $a^b$, computed in the usual mathematical sense, and the…

Practice › Codeforces Solutions › 2024 ICPC Belarus Regional Contest ›

CF 105535B - Byte Pair Encoding

We are given a sequence of bytes, each value initially in the range from 0 to 255. The process repeatedly compresses adjacent pairs by repeatedly selecting a specific ordered pair of values and collapsing all its occurrences in one batch operation.