Educational Codeforces Round 114 (Rated for Div. 2)

Solutions for Educational Codeforces Round 114 (Rated for Div. 2) (contest 1574). 1/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Educational Codeforces Round 114 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2700 | Time: 15m 44s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Regular Bracket Sequences	800	constructive-algorithms	1m 57s	✗
B	Combinatorics Homework	1100	combinatorics, greedy, math	2m 35s	✗
C	Slay the Dragon	1300	binary-search, greedy, sortings	5m 53s	✗
D	The Strongest Build	2000	binary-search, brute-force, data-structures	1m 21s	✓
E	Coloring	2500	combinatorics, constructive-algorithms, implementation	1m 58s	✗
F	Occurrences	2700	combinatorics, dfs-and-similar, dp	2m	✗

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

CF 1574C - Slay the Dragon

We have a squad of heroes, each with a fixed strength. For every dragon, we must choose exactly one hero to fight it, while all remaining heroes stay behind to defend the castle. A dragon has two requirements.

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

CF 1574F - Occurrences

We are asked to construct a length m array a, where each position can take a value from 1 to k. The twist is that we are given several “pattern arrays” Ai, and these patterns impose constraints on how often they are allowed to appear inside a.

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

CF 1574E - Coloring

We are asked to fill an initially empty $n times m$ matrix with 0s and 1s such that every $2 times 2$ submatrix contains exactly two 0s and two 1s.

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

CF 1574D - The Strongest Build

In this problem, we are asked to help Ivan choose the strongest possible hero build from a set of equipment slots, each with multiple items of different strengths. Each slot has its own list of items, already sorted by increasing strength.

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

CF 1574B - Combinatorics Homework

The proposed solution appears to be a complete and well-explained editorial for Codeforces 1575A, but it does not address Exercise 4.2.2.16 from TAOCP at all.

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

CF 1574A - Regular Bracket Sequences

We are asked to generate valid bracket sequences, which are strings consisting only of "(" and ")" that form balanced parentheses. A sequence is valid if every opening bracket has a corresponding closing bracket and no closing bracket appears before its matching opening bracket.