Educational Codeforces Round 56 (Rated for Div. 2)

7 problems from Educational Codeforces Round 56 (Rated for Div. 2) (contest 1093), difficulty 800-2400. 4/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 56 (Rated for Div. 2)

Div. 2 | 7 problems | 4/7 verified | Difficulty 800-2400 | 38m 7s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dice Rolling	800	math	18,356	6m 28s
B	Letters Rearranging	900	constructive-algorithms, greedy, sortings	17,700	6m 33s
C	Mishka and the Last Exam	1300	greedy	9,719	9m 12s
D	Beautiful Graph	1700	dfs-and-similar, graphs	11,323	3m 33s	✓
E	Intersection of Permutations	2400	data-structures	1,858	3m 57s	✓
F	Vasya and Array	2400	dp	1,359	4m 43s	✓
G	Multidimensional Queries	2300	bitmasks, data-structures	2,222	3m 41s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093E - Intersection of Permutations

We are working with two permutations of the same set of values from 1 to n. One permutation, call it a, gives a position-based arrangement, and the other permutation b also gives a different ordering of the same values.

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093G - Multidimensional Queries

We are working with a collection of points in a very low-dimensional space, where each point has up to five coordinates. The distance between two points is defined as the sum of absolute differences across each coordinate, which is the Manhattan metric.

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093C - Mishka and the Last Exam

We are given a hidden non-decreasing array a of even length n. We never see a directly. Instead, we are told half of its structure: for every symmetric pair of positions, the sum of elements at the ends is known.

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093B - Letters Rearranging

We are given several independent strings made only of lowercase English letters. For each string, we are allowed to rearrange its characters in any order we want.

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093A - Dice Rolling

We are given a standard six-faced dice, but instead of the usual values 1 to 6, its faces contain the integers 2, 3, 4, 5, 6, and 7, all distinct. Each roll produces one of these numbers, and the score for a sequence of rolls is the sum of the visible faces.

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093F - Vasya and Array

We are given a partially specified array of length $n$. Each position either already contains a fixed value between $1$ and $k$, or is unknown and marked as $-1$. We must replace every unknown position with a value from $1$ to $k$, producing a fully filled array.

Practice › Codeforces Solutions › Educational Codeforces Round 56 (Rated for Div. 2) ›

CF 1093D - Beautiful Graph

We are given an undirected graph and asked to assign each vertex one value from the set {1, 2, 3}. The assignment is valid only if every edge connects two vertices whose values sum to an odd number. The task is to count how many such assignments exist, taken modulo 998244353.