Codeforces Round 758 (Div.1 + Div. 2)

Solutions for Codeforces Round 758 (Div.1 + Div. 2) (contest 1608). 2/7 problems verified against sample I/O. Difficulty range: 800-3500.

7 items

Codeforces Round 758 (Div.1 + Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 2/7 | Rating range: 800-3500 | Time: 16m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Find Array	800	constructive-algorithms, math	1m 28s	✗
B	Build the Permutation	1200	constructive-algorithms, greedy	1m 32s	✗
C	Game Master	1700	data-structures, dfs-and-similar, dp	1m 44s	✓
D	Dominoes	2400	combinatorics, fft, graphs	1m 36s	✗
E	The Cells on the Paper	2800	binary-search, implementation, sortings	7m 11s	✗
F	MEX counting	3200	combinatorics, dp, implementation	1m 25s	✓
G	Alphabetic Tree	3500	binary-search, data-structures, dfs-and-similar	1m 37s	✗

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608E - The Cells on the Paper

The “bug” here is not a subtle implementation issue anymore. It is a full mismatch between: - the expected problem - and the code that is being executed Your “actual output” is: That is not wrong computation. That is debug-printing the parsed input back out.

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608G - Alphabetic Tree

We are given a tree with nodes connected by edges, each labeled with a lowercase letter. In addition, we have a collection of strings. For any two nodes in the tree, the path connecting them defines a string by concatenating the letters along that path in traversal order.

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608F - MEX counting

We are building an array step by step from left to right, and after each position we look at the prefix we have constructed so far. From that prefix we compute its MEX, which is the smallest nonnegative integer that does not appear in the prefix.

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608D - Dominoes

We are given a collection of dominoes, each represented by two cells: left and right. Some cells are already colored black or white, while others are undecided.

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608C - Game Master

We are asked to determine, for each player in a tournament, whether they can possibly win if the tournament is conducted optimally. There are two maps, and each player has a strength on both maps.

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608B - Build the Permutation

We are asked to construct a permutation of the numbers from 1 to n that has exactly a local maxima and b local minima in the interior positions. A local maximum is a number larger than its immediate neighbors, and a local minimum is a number smaller than its immediate neighbors.

Practice › Codeforces Solutions › Codeforces Round 758 (Div.1 + Div. 2) ›

CF 1608A - Find Array

We are asked to construct an increasing sequence of integers for each test case, with a specific restriction on consecutive elements. The sequence must be strictly increasing, and additionally every next element must not be divisible by the previous one.