Codeforces Round 1058 (Div. 2)

Solutions for Codeforces Round 1058 (Div. 2) (contest 2160). 3/8 problems verified against sample I/O. Difficulty range: 800-3200.

8 items

Codeforces Round 1058 (Div. 2)

Type: Div. 2 | Problems: 8 | Verified: 3/8 | Rating range: 800-3200 | Time: 15m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
A	MEX Partition	800	math	2m 57s	✓
B	Distinct Elements	1100	greedy, math	2m 6s	✗
C	Reverse XOR	1300	bitmasks	1m 30s	✗
D	MAD Interactive Problem	1700	constructive-algorithms, greedy, interactive	1m 36s	✗
E	Rectangles	2100	brute-force, dp, greedy	1m 8s	✓
F	Twin Polynomials	2300	combinatorics, dp, graphs	1m 31s	✗
G1	Inverse Minimum Partition (Easy Version)	2500	binary-search, data-structures, dp	1m 42s	✓
G2	Inverse Minimum Partition (Hard Version)	3200	data-structures, dp, greedy	2m 54s	✗

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

CF 2160G2 - Inverse Minimum Partition (Hard Version)

We are given an array of positive integers. For every subarray, we first define a function $f$ that depends on how we optimally split that subarray into consecutive pieces.

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

CF 2160F - Twin Polynomials

We are given a polynomial $f(x) = a0 + a1 x + dots + an x^n$, where each coefficient is a non-negative integer and the leading coefficient $an$ is positive. Some coefficients are fixed, others are unknown.

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

CF 2160E - Rectangles

We are given a binary grid of size $n times m$, where each cell contains either 0 or 1. A rectangle in this context is defined not by the usual continuous blocks of 1s, but by the four corner cells: a rectangle $(u,d,l,r)$ exists if and only if the top-left, top-right…

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

CF 2160B - Distinct Elements

The solution correctly identifies the modified middle-square sequence as a special case of a quadratic congruential sequence modulo $2^e$.

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

CF 2160D - MAD Interactive Problem

We are given a hidden array of length $2n$. Every number from $1$ to $n$ appears exactly twice, but their order is unknown. We cannot see the array directly.

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

CF 2160C - Reverse XOR

We are given a target integer $n$, and we want to know whether it is possible to construct some positive integer $x$ such that a specific transformation applied to $x$ and combined with XOR produces exactly $n$.

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

CF 2160A - MEX Partition

We are given a multiset of integers, and we are allowed to split it into several smaller multisets such that every original element is used exactly the same number of times overall. In other words, we are partitioning occurrences of numbers into groups.