Codeforces Round 826 (Div. 3)

Solutions for Codeforces Round 826 (Div. 3) (contest 1741). 2/7 problems verified against sample I/O. Difficulty range: 800-2200.

7 items

Codeforces Round 826 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 2/7 | Rating range: 800-2200 | Time: 29m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Compare T-Shirt Sizes	800	implementation, strings	2m 39s	✓
B	Funny Permutation	800	constructive-algorithms, math	5m 4s	✗
C	Minimize the Thickness	1100	brute-force, greedy, math	2m 39s	✗
D	Masha and a Beautiful Tree	1300	dfs-and-similar, divide-and-conquer, graphs	3m 1s	✓
E	Sending a Sequence Over the Network	1600	dp	2m 51s	✗
F	Multi-Colored Segments	2000	binary-search, data-structures, math	10m 20s	✗
G	Kirill and Company	2200	bitmasks, brute-force, dfs-and-similar	2m 33s	✗

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

CF 1741F - Multi-Colored Segments

We are given a collection of line segments on a number line, where each segment has a color. For each segment, we want to find the distance to the closest segment of a different color.

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

CF 1741G - Kirill and Company

We are given an undirected connected graph where all people start at vertex 1. Each friend has a destination vertex they must eventually reach. Among these friends, some subset of size at most 6 are “special” in the sense that they have no car. Everyone else may have a car.

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

CF 1741D - Masha and a Beautiful Tree

The structure is a perfect binary tree whose leaves correspond to the positions of an array of size $m = 2^n$. Each leaf initially contains one value from a permutation.

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

CF 1741E - Sending a Sequence Over the Network

We are asked to check if a given sequence $b$ could have been sent over the network from some original sequence $a$ by a specific encoding procedure.

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

CF 1741B - Funny Permutation

We are asked to construct a permutation of numbers from $1$ to $n$ such that two constraints are satisfied simultaneously. First, every value must sit next to at least one neighbor whose value differs from it by exactly one.

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

CF 1741A - Compare T-Shirt Sizes

We are asked to compare two T-shirt sizes represented as strings. Each string ends with one of three letters: S for small, M for medium, or L for large. In addition, there may be a sequence of Xs before an S or L, indicating extra-small or extra-large.

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

CF 1741C - Minimize the Thickness

We are given an array of positive integers and asked to partition it into consecutive segments such that all segments have the same sum. Each segment must be contiguous, and each element belongs to exactly one segment.