Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада

12 problems from Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада (contest 104699), difficulty -. 2/12 solutions verified against sample I/O.

12 items

Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада

Special | 12 problems | 2/12 verified | Difficulty - | 17m 34s

#	Problem	Time	✓
A	Keep Talking and Nobody Explodes	1m 26s
B	\u041a\u0430\u0434\u0440\u043e\u0432\u044b\u0435 \u043f\u0435\u0440\u0435\u0441\u0442\u0430\u043d\u043e\u0432\u043a\u0438	1m 19s	✓
C	\u0411\u0430\u0440\u0431\u0438 \u0432 \u0440\u0435\u0430\u043b\u044c\u043d\u043e\u043c \u043c\u0438\u0440\u0435	1m 14s	✓
D	\u041f\u0440\u0435\u043b\u0435\u0441\u0442\u043d\u0430\u044f \u0440\u0430\u0441\u0441\u0430\u0434\u043a\u0430	1m 23s
E	\u0426\u0435\u043f\u043d\u0430\u044f \u0440\u0435\u0430\u043a\u0446\u0438\u044f	1m 39s
F	\u0421\u0430\u043c\u044b\u0439 \u043c\u0438\u043b\u044b\u0439 \u0434\u043e\u043c	1m 16s
G	\u041f\u0440\u043e\u0433\u0443\u043b\u043a\u0430 \u0441 \u0411\u0430\u0440\u0431\u0438	1m 54s
H	\u041a\u043e\u043d\u0444\u0435\u0440\u0435\u043d\u0446\u0438\u044f	1m 19s
I	\u0418\u043d\u0442\u0435\u0440\u043f\u0440\u0435\u0442\u0430\u0446\u0438\u044f	1m 40s
J	\u041e\u043f\u0430\u0441\u043d\u044b\u0435 \u043e\u043f\u044b\u0442\u044b	1m 15s
K	\u0418\u0434\u0435\u0430\u043b\u044c\u043d\u0430\u044f \u043f\u0430\u0440\u0430	1m 35s
L	\u0411\u0435\u0441\u043f\u043e\u0440\u044f\u0434\u043a\u0438 \u0432 \u0411\u0430\u0440\u0431\u0438\u043b\u044d\u043d\u0434\u0435	1m 34s

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699L - Беспорядки в Барбилэнде

We are given a social network modeled as an undirected graph. Each person has a fixed integer value $pv$, and each friendship has a value $d{u,v}$.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699K - Идеальная пара

We maintain a dynamic collection of strings that belong to two separate groups: Barbies and Kens. Each update either inserts a string into one of the groups or removes a previously inserted occurrence.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699J - Опасные опыты

We are given several independent research groups, each with a required threshold value. If a group receives at least its threshold amount of uranium, that group is considered to have reached a “critical state”.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699I - Интерпретация

The input describes a program written in a small imperative pseudocode language with nested loops, assignments, input, and output. The structure is block-based: loops can contain other loops, and each loop introduces a new temporary variable that is only valid inside that loop.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699G - Прогулка с Барби

We are given a very large grid with height $h$ and width $w$, but only a small number of meaningful cells. Most cells are empty, some contain rocks that block movement, and some contain values that increase the score when the path passes through them.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699H - Конференция

We are given a weighted undirected network of cities, where each city contains some number of scientists. A scientist can travel along roads between cities, paying the sum of edge costs along their route.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699E - Цепная реакция

We are given a tree where each vertex represents a nucleus. Every node has two independent attributes, a value that can be thought of as its neutron count and another as its proton count.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699F - Самый милый дом

We are building a one-dimensional sequence of rooms, each occupying a fixed horizontal segment, but with freedom to place each room vertically inside a constrained interval.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699D - Прелестная рассадка

We are given a circular table with $n$ seats and $n$ guests, and each guest comes with a constraint interval $[li, ri]$. This interval describes where that guest is allowed to sit: if we assign guest $i$ to some seat $j$, then it must hold that $li le j le ri$.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699A - Keep Talking and Nobody Explodes

We are trying to determine an unknown integer value $p$, which lies in a very large range up to $10^{12}$. We cannot query it directly, but we are allowed two different kinds of interactions. The first interaction is a kind of bounded membership test on $p$.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699B - Кадровые перестановки

We are given a line of rooms, each containing some number of employees. Employees can only move between adjacent rooms, and the goal is to gather everyone into a single chosen room.

Practice › Codeforces Solutions › Интернет-олимпиады, Сезон 2023-2024, Вторая командная олимпиада ›

CF 104699C - Барби в реальном мире

We are given a sequence of shelves, each shelf containing a fixed number of dolls. A group of children is initially distributed across these shelves, and each second every child standing at a shelf takes one doll from that shelf.