Codeforces Round 538 (Div. 2)

Solutions for Codeforces Round 538 (Div. 2) (contest 1114). 3/6 problems verified against sample I/O. Difficulty range: 800-2400.

6 items

Codeforces Round 538 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2400 | Time: 12m 30s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Got Any Grapes?	800	brute-force, greedy, implementation	5m 24s	✗
B	Yet Another Array Partitioning Task	1500	constructive-algorithms, greedy, sortings	1m 52s	✓
C	Trailing Loves (or L'oeufs?)	1700	brute-force, implementation, math	1m 4s	✓
D	Flood Fill	1900	dp	1m 27s	✗
E	Arithmetic Progression	2200	binary-search, interactive, number-theory	1m 36s	✗
F	Please, another Queries on Array?	2400	bitmasks, data-structures, divide-and-conquer	1m 7s	✓

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

CF 1114A - Got Any Grapes?

We have three people with different grape preferences and three piles of grapes. Andrew wants exactly the first type of grape, green grapes. If he needs x grapes, all of them must come from the green pile. Dmitry dislikes black grapes. He can eat green or purple grapes.

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

CF 1114F - Please, another Queries on Array?

We have an array of integers, each between 1 and 300, and we need to process two types of queries. The first query multiplies a contiguous segment of the array by a given number.

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

CF 1114E - Arithmetic Progression

We are given a hidden array of size $n$, but the array is not directly accessible and is permuted arbitrarily. The only structural guarantee is that if we sort its elements, they form a perfect arithmetic progression with a strictly positive common difference.

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

CF 1114D - Flood Fill

We are given a row of n colored squares, each labeled with an integer representing its color. The goal is to recolor the entire row into a single color using a series of "flood fill" operations.

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

CF 1114B - Yet Another Array Partitioning Task

We are given a sequence of integers a of length n, and two parameters: m, the number of largest elements we consider when computing the "beauty" of a subarray, and k, the number of contiguous subarrays we must partition a into.

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

CF 1114C - Trailing Loves (or L'oeufs?)

We are asked to compute the number of trailing zeros in the factorial of a number when represented in an arbitrary base. More precisely, given integers $n$ and $b$, we want the number of digits equal to zero at the end of the base-$b$ representation of $n!$.