Codeforces Round 531 (Div. 3)

Solutions for Codeforces Round 531 (Div. 3) (contest 1102). 3/6 problems verified against sample I/O. Difficulty range: 800-2000.

6 items

Codeforces Round 531 (Div. 3)

Type: Div. 3 | Problems: 6 | Verified: 3/6 | Rating range: 800-2000 | Time: 26m 9s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Integer Sequence Dividing	800	math	1m 12s	✓
B	Array K-Coloring	1400	greedy, sortings	7m 32s	✗
C	Doors Breaking and Repairing	1200	games	5m 1s	✓
D	Balanced Ternary String	1500	greedy, strings	5m 57s	✗
E	Monotonic Renumeration	1700	combinatorics, sortings	5m 21s	✗
F	Elongated Matrix	2000	binary-search, bitmasks, brute-force	1m 6s	✓

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

CF 1102E - Monotonic Renumeration

We are given a sequence of integers, and we want to assign another sequence of integers of the same length, starting from zero, with very specific structure rules.

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

CF 1102B - Array K-Coloring

We are given a sequence of integers and asked to assign each position one of k labels, which we will call colors. Every position must receive exactly one color. At the same time, every color from 1 to k must appear at least once among all positions.

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

CF 1102D - Balanced Ternary String

We are given a string of length $n$, where each position holds one of three symbols: 0, 1, or 2. We are allowed to modify characters, but each modification counts as a replacement cost of 1 per position changed.

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

CF 1102C - Doors Breaking and Repairing

We are given a collection of doors, each with an initial durability value. You and an opponent alternate moves for an extremely large number of turns, so the process effectively runs until both players’ optimal strategies stabilize.

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

CF 1102F - Elongated Matrix

We have a rectangular grid of numbers with $n$ rows and $m$ columns. We are allowed to reorder the rows however we like, but the order of numbers within each row is fixed.

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

CF 1102A - Integer Sequence Dividing

We are given the sequence of integers from 1 to $n$. The task is to divide this sequence into two disjoint sets $A$ and $B$ so that the absolute difference between their sums, $ Since $n$ can be as large as $2 cdot 10^9$, explicitly constructing the sequence or trying all…