Codeforces Round 529 (Div. 3)

Solutions for Codeforces Round 529 (Div. 3) (contest 1095). 3/6 problems verified against sample I/O. Difficulty range: 800-1900.

6 items

Codeforces Round 529 (Div. 3)

Type: Div. 3 | Problems: 6 | Verified: 3/6 | Rating range: 800-1900 | Time: 56m 48s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Repeating Cipher	800	implementation	22m 53s	✗
B	Array Stabilization	900	implementation	1m 24s	✓
C	Powers Of Two	1400	bitmasks, greedy	12m 24s	✗
D	Circular Dance	1600	implementation	11m 57s	✗
E	Almost Regular Bracket Sequence	1900	implementation	7m 2s	✓
F	Make It Connected	1900	dsu, graphs, greedy	1m 8s	✓

Practice › Codeforces Solutions › Codeforces Round 529 (Div. 3) ›

CF 1095A - Repeating Cipher

We are given a string that was produced by a very specific “stretched repetition” rule applied to some hidden original string. The original string is short, with length at most 10, but we do not know it.

Practice › Codeforces Solutions › Codeforces Round 529 (Div. 3) ›

CF 1095E - Almost Regular Bracket Sequence

We are given a binary string of parentheses. Each character is either an opening bracket or a closing bracket. We are allowed to pick exactly one position and flip the bracket type at that position.

Practice › Codeforces Solutions › Codeforces Round 529 (Div. 3) ›

CF 1095C - Powers Of Two

We are asked to express a given integer n as a sum of exactly k numbers, where every summand must be a power of two. Each chosen number is therefore of the form 1, 2, 4, 8, ..., and repetitions are allowed because we can use the same power multiple times.

Practice › Codeforces Solutions › Codeforces Round 529 (Div. 3) ›

CF 1095D - Circular Dance

We are given a hidden circular ordering of the numbers from 1 to n. The ordering is a cycle, so each element has a next element and a next-next element when we walk clockwise around the circle.

Practice › Codeforces Solutions › Codeforces Round 529 (Div. 3) ›

CF 1095F - Make It Connected

We are given n vertices, each with a number ai written on it, and no edges initially. We can connect any two vertices by paying the sum of their numbers ax + ay. Additionally, there are m special offers, each allowing a particular edge to be added at a discounted cost w.

Practice › Codeforces Solutions › Codeforces Round 529 (Div. 3) ›

CF 1095B - Array Stabilization

We are given a list of numbers representing an array, and we are allowed to remove exactly one element. After removing it, we look at how “spread out” the remaining numbers are, defined as the difference between the largest and smallest remaining value.