vkoshp.letovo

12 problems from vkoshp.letovo (contest 104295), difficulty -. 12/12 solutions verified against sample I/O.

12 items

vkoshp.letovo

Special | 12 problems | 12/12 verified | Difficulty - | 12m 23s

#	Problem	Rating	Tags	Accepted	Time	✓
A	\u041f\u0438\u0440\u043e\u0433-\u0447\u0430\u0441\u044b				54s	✓
B	Spring cleaning				1m 30s	✓
C	\u0420\u0430\u043a\u0443\u0448\u043a\u0438 \u041c\u0443\u043c\u0438-\u043c\u0430\u043c\u044b				53s	✓
D	\u0421\u0435\u043c\u044c\u044f \u041c\u044e\u043c\u043b\u044b				51s	✓
E	\u0421\u043d\u0443\u0441\u043c\u0443\u043c\u0440\u0438\u043a \u0438 \u041a\u043b\u0438\u043f\u0434\u0430\u0441\u0441\u044b				56s	✓
F	\u041e\u0441\u0442\u043e\u0440\u043e\u0436\u043d\u044b\u0435 \u0425\u0430\u0442\u0438\u0444\u043d\u0430\u0442\u0442\u044b				1m 5s	✓
G	\u041f\u043e\u0440\u0430\u0434\u0443\u0439 \u0422\u043e\u0444\u0441\u043b\u0443				52s	✓
H	\u0420\u044b\u0431\u0430\u043b\u043a\u0430				58s	✓
I	Moomin Adventures				57s	✓
J	Flowers				56s	✓
K	\u0421\u043d\u043e\u0440\u043a \u0438 \u043f\u043e\u0440\u044f\u0434\u043e\u043a \u0432 \u043a\u043b\u0430\u0434\u043e\u0432\u043e\u0439				1m 30s	✓
L	\u041a\u0430\u0440\u0442\u0430-\u043b\u044f\u0433\u0443\u0448\u043a\u0430				1m 1s	✓

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295L - Карта-лягушка

We are given an undirected simple graph, and we need to decide whether its structure can be interpreted as a very specific “frog shape”. This shape consists of a simple cycle that represents the body. From this cycle, exactly four attachment points are chosen.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295K - Снорк и порядок в кладовой

We are given a tree with n rooms. Each room initially contains a distinct number written on it. The rooms are connected by corridors, so the structure is a single connected acyclic graph. We must choose exactly x rooms that will remain in use.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295I - Moomin Adventures

We are given a runner moving through a long 3-lane track, where each row is a step in time and each of the three columns represents a lane. Each cell can either be empty, contain a coin, contain an obstacle, or contain a trampoline. The runner starts at row 1 in the middle lane.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295J - Flowers

We are given a rectangular wall represented as a grid of lowercase Latin letters with $n$ rows and $m$ columns. Inside this grid we want to place a square frame of fixed size $k times k$.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295H - Рыбалка

We are given a fishing session defined by a single time interval within one day. Alongside this, we have a large set of fish “activity intervals”, each labeled with a species name. During an activity interval of a species, that fish is actively biting.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295G - Порадуй Тофслу

We are given a collection of tower heights. There are $n$ towers, where $n$ is guaranteed to be odd, and each tower has some initial height. We are also given $k$ extra unit cubes. Each cube can be added to exactly one tower, increasing its height by one.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295F - Осторожные Хатифнатты

We are given two configurations of the same number of points on an integer grid. Think of them as two drawings of indistinguishable particles placed on lattice points. The particles can move, but only through a very specific collective operation.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295E - Снусмумрик и Клипдассы

There are 30 independent positions, each associated with a weight equal to twice its index. Over a sequence of seconds, each position can experience at most one event per second: the occupant either enters its hole, leaves it, or stays unchanged.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295D - Семья Мюмлы

We are given a fixed collection of existing family names, each written as a string of lowercase letters and hyphens. Then we are given several candidate names for a newborn. For each candidate, we must decide whether it is acceptable. A candidate is rejected in two situations.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295B - Spring cleaning

We are given a line of houses, each with a fixed height. A resident who lives in house i wants to reach their own roof starting from the ground, but movement is constrained by a single ladder of fixed length. A ladder of length L allows two kinds of actions.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295A - Пирог-часы

The problem describes a circular cake that behaves like a clock. The cake is first cut at noon, and then a sequence of people arrive at fixed integer hours between 12 and 24. Each arrival creates a cut at that hour, and the cake is divided into segments between consecutive cuts.

Practice › Codeforces Solutions › vkoshp.letovo ›

CF 104295C - Ракушки Муми-мамы

We are given a list of flower beds, each associated with a number of shells. For the i-th bed, there are ai shells that must all be used to form a decorative border.