Турнир Архимеда 2018

12 problems from Турнир Архимеда 2018 (contest 103665), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Турнир Архимеда 2018

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

#	Problem	Time	✓
A	\u0420\u0435\u0448\u0435\u043d\u0438\u0435 \u0437\u0430\u0434\u0430\u0447	50s	✓
B	\u041f\u0435\u0440\u0435\u0432\u043e\u0434\u0447\u0438\u043a	43s	✓
C	\u0414\u043e\u0441\u0442\u0430\u0432\u043a\u0430 \u043d\u043e\u0432\u043e\u0441\u0442\u0438	50s	✓
D	Game of stones	45s	✓
E	\u041f\u0440\u043e\u043f\u0430\u0432\u0448\u0438\u0435 \u0441\u043b\u0438\u0442\u043a\u0438	48s	✓
F	\u041d\u0430\u0431\u043b\u044e\u0434\u0435\u043d\u0438\u0435 \u043d\u0430 \u0432\u044b\u0431\u043e\u0440\u0430\u0445	1m	✓
G	\u0421\u0435\u0439\u0444	46s	✓
H	\u0414\u0432\u043e\u0438\u0447\u043d\u0430\u044f \u043f\u043e\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u044c	45s	✓
I	\u0414\u043e\u043c\u0430\u0448\u043d\u044f\u044f \u0440\u0430\u0431\u043e\u0442\u0430	48s	✓
J	\u0423\u0431\u043e\u0440\u043a\u0430	49s	✓
K	\u0421\u043e\u0432\u043c\u0435\u0441\u0442\u043d\u043e\u0435 \u0441\u0447\u0430\u0441\u0442\u044c\u0435	2m 12s	✓
L	\u0410 \u043e\u043d\u0430 \u0435\u043c\u0443 \u043a\u0430\u043a \u0440\u0430\u0437	1m 1s	✓

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665H - Двоичная последовательность

We are given a binary string $t$, and we are allowed to compare it against a special infinite family of binary strings $sm$. Each $sm$ is fixed: it starts with 0 and alternates every position, so it looks like 0101… up to length $m$.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665K - Совместное счастье

We are given a patient who may suffer from exactly one disease among $k$ candidates. There are $n$ available medical tests. Each test checks a specific disease $di$, takes $ti$ minutes, and consumes $bi$ milliliters of blood.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665B - Переводчик

We are given a word that belongs to exactly one of two alien alphabets. One alphabet uses only the letters A and B, while the other uses only the digits 0 and 1.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665L - А она ему как раз

We are given a set of hats, each described by four numbers. These numbers define a structured bargaining process between a buyer and a seller.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665J - Уборка

We are given three stacks of books. Every book has a unique label from 1 to s, where s is the total number of books across all stacks. Each stack is described from bottom to top, so each stack is essentially a sequence where only the last element is currently accessible.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665I - Домашняя работа

We are given a multiset of digits, all of them nonzero, and we are allowed to arrange them in any order to form a number. The task introduces two participants who both construct numbers from the same digit set.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665F - Наблюдение на выборах

There are several voting districts, and each district contains a number of polling stations. Every station has a predicted amount of fraudulent ballots that would be added there if nothing is done. The goal is to reduce the total fraud by placing observers.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665G - Сейф

We are given a row of digits. In one move, we may pick a single position and increase or decrease that digit by one, staying within the range 0 to 9. The goal is not to reach a fixed target string, but to reach any configuration where some digit value appears at least k times.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665E - Пропавшие слитки

We are given a collection of identical gold bars, and each bar can be oriented in one of three effective ways, contributing a height of either a, b, or c. All bars must be used exactly once, and we stack them into a single tower.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665D - Game of stones

We are given a line of $n$ stones, each colored either black or white. The goal is to determine whether, by repeatedly applying allowed local recoloring operations, it is possible to transform the entire line so that all stones end up with the same color.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665A - Решение задач

Two contestants are tracking how many programming problems they solve over time. Each of them already has some number of solved problems, and then they continue solving at a constant daily rate.

Practice › Codeforces Solutions › Турнир Архимеда 2018 ›

CF 103665C - Доставка новости

We are given a rectangular grid of cities with height h and width w. Each cell is a city, and from any city the news can be passed in one day to other cities reachable by a chess knight move, meaning the usual eight L shaped moves, as long as the destination cell stays inside…