Codeforces Round 1072 (Div. 3)

7 problems from Codeforces Round 1072 (Div. 3) (contest 2184), difficulty 800-1900. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 1072 (Div. 3)

Div. 3 | 7 problems | 3/7 verified | Difficulty 800-1900 | 16m 4s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Social Experiment	800	math	38,048	1m 48s	✓
B	Hourglass	1100	math	24,079	2m 15s
C	Huge Pile	1100	binary-search, dfs-and-similar, dp	21,840	1m 43s	✓
D	Unfair Game	1600	combinatorics, dp, math	9,486	2m 38s
E	Exquisite Array	1800	combinatorics, data-structures, dsu	5,764	2m 4s
F	Cherry Tree	1900	dfs-and-similar, dp, graphs	3,891	3m 44s	✓
G	Nastiness of Segments	1900	binary-search, data-structures	2,958	1m 52s

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

CF 2184F - Cherry Tree

We have a rooted tree whose leaves each contain exactly one cherry. A shake performed at vertex v makes the cherries fall from every leaf inside the subtree of v. Once a cherry has fallen, it must never be affected by another shake.

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

CF 2184G - Nastiness of Segments

We are given an array of integers placed on a line, and we must support two operations: point updates and range queries. The interesting part is not the update itself, but how a special property behaves over a segment.

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

CF 2184D - Unfair Game

Working

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

CF 2184E - Exquisite Array

We are given a permutation of length $n$, which is simply an array of integers from $1$ to $n$ in some order without repeats.

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

CF 2184B - Hourglass

Vadim has an hourglass that measures exactly s minutes. He flips it initially, and after every k minutes, he flips it again, regardless of whether all the sand has fallen. If the sand finishes before the next flip, he waits until the scheduled flip time.

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

CF 2184A - Social Experiment

We have $n$ people. They must be partitioned into teams, where every team has either 2 or 3 members. After the teams are formed, each team independently chooses one of two civilizations.

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

CF 2184C - Huge Pile

Andrei starts with a single pile containing $n$ apples. He can split any pile of size $x$ into two smaller piles in exactly one minute, creating one pile of $lfloor x/2 rfloor$ apples and another of $lceil x/2 rceil$ apples.