Codeforces Round 1046 (Div. 2)

Solutions for Codeforces Round 1046 (Div. 2) (contest 2136). 2/7 problems verified against sample I/O. Difficulty range: 800-2500.

7 items

Codeforces Round 1046 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	In the Dream	800	greedy, math	1m 28s	✓
B	Like the Bitset	900	constructive-algorithms, greedy, two-pointers	1m 25s	✗
C	Against the Difference	1200	data-structures, dp	1m 22s	✓
D	For the Champion	1700	constructive-algorithms, interactive, math	2m 4s	✗
E	By the Assignment	2000	dfs-and-similar, dsu, graphs	1m 46s	✗
F1	From the Unknown (Easy Version)	2100	constructive-algorithms, interactive	1m 28s	✗
F2	From the Unknown (Hard Version)	2500	constructive-algorithms, interactive, math	1m 26s	✗

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

CF 2136F2 - From the Unknown (Hard Version)

We are interacting with a text editor whose behavior depends on a hidden parameter $W$, the width of a line. An article is a sequence of word lengths, and the editor lays words into lines greedily: it fills the current line until the next word would overflow $W$, then starts a…

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

CF 2136E - By the Assignment

We are given an undirected connected graph where each vertex carries an integer label. Some labels are fixed, while others are unknown and must be chosen from the range $0$ to $V-1$. For any simple path, we define its value as the XOR of all vertex labels along that path.

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

CF 2136F1 - From the Unknown (Easy Version)

We are given an interactive editor that wraps words into lines based on a hidden width parameter $W$. Each article is represented as a sequence of word lengths.

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

CF 2136D - For the Champion

Let $p = beta - alpha$ be the probability that a single $Uj$ lies in the interval $[alpha, beta)$, as in equation (4). A gap of length $r$ occurs when $r$ consecutive $U$'s fall outside $[alpha, beta)$, followed by a $U$ inside the interval.

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

CF 2136B - Like the Bitset

We are asked to construct a permutation of length $n$ that satisfies a positional maximum constraint determined by a binary string $s$ and an integer $k$.

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

CF 2136C - Against the Difference

We are given an array of integers, and our goal is to extract the longest possible subsequence that is "neat." A neat subsequence is made by concatenating one or more blocks, where a block is a sequence of identical numbers, and the value of the number equals the length of the…

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

CF 2136A - In the Dream

We know the score at halftime and the score at full time. If the halftime score is a:b, then during the first half the RiOI team scored exactly a goals and the KDOI team scored exactly b goals.