Codeforces Round 910 (Div. 2)

Solutions for Codeforces Round 910 (Div. 2) (contest 1898). 2/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 910 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2600 | Time: 16m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Milica and String	800	brute-force, implementation, strings	2m 39s	✗
B	Milena and Admirer	1500	greedy, math	2m 14s	✓
C	Colorful Grid	1700	constructive-algorithms	3m 12s	✗
D	Absolute Beauty	1900	greedy, math	2m 13s	✓
E	Sofia and Strings	2200	data-structures, greedy, sortings	2m 5s	✗
F	Vova Escapes the Matrix	2600	brute-force, dfs-and-similar, divide-and-conquer	4m 33s	✗

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

CF 1898F - Vova Escapes the Matrix

We are given an $n times m$ grid representing a room where Vova is trapped. Each cell is either empty, blocked, or contains Vova. He can move to any empty cell sharing a side, and he can escape if he reaches an empty cell on the boundary of the grid.

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

CF 1898E - Sofia and Strings

We are given two strings, s and t. The task is to determine whether it is possible to transform s into t using two operations: removing any character from s or sorting any substring of s alphabetically.

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

CF 1898C - Colorful Grid

We are asked to color the segments of a rectangular grid, formed by $n$ horizontal lines and $m$ vertical lines, using two colors, red and blue. Each segment connects two adjacent points either horizontally or vertically.

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

CF 1898A - Milica and String

We are given a string consisting only of the characters A and B. The goal is to transform this string so that it contains exactly k occurrences of B.

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

CF 1898B - Milena and Admirer

We start with an array of positive integers. The only allowed operation is to pick one element and split it into two positive parts whose sum equals the original value. Each split increases the array length by one.