Educational Codeforces Round 61 (Rated for Div. 2)

Solutions for Educational Codeforces Round 61 (Rated for Div. 2) (contest 1132). 6/7 problems verified against sample I/O. Difficulty range: 900-2400.

7 items

Educational Codeforces Round 61 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 6/7 | Rating range: 900-2400 | Time: 10m 4s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Regular Bracket Sequence	1100	greedy, implementation	1m 10s	✓
B	Discounts	900	greedy, sortings	1m 13s	✓
C	Painting the Fence	1700	brute-force	2m 2s	✓
D	Stressful Training	2300	binary-search, greedy	1m 23s	✗
E	Knapsack	2300	dfs-and-similar, dp, greedy	1m 11s	✓
F	Clear the String	2000	dp	1m 42s	✓
G	Greedy Subsequences	2400	data-structures, dp, trees	1m 23s	✓

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

CF 1132G - Greedy Subsequences

We are given a long array of integers and a fixed window size. For every contiguous segment of length k, we are asked to simulate a very specific process that builds a subsequence of indices.

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

CF 1132F - Clear the String

We have a string of lowercase letters. In one operation, we may choose any contiguous block whose characters are all the same and remove it. After removal, the remaining parts of the string join together.

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

CF 1132D - Stressful Training

We have a contest with n students, each with a laptop that starts with some initial battery ai and consumes bi units of charge per minute. The contest lasts k minutes.

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

CF 1132E - Knapsack

We are given a multiset of items where every item has a weight between 1 and 8 inclusive. The number of items of each weight is extremely large, but only their counts matter, not their identities.

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

CF 1132C - Painting the Fence

We have a fence with n sections numbered from 1 to n. Each painter covers one continuous interval [li, ri]. Originally all q painters are available, but we are forced to dismiss exactly two of them and keep the remaining q - 2.

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

CF 1132B - Discounts

We have a set of chocolate bars, each with its own price. The shopper wants all the bars but has a selection of discount coupons. Each coupon allows buying a fixed number of bars, but within that selection, the cheapest bar is free.

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

CF 1132A - Regular Bracket Sequence

We are given four types of bracket strings, each of length two: "((", "()", ")(", and "))". The input provides counts of how many of each type we have.