ICPC Central Russia Regional Qualyfing Round, 2021

12 problems from ICPC Central Russia Regional Qualyfing Round, 2021 (contest 104453), difficulty -. 9/12 solutions verified against sample I/O.

12 items

ICPC Central Russia Regional Qualyfing Round, 2021

ICPC/IOI | 12 problems | 9/12 verified | Difficulty - | 19m 44s

#	Problem	Time	✓
A	\u041a\u043e\u043c\u043f\u043b\u0435\u043a\u0441\u043d\u044b\u0435 \u0447\u0438\u0441\u043b\u0430	1m 52s	✓
B	\u0422\u0440\u0435\u043d\u0438\u0440\u043e\u0432\u043a\u0438	1m 11s	✓
C	\u0411\u0438\u0442\u043e\u0432\u044b\u0435 \u043e\u043f\u0435\u0440\u0430\u0446\u0438\u0438	1m 20s	✓
D	\u041e\u0431\u0440\u0430\u0431\u043e\u0442\u043a\u0430 \u0442\u0435\u043a\u0441\u0442\u0430	1m 38s
E	\u041f\u043e\u0441\u0442\u0443\u043f\u043b\u0435\u043d\u0438\u0435 \u0432 \u0430\u0441\u043f\u0438\u0440\u0430\u043d\u0442\u0443\u0440\u0443	1m 24s	✓
F	\u041f\u043b\u043e\u0445\u043e\u0439 \u0441\u043e\u0441\u0435\u0434	2m 51s	✓
G	\u0421\u0431\u043e\u0440 \u0443\u0440\u043e\u0436\u0430\u044f	1m 16s	✓
H	\u0421\u043a\u0430\u0437\u043e\u0447\u043d\u044b\u0435 \u0441\u043d\u044b	1m 2s
I	\u0421\u0442\u0440\u0430\u043d\u043d\u043e\u0435 \u043f\u0440\u0435\u043e\u0431\u0440\u0430\u0437\u043e\u0432\u0430\u043d\u0438\u0435	1m 16s	✓
J	\u0412\u0435\u0436\u043b\u0438\u0432\u044b\u0435 \u0441\u043e\u0441\u0435\u0434\u0438	1m 14s	✓
K	\u0420\u0430\u0431\u043e\u0442\u0430 \u043f\u043e\u0441\u043b\u0435 \u0432\u0443\u0437\u0430	3m 11s
L	\u0414\u043e\u0436\u0434\u044c	1m 29s	✓

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453K - Работа после вуза

Error: Your code assumed: But the actual input is: So it is actually: - line 1: 2 numbers → 0 0 - line 2: 2 numbers → 0 1 - line 3: 2 numbers → 1 0 That means the problem is not a single-line complex multiplication task anymore. It’s multiple test cases or multiple pairs.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453L - Дождь

We are given a Cartesian plane where movement starts at Igor’s position and ends when he reaches the interior of a fixed axis-aligned rectangle.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453J - Вежливые соседи

We are simulating activity of several neighbors living along a single narrow road. Each neighbor owns a house indexed from 1 to N. Over time, we receive a chronological log of events describing arrivals and departure attempts.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453I - Странное преобразование

We are given a string made only of two symbols, which we can think of as two colors or two types of tokens, say a and b. The process we are allowed to perform repeatedly takes any two positions that currently contain different symbols.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453F - Плохой сосед

The key clue is: (empty) This strongly indicates one of these issues: Very common pattern: Less likely, but possible if using sys.stdout.write incorrectly. (e.g.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453G - Сбор урожая

We are given several types of crops. For each crop type, we know how many kilograms were harvested and how much a single storage box can hold for that specific crop. The key restriction is that boxes are crop-specific, meaning you cannot mix different crops inside the same box.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453H - Сказочные сны

We are given a set of lines in the plane, each described by an equation of the form $y = A x + B$. No two lines are identical, so every pair is either parallel or intersects exactly once.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453D - Обработка текста

The task is a direct character-to-pattern encoding problem. We are given a single line of text consisting only of lowercase Latin letters, spaces, and a small set of punctuation marks.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453E - Поступление в аспирантуру

We are given a fixed number of funded PhD positions, and a list of applicants with their achievement scores. Igor has his own score, and we must determine his outcome relative to everyone else. The admission rule is based on ranking by score.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453A - Комплексные числа

We are given two complex numbers, each described by an integer real part and an integer imaginary part. The first number is formed from the pair $a, b$ as $a + bi$, and the second is $c + di$.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453C - Битовые операции

We are given two binary strings, each of length exactly N. They may contain leading zeros, so their “written form” is not necessarily their canonical binary representation.

Practice › Codeforces Solutions › ICPC Central Russia Regional Qualyfing Round, 2021 ›

CF 104453B - Тренировки

We are given a group of students who answered a poll about attending a training session. Each student could choose the time “10 o’clock”, “12 o’clock”, or both.