Codeforces Round 1048 (Div. 2)

Solutions for Codeforces Round 1048 (Div. 2) (contest 2139). 1/7 problems verified against sample I/O. Difficulty range: 800-2600.

7 items

Codeforces Round 1048 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 1/7 | Rating range: 800-2600 | Time: 10m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Maple and Multiplication	800	greedy, math	1m 9s	✓
B	Cake Collection	800	greedy	1m 38s	✗
C	Cake Assignment	1100	bitmasks, constructive-algorithms, greedy	1m 5s	✗
D	Antiamuny Wants to Learn Swap	1900	data-structures, greedy	1m 47s	✗
E1	Maple and Tree Beauty (Easy Version)	1800	dfs-and-similar, dp, math	1m 28s	✗
E2	Maple and Tree Beauty (Hard Version)	2000	bitmasks, dfs-and-similar, dp	1m 29s	✗
F	Antiamuny and Slider Movement	2600	-	1m 31s	✗

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

CF 2139F - Antiamuny and Slider Movement

We are given a set of sliders on a one-dimensional track, each occupying a single position. The sliders are initially ordered left to right, with no overlaps. Each operation attempts to move a particular slider to a target position.

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

CF 2139E2 - Maple and Tree Beauty (Hard Version)

We are working with a rooted tree where every vertex will eventually be assigned either a zero or a one, but the assignment is not fixed. We only know how many zeros must appear overall, while the remaining vertices become ones.

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

CF 2139E1 - Maple and Tree Beauty (Easy Version)

We are given a rooted tree with n vertices, where each vertex must be labeled either 0 or 1. Exactly k vertices are labeled 0, and the remaining n-k are labeled 1. The tree's root is vertex 1, and each other vertex has a specified parent.

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

CF 2139D - Antiamuny Wants to Learn Swap

We are given a permutation and asked about many contiguous segments of it. For each segment, imagine trying to sort it into increasing order.

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

CF 2139B - Cake Collection

Maple has multiple ovens, each producing cakes at a fixed rate per second. She can collect all the cakes from one oven at the end of each second, and she can teleport to any oven, including the one she is already at.

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

CF 2139C - Cake Assignment

The solution correctly interprets the problem. A "gap of length $r$" is the number of consecutive $U$’s falling outside $[alpha, beta)$ before the next $U$ falls inside that interval.

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

CF 2139A - Maple and Multiplication

We are asked to make two positive integers equal using a series of multiplication operations. Maple can choose either number and multiply it by any positive integer of her choice. The goal is to do this in the minimum number of operations.