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

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

12 items

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

Special | 12 problems | 5/12 verified | Difficulty - | 17m 12s

#	Problem	Time	✓
A	\u041f\u043e\u0431\u0435\u0433 \u041c\u0430\u0439\u043b\u0437\u0430	1m 17s	✓
B	\u041b\u043e\u0432\u043b\u044f \u043f\u0430\u0443\u043a\u043e\u0432	1m 3s	✓
C	\u041f\u0440\u044b\u0436\u043a\u0438 \u043c\u0435\u0436\u0434\u0443 \u0432\u0441\u0435\u043b\u0435\u043d\u043d\u044b\u043c\u0438	1m 29s	✓
D	\u0422\u0435\u0441\u0442 \u043d\u0430 \u0438\u043d\u0442\u0435\u043b\u043b\u0435\u043a\u0442	1m	✓
E	\u041f\u0440\u044f\u043c\u043e\u0443\u0433\u043e\u043b\u044c\u043d\u043e\u0435 \u041f\u044f\u0442\u043d\u043e	1m 32s
F	\u0413\u0432\u0435\u043d \u043e\u0442\u0434\u044b\u0445\u0430\u0435\u0442	1m 14s	✓
G	\u0427\u0435\u043b\u043e\u0432\u0435\u043a-\u043f\u0430\u0443\u043a \u041d\u0443\u0430\u0440 \u0438 \u043a\u0443\u0431\u0438\u043a \u0420\u0443\u0431\u0438\u043a\u0430	1m 35s
H	\u041a\u0432\u0430\u043d\u0442\u043e\u0432\u0430\u044f \u0434\u044b\u0440\u0430	1m 39s
I	\u0421\u0442\u0430\u0431\u0438\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u043c\u0443\u043b\u044c\u0442\u0438\u0432\u0441\u0435\u043b\u0435\u043d\u043d\u043e\u0439	1m 35s
J	\u041f\u0430\u0443\u0442\u0438\u043d\u0430 \u0432\u043e \u0432\u0441\u0435 \u0441\u0442\u043e\u0440\u043e\u043d\u044b	1m 19s
K	\u0418\u0435\u0440\u0430\u0440\u0445\u0438\u044f \u041f\u0430\u0443\u0447\u044c\u0435\u0433\u043e \u0441\u043e\u043e\u0431\u0449\u0435\u0441\u0442\u0432\u0430	1m 45s
L	\u0412\u0437\u043b\u043e\u043c\u0430\u0442\u044c \u043a\u043e\u043b\u043b\u0430\u0439\u0434\u0435\u0440	1m 44s

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

CF 104640L - Взломать коллайдер

We are given a hidden array of length $n$. The array is strictly increasing, meaning every next value is larger than the previous one. However, we are not allowed to see the array directly. Instead, there is an interactive function $f(x)$.

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

CF 104640K - Иерархия Паучьего сообщества

We are given a tree of $n$ nodes rooted at node $1$. Each edge represents a direct supervision relation in a hierarchy, but the direction is not fixed in the input, only the structure of the tree is known.

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

CF 104640J - Паутина во все стороны

We are given a circular boundary centered at the origin, and from the origin we imagine emitting rays in every possible direction. Each ray represents a “web line” that travels outward until it either reaches the boundary circle or gets blocked earlier.

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

CF 104640I - Стабилизация мультивселенной

We are given a directed graph with $n$ vertices, where each vertex has exactly two outgoing edges and exactly two incoming edges. So the whole structure is a 2-in-2-out directed multigraph, potentially with parallel edges. Each edge has an interval $[ai, bi]$.

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

CF 104640H - Квантовая дыра

We are given a binary string length $n$ that we must construct. The cost of the string is defined through all its contiguous substrings of length $k$.

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

CF 104640G - Человек-паук Нуар и кубик Рубика

We are given a grid of size $n times m$ where each cell is either black or white. We are allowed to apply operations that flip an entire row or flip an entire column, toggling all colors in that line.

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

CF 104640E - Прямоугольное Пятно

We are given a collection of axis-aligned rectangles, each defined by its height and width, and each rectangle is also allowed to be rotated by 90 degrees.

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

CF 104640F - Гвен отдыхает

We start with a rectangle of size $n times m$. Two players take turns, starting with Gwen, and there are exactly $k$ moves per player, so $2k$ moves in total. On each move, a player chooses one side of the rectangle and increases it by 1.

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

CF 104640D - Тест на интеллект

We are asked to construct a string of length $n$ over lowercase Latin letters. After we output the string, a machine evaluates it in a way that depends only on which distinct letters appear and how many times each appears.

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

CF 104640C - Прыжки между вселенными

We are given a graph where vertices represent universes and edges represent portals. Each portal has a minimum energy requirement, meaning you can only traverse that portal if your current energy level is at least a given threshold. Energy starts at zero.

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

CF 104640A - Побег Майлза

We are given two separate directed-unweighted weighted graphs that share the same set of vertex labels from 1 to n.

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

CF 104640B - Ловля пауков

We are asked to choose a number of prepared food portions, call it $m$, under a global budget $m le n$. The process has a fixed structure: one portion is always consumed by analysis, leaving $m - 1$ portions.