Codeforces Round 814 (Div. 1)

7 problems from Codeforces Round 814 (Div. 1) (contest 1718), difficulty 1800-3500. 2/7 solutions verified against sample I/O.

7 items

Codeforces Round 814 (Div. 1)

Div. 1 | 7 problems | 2/7 verified | Difficulty 1800-3500 | 24m 45s

#	Problem	Rating	Tags	Accepted	Time	✓
A1	Burenka and Traditions (easy version)	1800	dp, greedy	6,416	2m 28s
A2	Burenka and Traditions (hard version)	1900	data-structures, dp, greedy	5,909	2m 28s
B	Fibonacci Strings	2000	greedy, implementation, math	3,465	1m 49s	✓
C	Tonya and Burenka-179	2400	data-structures, greedy, math	1,858	3m 13s
D	Permutation for Burenka	3300	data-structures, graph-matchings, greedy	418	5m 20s
E	Impressionism	3500	constructive-algorithms, graphs, implementation	177	5m 14s
F	Burenka, an Array and Queries	3300	data-structures, math, number-theory	217	4m 13s	✓

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718D - Permutation for Burenka

We are given a permutation p of size n, which acts as a reference order. Alongside it, we have an array a of the same size where some positions are already filled with numbers and exactly k positions are missing (marked as zero).

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718E - Impressionism

We are given two rectangular grids of the same size, and each grid contains colored cells. The only allowed operations are swapping entire rows or swapping entire columns.

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718F - Burenka, an Array and Queries

We are given an array where each element is a small positive integer, and we are asked to answer many independent range queries. Each query selects a contiguous subarray and conceptually multiplies all values inside it into a single large number.

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718C - Tonya and Burenka-179

We are given a circular array, and we repeatedly simulate a very specific traversal rule. We choose a starting position s and a fixed jump length k. Starting from s, we walk exactly n steps.

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718A1 - Burenka and Traditions (easy version)

We are given several independent test cases. In each one, an array of integers is provided, and the goal is to turn every element into zero using a special operation.

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718A2 - Burenka and Traditions (hard version)

We are given an array of integers, and the goal is to transform every element into zero using a special range operation. Each operation lets us choose a contiguous segment and XOR every element in that segment with the same value.

Practice › Codeforces Solutions › Codeforces Round 814 (Div. 1) ›

CF 1718B - Fibonacci Strings

We are not given the string itself. Instead, for each letter of the alphabet we know how many times it appears. A Fibonacci string is built from consecutive blocks of equal characters. The lengths of those blocks must be 1, 1, 2, 3, 5, 8, ...