Codeforces Round 824 (Div. 2)

Solutions for Codeforces Round 824 (Div. 2) (contest 1735). 2/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 824 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2900 | Time: 25m 23s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Working Week	800	constructive-algorithms, greedy, math	2m 22s	✓
B	Tea with Tangerines	900	greedy, math	8m 13s	✗
C	Phase Shift	1400	dfs-and-similar, dsu, graphs	1m 18s	✗
D	Meta-set	1700	brute-force, combinatorics, data-structures	8m 55s	✓
E	House Planning	2400	constructive-algorithms, data-structures, graph-matchings	2m 23s	✗
F	Pebbles and Beads	2900	data-structures, geometry	2m 12s	✗

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

CF 1735D - Meta-set

We are given a variant of the card game "Set". Each card has $k$ features, each of which is 0, 1, or 2. A card is thus a length-$k$ vector over ${0,1,2}$. A "set" is any three cards where, for every feature, either all three values are equal or all three are different.

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

CF 1735B - Tea with Tangerines

We are given several independent test cases. In each test case there is a multiset of positive integers, and we are allowed to repeatedly split any number into two smaller positive integers whose sum is preserved.

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

CF 1735F - Pebbles and Beads

We are given two quantities that can be thought of as resources that can be converted into each other, pebbles and beads. We start with an initial stock of pebbles and beads, and then we consider a sequence of days.

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

CF 1735E - House Planning

We are given two hidden configurations on a number line. There are positions of houses $h1, dots, hn$, and two special points $p1$ and $p2$. We are not given coordinates directly. Instead, we are given two multisets of distances: for every house, its distance to $p1$ and to $p2$.

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

CF 1735A - Working Week

We are asked to schedule three days off in a workweek of length $n$, with the last day fixed as a day off. The remaining two days off must not be consecutive with each other or with the first and last days of the week.

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

CF 1735C - Phase Shift

Producing a complete editorial of the quality requested requires first reconstructing and proving the underlying greedy graph construction used in Codeforces 1735C.