Codeforces Round 908 (Div. 1)

Solutions for Codeforces Round 908 (Div. 1) (contest 1893). 1/5 problems verified against sample I/O. Difficulty range: 1400-3500.

5 items

Codeforces Round 908 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 1/5 | Rating range: 1400-3500 | Time: 9m 14s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Anonymous Informant	1400	brute-force, dfs-and-similar, graphs	34s	✗
B	Neutral Tonality	1700	constructive-algorithms, greedy, sortings	2m 13s	✗
C	Freedom of Choice	2000	brute-force, greedy, implementation	2m 39s	✗
D	Colorful Constructive	2600	constructive-algorithms, data-structures, greedy	2m 5s	✗
E	Cacti Symphony	3500	combinatorics, dfs-and-similar, dp	1m 43s	✓

Practice › Codeforces Solutions › Codeforces Round 908 (Div. 1) ›

CF 1893E - Cacti Symphony

We are asked to assign weights from 1 to 3 to every vertex and edge of a graph that is connected and has a very particular structure: any two simple cycles are vertex-disjoint.

Practice › Codeforces Solutions › Codeforces Round 908 (Div. 1) ›

CF 1893D - Colorful Constructive

We are given a multiset of colored cubes. Cube colors are fixed, but we may choose how to distribute them across shelves and in what order they appear on each shelf. For a shelf, the requirement is about the minimum distance between equal colors.

Practice › Codeforces Solutions › Codeforces Round 908 (Div. 1) ›

CF 1893C - Freedom of Choice

Working

Practice › Codeforces Solutions › Codeforces Round 908 (Div. 1) ›

CF 1893B - Neutral Tonality

We are given two arrays. The first array is fixed in order, and the second array is a multiset of extra values we are allowed to insert anywhere into the first array, while also being allowed to permute these inserted values arbitrarily before placing them.

Practice › Codeforces Solutions › Codeforces Round 908 (Div. 1) ›

CF 1893A - Anonymous Informant

Working