Good Bye 2024: 2025 is NEAR

10 problems from Good Bye 2024: 2025 is NEAR (contest 2053), difficulty 800-3500. 3/10 solutions verified against sample I/O.

10 items

Good Bye 2024: 2025 is NEAR

Special | 10 problems | 3/10 verified | Difficulty 800-3500 | 21m 39s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Tender Carpenter	800	dp, geometry, greedy	21,259	3m 10s	✓
B	Outstanding Impressionist	1200	binary-search, brute-force, data-structures	16,971	1m 45s
C	Bewitching Stargazer	1500	bitmasks, divide-and-conquer, dp	12,330	1m 54s
D	Refined Product Optimality	1700	binary-search, data-structures, greedy	7,684	2m 11s
E	Resourceful Caterpillar Sequence	1900	dfs-and-similar, dp, games	4,513	1m 48s
F	Earnest Matrix Complement	2600	brute-force, data-structures, dp	947	1m 20s	✓
G	Naive String Splits	3400	binary-search, brute-force, greedy	226	2m 11s	✓
H	Delicate Anti-monotonous Operations	3500	constructive-algorithms, implementation	76	2m 6s
I1	Affectionate Arrays (Easy Version)	2800	data-structures, dp, greedy	557	3m 40s
I2	Affectionate Arrays (Hard Version)	3500	data-structures, dp, graphs	107	1m 34s

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053I1 - Affectionate Arrays (Easy Version)

We are given an integer array a and asked to create a new array b which contains a as a subsequence, has the same total sum as a, and minimizes the maximum subarray sum - the so-called boredom.

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053I2 - Affectionate Arrays (Hard Version)

We are given an initial integer sequence $a$. We are allowed to construct longer sequences $b$ under two global constraints: the sequence $a$ must appear inside $b$ as a subsequence, and the total sum of elements in $b$ must equal the total sum of $a$.

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053H - Delicate Anti-monotonous Operations

We are given a sequence of integers, each between 1 and a maximum value $w$. The sequence can contain repeated numbers, but we are allowed to perform a special operation any number of times: select two consecutive elements that are equal and change both to any two numbers we…

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053G - Naive String Splits

We are given two strings for each test case: a string s of length n and a string t of length m. The task is to examine all ways to split s into a prefix x and a suffix y at positions 1 through n-1, and for each split, determine whether the string t can be written as a…

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053F - Earnest Matrix Complement

For a row $i$, let: - $zi$ = number of -1 cells in that row. - $cnti(u)$ = number of already fixed occurrences of value $u$. Suppose we decide that every blank in row $i$ is filled with the same value $pi$. This is not a restriction.

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053D - Refined Product Optimality

We are given two arrays, a and b, each of length n. The task is to compute the maximum product $$P = prod{i=1}^{n} min(ai, bi)$$ after any rearrangement of b.

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053E - Resourceful Caterpillar Sequence

We are given a tree. Two endpoints are chosen, a head $p$ and a tail $q$, and the only vertices that matter are those on the unique path between them. The game is a two-player process where Nora controls the head side and Aron controls the tail side.

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053A - Tender Carpenter

The problem presents an array of integers representing stick lengths. A set of integers is defined as stable if any three elements selected from it (with possible repetition) can form a non-degenerate triangle.

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053C - Bewitching Stargazer

We are asked to simulate the process of Iris observing stars with a lazy, recursive strategy. She starts with all stars in a single segment and repeatedly targets the middle star of any odd-length segment, adding its 1-based index to her "lucky value".

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053B - Outstanding Impressionist

We are given a sequence of impressions, where each impression is represented by a range of possible integer values. Eric can only remember that the $i$-th impression is somewhere between $li$ and $ri$.