Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада

4 problems from Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада (contest 106393), difficulty -. 4/4 solutions verified against sample I/O.

4 items

Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада

Special | 4 problems | 4/4 verified | Difficulty - | 4m 17s

#	Problem	Time	✓
A	\u0421\u0438\u043b\u044c\u043d\u0435\u0439\u0448\u0430\u044f \u043a\u043e\u043c\u0430\u043d\u0434\u0430	48s	✓
B	\u0411\u0430\u0440\u044c\u0435\u0440\u044b	51s	✓
C	\u041f\u0440\u043e\u043a\u043b\u044f\u0442\u044b\u0435 \u0430\u043c\u0443\u043b\u0435\u0442\u044b	1m 5s	✓
D	\u0413\u043e\u0434\u0436\u043e \u0421\u0430\u0442\u043e\u0440\u0443 \u0437\u0430\u043f\u0435\u0447\u0430\u0442\u0430\u043b\u0438	1m 33s	✓

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада ›

CF 106393B - Барьеры

We are given an undirected graph on vertices labeled from 1 to n. The graph has no cycles, so every connected component is a tree, and the whole structure is a forest. Each edge connects two vertices and represents a corridor of energy between two barriers.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада ›

CF 106393A - Сильнейшая команда

We are asked to select exactly k characters from a pool of n, maximizing total strength, but the choice is restricted by two independent classification rules derived from each character’s attributes. Each character has a value ci which we want to maximize in sum.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада ›

CF 106393D - Годжо Сатору запечатали

We are given a sequence of walls, each with a resistance value. A character starts with an initial punch strength and walks through a chosen contiguous segment of walls from left to right. When he encounters a wall, two things can happen depending on his current strength.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2025-2026, Вторая личная олимпиада ›

CF 106393C - Проклятые амулеты

We are building sequences of length n using m distinct labels numbered from 0 to m-1, with the restriction that no label is repeated inside a sequence. So each valid sequence is essentially an ordered selection of n distinct elements from m, i.e.