Codeforces Round 572 (Div. 2)

Solutions for Codeforces Round 572 (Div. 2) (contest 1189). 3/3 problems verified against sample I/O. Difficulty range: 800-1400.

3 items

Codeforces Round 572 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 3/3 | Rating range: 800-1400 | Time: 9m 36s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Keanu Reeves	800	strings	2m 54s	✓
B	Number Circle	1100	greedy, math, sortings	1m 33s	✓
C	Candies!	1400	data-structures, dp, implementation	5m 9s	✓

Practice › Codeforces Solutions › Codeforces Round 572 (Div. 2) ›

CF 1189C - Candies!

We are given an array of digits. The array length is not arbitrary in queries: every query asks about a segment whose length is exactly a power of two. On each segment, we repeatedly compress the array in a very specific way.

Practice › Codeforces Solutions › Codeforces Round 572 (Div. 2) ›

CF 1189A - Keanu Reeves

We are given a binary string, which is a sequence of characters containing only 0 and 1. A string is defined as good if the count of zeros differs from the count of ones.

Practice › Codeforces Solutions › Codeforces Round 572 (Div. 2) ›

CF 1189B - Number Circle

We are given a multiset of numbers and asked whether we can place all of them around a circle so that every element is strictly smaller than the sum of its two adjacent elements. The adjacency is circular, so the first and last elements are also neighbors.