Codeforces Round 555 (Div. 3)

Solutions for Codeforces Round 555 (Div. 3) (contest 1157). 6/8 problems verified against sample I/O. Difficulty range: 1100-2200.

8 items

Codeforces Round 555 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 6/8 | Rating range: 1100-2200 | Time: 14m 10s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Reachable Numbers	1100	implementation	1m 28s	✓
B	Long Number	1300	greedy	1m 25s	✓
C1	Increasing Subsequence (easy version)	1300	greedy	1m 23s	✓
C2	Increasing Subsequence (hard version)	1700	greedy	3m 6s	✓
D	N Problems During K Days	1900	constructive-algorithms, greedy, math	1m 45s	✗
E	Minimum Array	1700	binary-search, data-structures, greedy	1m 31s	✓
F	Maximum Balanced Circle	2000	constructive-algorithms, dp, greedy	1m 51s	✗
G	Inverse of Rows and Columns	2200	brute-force, constructive-algorithms	1m 41s	✓

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

CF 1157F - Maximum Balanced Circle

We are given a multiset of integers representing heights of people standing in a line. From these people, we must choose a subset and then reorder the chosen elements into a circular arrangement.

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

CF 1157G - Inverse of Rows and Columns

We are given an $n times m$ matrix containing only zeros and ones. We may flip any row and any column any number of times. Flipping means replacing every value in that row or column by its opposite. After all chosen flips are applied, the matrix is read in row-major order.

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

CF 1157C2 - Increasing Subsequence (hard version)

We are given a sequence of integers and must construct the longest possible strictly increasing sequence by repeatedly taking either the leftmost or the rightmost element. Each time we take a number, it is appended to our growing sequence and removed from the original sequence.

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

CF 1157D - N Problems During K Days

We need to distribute exactly n solved problems across k consecutive days. Let a[i] be the number of problems solved on day i. Every day must contain at least one problem.

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

CF 1157E - Minimum Array

We are given two arrays a and b, each of length n, containing integers from 0 to n-1. We can reorder b arbitrarily. After choosing an order for b, we construct a new array c where each element is (ai + bi) % n.

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

CF 1157A - Reachable Numbers

We are asked to explore numbers generated by repeatedly applying a particular transformation function. For a number $x$, we first add one to it. If the resulting number has trailing zeros, we remove them all until none remain. This defines the function $f(x)$.

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

CF 1157B - Long Number

We are given a number as a string of digits from 1 to 9 and a mapping f from each digit to another digit in the same range. The task is to maximize the resulting number by selecting at most one contiguous segment of digits and replacing each digit x in that segment with f(x).

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

CF 1157C1 - Increasing Subsequence (easy version)

We are given a permutation of size $n$. Think of it as a row of cards where every value from 1 to $n$ appears exactly once. At each move, we are only allowed to remove a card from either the far left or far right end of the current row, and we record the removed value.