Высшая проба - 2024. Заключительный этап

5 problems from Высшая проба - 2024. Заключительный этап (contest 106347), difficulty -. 3/5 solutions verified against sample I/O.

5 items

Высшая проба - 2024. Заключительный этап

Special | 5 problems | 3/5 verified | Difficulty - | 3m 56s

#	Problem	Time	✓
A	\u0420\u0435\u043c\u043e\u043d\u0442 \u043a\u043b\u0430\u0434\u043e\u0432\u043a\u0438	38s	✓
B	\u0426\u0432\u0435\u0442\u043e\u0447\u043d\u044b\u0439 \u043c\u0430\u0433\u0430\u0437\u0438\u043d	29s
C	\u041e\u043f\u0435\u0440\u0430\u0446\u0438\u0438 \u0441 \u0447\u0438\u0441\u043b\u043e\u043c	53s	✓
D	\u041c\u043e\u0434\u0443\u043b\u044c\u043d\u044b\u0439 \u0433\u0440\u0430\u0444	53s	✓
E	\u041a\u0430\u0440\u0430\u0432\u0430\u043d\u044b \u0438 \u043f\u0440\u043e\u0432\u0438\u043d\u0446\u0438\u0438	1m 3s

Practice › Codeforces Solutions › Высшая проба - 2024. Заключительный этап ›

CF 106347E - Караваны и провинции

I’m sorry, but I can’t provide a reliable full editorial and implementation for this problem without risking giving you a wrong algorithm. The data structure required here is quite subtle, and I do not want to fabricate a solution.

Practice › Codeforces Solutions › Высшая проба - 2024. Заключительный этап ›

CF 106347D - Модульный граф

We have a connected undirected graph. Every vertex stores a number, and moving through an edge costs the absolute difference between the numbers written at its two endpoints.

Practice › Codeforces Solutions › Высшая проба - 2024. Заключительный этап ›

CF 106347C - Операции с числом

We are given a starting value equal to zero and a target number written in binary. We want to transform the initial zero into this target using two arithmetic operations: we can either add one to the current value, or multiply it by two.

Practice › Codeforces Solutions › Высшая проба - 2024. Заключительный этап ›

CF 106347A - Ремонт кладовки

The problem describes a rectangular storage room with dimensions X × Y × Z. The four walls must be covered with wallpaper, but opposite walls must always use the same type of wallpaper. There are two wallpaper types available.

Practice › Codeforces Solutions › Высшая проба - 2024. Заключительный этап ›

CF 106347B - Цветочный магазин

We have a flower shop with n different flower types. A valid bouquet needs exactly one flower of every type, so making one bouquet consumes one flower from each category. The shop already owns a[i] flowers of type i.