Codeforces Round 726 (Div. 2)

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

7 items

Codeforces Round 726 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Arithmetic Array	800	greedy, math	2m 26s	✓
B	Bad Boy	900	constructive-algorithms, greedy, math	22m 55s	✗
C	Challenging Cliffs	1200	constructive-algorithms, greedy, implementation	8m 10s	✗
D	Deleting Divisors	1700	games, math, number-theory	2m 30s	✗
E1	Erase and Extend (Easy Version)	1600	binary-search, brute-force, dp	7m 36s	✓
E2	Erase and Extend (Hard Version)	2200	binary-search, data-structures, greedy	4m 39s	✗
F	Figure Fixing	2200	constructive-algorithms, dfs-and-similar, dsu	2m 28s	✓

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

CF 1537B - Bad Boy

We are asked to place two yo-yos in a rectangular room to maximize the total Manhattan distance Anton must travel to pick them both up and return to his starting position. The room is an $n times m$ grid, and Anton starts at cell $(i, j)$.

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

CF 1537F - Figure Fixing

We are given a connected undirected graph where each node has an initial value and a target value. We can pick any edge and add the same integer to both endpoints.

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

CF 1537E2 - Erase and Extend (Hard Version)

Codeforces 1537E2: Erase and Extend (Hard Version)

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

CF 1537E1 - Erase and Extend (Easy Version)

We are given a string s of length n and a target length k. Our goal is to construct a string of length exactly k by performing two operations any number of times: removing the last character of the current string, or duplicating the string by concatenating it with itself.

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

CF 1537C - Challenging Cliffs

We are given a multiset of mountain heights and must arrange them into a sequence. The optimization happens in two layers. First, among all possible permutations, we want the first and last heights to be as close as possible.

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

CF 1537D - Deleting Divisors

We start with a positive integer $n$. Two players alternate turns, with Alice moving first. On each turn, the current player chooses a proper divisor of the current number, meaning a divisor that is neither $1$ nor the number itself, and subtracts it from the number.

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

CF 1537A - Arithmetic Array

We are given an integer array, and our task is to make its arithmetic mean equal to one by appending non-negative integers. Each test case presents an array of arbitrary integers, both positive and negative, and asks for the minimal number of additions needed.