Codeforces Round 1037 (Div. 3)

8 problems from Codeforces Round 1037 (Div. 3) (contest 2126), difficulty 800-2400. 5/8 solutions verified against sample I/O.

8 items

Codeforces Round 1037 (Div. 3)

Div. 3 | 8 problems | 5/8 verified | Difficulty 800-2400 | 9m 25s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Only One Digit	800	brute-force, implementation, math	51,041	1m 10s	✓
B	No Casino in the Mountains	800	dp, greedy	37,669	1m 29s	✓
C	I Will Definitely Make It			26,263
D	This Is the Last Time	1200	data-structures, greedy, sortings	23,987	1m 18s	✓
E	G-C-D, Unlucky!	1400	math, number-theory	17,003	1m 18s	✓
F	1-1-1, Free Tree!	2000	brute-force, data-structures, dfs-and-similar	4,298	1m 17s	✓
G1	Big Wins! (easy version)	2200	binary-search, data-structures, dp	2,480	1m 30s
G2	Big Wins! (hard version)	2400	binary-search, data-structures, divide-and-conquer	1,160	1m 23s

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126G2 - Big Wins! (hard version)

We are given an array of integers, each between 1 and $n$, and we need to choose a contiguous subarray that maximizes the difference between its median and its minimum element.

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126G1 - Big Wins! (easy version)

We are asked to find, for each array, a contiguous segment whose median minus its minimum is as large as possible. Formally, for a subarray $a[l, r]$, we calculate the median of its elements after sorting, then subtract the smallest element in that segment.

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126F - 1-1-1, Free Tree!

We are given a tree where every vertex has a color and every edge has a weight. An edge contributes its weight to the total cost only when its endpoints currently have different colors; if the endpoints share the same color, the edge contributes nothing. The process is dynamic.

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126E - G-C-D, Unlucky!

We are given two arrays of integers, p and s, each of length n. Array p represents the prefix GCDs of some unknown array a, and array s represents the suffix GCDs of the same array. The task is to decide whether such an array a exists.

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126D - This Is the Last Time

We are given a sequence of casinos, each defined by a range of coins [li, ri] that we must have to play, and a fixed result reali that becomes our new coin count after playing there. We start with k coins and can visit casinos in any order, but only once each.

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126B - No Casino in the Mountains

We are given a sequence of days, each labeled either as rainy (1) or good (0). Jean wants to complete as many hikes as possible. Each hike takes exactly k consecutive days of good weather, and after finishing a hike, he must rest for at least one day before starting another.

Practice › Codeforces Solutions › Codeforces Round 1037 (Div. 3) ›

CF 2126A - Only One Digit

The task asks us to find the smallest non-negative integer that shares at least one decimal digit with a given number. For every test case, we are provided a number x, and we need to produce a number y such that some digit in y also appears in x.