Codeforces Round 852 (Div. 2)

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

6 items

Codeforces Round 852 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Yet Another Promotion	800	greedy, math	3m 37s	✓
B	Fedya and Array	1100	constructive-algorithms, math	2m 36s	✗
C	Dora and Search	1200	constructive-algorithms, data-structures, two-pointers	2m 19s	✗
D	Moscow Gorillas	1800	binary-search, dp, greedy	2m 27s	✗
E	Velepin and Marketing	2600	binary-search, data-structures, dp	2m 18s	✗
F	Rebrending	2600	brute-force, data-structures, divide-and-conquer	1m 59s	✗

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

CF 1793F - Rebrending

We are given a lineup of candidates for a band, each with a unique height. Over several days, the organizers choose a contiguous segment of candidates and want to select two whose heights are as close as possible.

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

CF 1793E - Velepin and Marketing

We have a set of regular readers, each with a personal threshold of satisfaction: a reader is happy if at least a certain number of people read the same book as them.

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

CF 1793D - Moscow Gorillas

We are given two permutations of the same set of numbers from 1 to n. Think of them as two different orderings of the same objects placed on a line.

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

CF 1793A - Yet Another Promotion

You need at least n kilograms of potatoes. The store is open on two different days. On the first day, each kilogram costs a, and there is a promotion: every time you pay for m kilograms, you receive one extra kilogram for free.

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

CF 1793B - Fedya and Array

We are asked to reconstruct a circular array of integers such that the difference between any two neighboring elements is exactly one. Fedya remembers only the sum of all local maxima and the sum of all local minima in this array.

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

CF 1793C - Dora and Search

We are given a permutation of integers from 1 to n. Our task is to find a contiguous subsegment where the first and last elements are neither the minimum nor the maximum of that subsegment. If no such subsegment exists, we must output -1.