Codeforces Round 565 (Div. 3)

Solutions for Codeforces Round 565 (Div. 3) (contest 1176). 4/6 problems verified against sample I/O. Difficulty range: 800-2100.

6 items

Codeforces Round 565 (Div. 3)

Type: Div. 3 | Problems: 6 | Verified: 4/6 | Rating range: 800-2100 | Time: 31m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Divide it!	800	brute-force, greedy, implementation	1m 23s	✓
B	Merge it!	1100	math	4m	✓
C	Lose it!	1300	dp, greedy, implementation	4m 7s	✓
D	Recover it!	1800	dfs-and-similar, graphs, greedy	9m 59s	✗
E	Cover it!	1700	dfs-and-similar, dsu, graphs	10m 33s	✗
F	Destroy it!	2100	dp, implementation, sortings	1m 26s	✓

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

CF 1176E - Cover it!

We are given an undirected connected graph for each query, and we must select a subset of vertices such that every vertex we do not select has at least one selected neighbor. In other words, every unchosen vertex must be “covered” by an adjacent chosen vertex.

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

CF 1176D - Recover it!

We are given an unknown array of integers. Each original value is between 2 and 200000. From this hidden array, a second array is produced by expanding every element into two values and then shuffling everything.

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

CF 1176C - Lose it!

We are given a long sequence where every element is guaranteed to be one of six fixed values: 4, 8, 15, 16, 23, 42. The task is not to reorder or modify values, only to delete elements so that what remains can be partitioned into complete ordered chains of length six.

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

CF 1176B - Merge it!

We are given several independent arrays. In each array, we are allowed to repeatedly take any two elements, remove them, and insert their sum back into the array. Each operation reduces the number of elements by one while preserving the total sum.

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

CF 1176F - Destroy it!

We are given a sequence of turns in a card game. On each turn, the player receives a set of cards, each with a cost and a damage value. The player can play any subset of cards in that turn as long as the total cost does not exceed 3. After the turn, unused cards are discarded.

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

CF 1176A - Divide it!

We are given a starting integer and we are allowed to repeatedly shrink it using a small fixed set of divisibility operations. Each operation replaces the current value with a smaller value, but only if the current value is divisible by a specific number: 2, 3, or 5.