Codeforces Round 860 (Div. 2)

Solutions for Codeforces Round 860 (Div. 2) (contest 1798). 2/6 problems verified against sample I/O. Difficulty range: 800-2500.

6 items

Codeforces Round 860 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2500 | Time: 15m 18s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Showstopper	800	greedy, implementation, sortings	1m 49s	✓
B	Three Sevens	1000	brute-force, data-structures, greedy	1m 55s	✗
C	Candy Store	1700	greedy, math, number-theory	4m 32s	✓
D	Shocking Arrangement	1600	constructive-algorithms, greedy, math	3m 50s	✗
E	Multitest Generator	2300	brute-force, dp	1m 44s	✗
F	Gifts from Grandfather Ahmed	2500	dp, math, number-theory	1m 28s	✗

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

CF 1798D - Shocking Arrangement

We are given an array of integers whose sum is zero. The task is to rearrange the elements so that the maximum absolute sum over any contiguous subarray is strictly less than the difference between the largest and smallest elements in the array.

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

CF 1798F - Gifts from Grandfather Ahmed

We are given a collection of gift boxes, each box containing some positive number of gifts. There are $n$ existing boxes, and we must add exactly one additional box with an integer number of gifts between 1 and $10^6$. After that, we will have $n+1$ boxes in total.

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

CF 1798C - Candy Store

Each candy type has two numbers attached to it. There are $ai$ candies of that type in stock, and each candy costs $bi$ coins. For every type, we must choose a pack size $di$.

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

CF 1798E - Multitest Generator

We are given an array, and we look at every suffix starting from position i. For each suffix, we are allowed to change some elements arbitrarily to non-negative integers.

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

CF 1798B - Three Sevens

We are given a sequence of days. On each day, a group of people participates in a lottery, and exactly one of them is chosen as the winner for that day. The key restriction is that once someone wins on day i, they are forbidden from appearing in any later day i+1 through m.

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

CF 1798A - Showstopper

We are given two arrays of equal length, which we can think of as parallel sequences of tiles. Each tile has two numbers: one on the "a" side and one on the "b" side. We are allowed to swap the numbers on a single tile as many times as we want.