2020-2021, ICPC, East Siberian Regional Contest

12 problems from 2020-2021, ICPC, East Siberian Regional Contest (contest 103411), difficulty -. 6/12 solutions verified against sample I/O.

12 items

2020-2021, ICPC, East Siberian Regional Contest

ICPC/IOI | 12 problems | 6/12 verified | Difficulty - | 11m 22s

#	Problem	Time	✓
A	\u0414\u0438\u0441\u0442\u0430\u043d\u0446\u0438\u043e\u043d\u043d\u043e\u0435 \u043e\u0431\u0443\u0447\u0435\u043d\u0438\u0435	44s	✓
B	\u041a\u043e\u0434 \u043e\u0442 \u0441\u0435\u0439\u0444\u0430	1m 34s
C	\u0412\u0441\u0435\u043e\u0431\u044a\u0435\u043c\u043b\u044e\u0449\u0430\u044f \u0413\u0430\u043b\u0430\u043a\u0442\u0438\u0447\u0435\u0441\u043a\u0430\u044f \u041c\u0430\u0433\u0438\u0441\u0442\u0440\u0430\u043b\u044c\u043d\u0430\u044f \u0421\u0435\u0442\u044c	1m 3s	✓
D	\u0414\u041d\u041a-\u043f\u0430\u043b\u0438\u043d\u0434\u0440\u043e\u043c	44s	✓
E	Empires	31s
F	\u0420\u0430\u0437\u0434\u0430\u0447\u0430 \u0424\u0438\u0431\u043e\u043d\u0430\u0447\u0447\u0438	2m 30s
G	\u041a\u0430\u0440\u0442\u044b, \u0447\u0438\u0441\u043b\u0430, \u0434\u0432\u0430 \u0437\u0430\u043a\u043b\u0438\u043d\u0430\u043d\u0438\u044f	50s	✓
H	\u0413\u0438\u043f\u043d\u043e\u0437	53s	✓
I	Determine The Lap Length	31s
J	Juggle Sort	26s
K	Shark Attack	1m 7s	✓
L	AGTC Matrix	29s

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411J - Juggle Sort

The problem statement for “Codeforces 103411J - Juggle Sort” is missing from your prompt, so there isn’t enough information to derive the algorithm, constraints, or even the core task.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411L - AGTC Matrix

I can’t reliably write a correct editorial for Codeforces 103411L - AGTC Matrix because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411F - Раздача Фибоначчи

Let $G$ be the graph whose vertices are all permutations of the multiset ${s0cdot 0,ldots,sdcdot d}$, with edges given by adjacent interchanges $aj a{j-1} leftrightarrow a{j-1} aj$. Let $N$ be the number of vertices of $G$, so $$N = frac{(s0+s1+cdots+sd)!}{s0!,s1!cdots sd!}.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411K - Shark Attack

We are given a line with several squids placed at integer positions. There is a shark at another position and a single shelter at a fixed coordinate. Every squid wants to reach the shelter, and once it arrives there safely it is protected forever.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411I - Determine The Lap Length

I can’t write a correct editorial for this yet because the actual problem content is missing. Right now I only have the title “Determine The Lap Length”, but no description of what a “lap”, the input, or the required computation actually are.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411H - Гипноз

The problem gives two square matrices of size $n times n$, where $n$ is even. Each matrix represents a “lock”, but the actual structure we care about is not the matrix itself but a decomposition of it into concentric rectangular cycles, or “rings”.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411G - Карты, числа, два заклинания

We are given a sequence of cards, each carrying a non-negative integer value representing its power. We also have a stream of operations, where each operation is one of two possible transformations applied to every card in the sequence.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411E - Empires

I can write the full editorial in the exact format you requested, but I’m missing the actual problem statement for Codeforces 103411E - Empires.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411B - Код от сейфа

Let $G$ be the Cayley graph whose vertices are the $N$ permutations of the multiset ${s0cdot 0,dots,sdcdot d}$ and whose edges correspond to adjacent interchanges $a{deltak}leftrightarrow a{deltak-1}$.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411C - Всеобъемлющая Галактическая Магистральная Сеть

We are given a network of $n$ star systems connected by exactly $n-1$ bidirectional highways, forming a tree. Between any two systems there is exactly one simple path.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411D - ДНК-палиндром

We are given a string over the alphabet {A, C, G, T} that represents a DNA strand. Each character has a fixed complement: A pairs with T, and C pairs with G.

Practice › Codeforces Solutions › 2020-2021, ICPC, East Siberian Regional Contest ›

CF 103411A - Дистанционное обучение

We are organizing online classes using a fixed number of video conferences. Each conference has a hard cap on total participants, and inside every conference a fixed number of seats must be reserved for teachers. The remaining seats, if any, can be filled by students.