Codeforces Round 965 (Div. 2)

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

6 items

Codeforces Round 965 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2500 | Time: 19m 10s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Find K Distinct Points with Fixed Center	800	constructive-algorithms, implementation, math	2m 22s	✗
B	Minimize Equal Sum Subarrays	1000	constructive-algorithms, math, number-theory	2m 30s	✗
C	Perform Operations to Maximize Score	1900	binary-search, brute-force, constructive-algorithms	3m 41s	✗
D	Determine Winning Islands in Race	2100	data-structures, dp, graphs	4m 44s	✓
E1	Eliminating Balls With Merging (Easy Version)	2200	binary-search, brute-force, data-structures	2m 40s	✗
E2	Eliminating Balls With Merging (Hard Version)	2500	binary-search, brute-force, data-structures	3m 13s	✗

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

CF 1998D - Determine Winning Islands in Race

We have a directed acyclic graph on islands 1...n. The graph always contains the chain 1 - 2 - 3 - ... - n and additionally contains m extra directed edges (u, v) with u < v. Bessie can only move along the chain edges. Elsie can move along both chain and extra edges.

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

CF 1998E2 - Eliminating Balls With Merging (Hard Version)

We are given a sequence of balls numbered from 1 to $n$, each labeled with a positive integer. For each prefix of length $i$ ($1 le i le n$), we want to determine how many positions $j$ can survive as the last remaining ball if we repeatedly merge pairs of neighboring balls…

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

CF 1998E1 - Eliminating Balls With Merging (Easy Version)

We are given a row of $n$ balls, each with an integer written on it. The operation we can perform repeatedly involves selecting two adjacent values in the set $S$ and merging them according to their relative sizes.

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

CF 1998C - Perform Operations to Maximize Score

We are given an array of integers a and a parallel binary array b. The array b indicates which positions in a can be incremented. Each increment operation increases a chosen a[i] by 1, and we can perform at most k operations in total.

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

CF 1998B - Minimize Equal Sum Subarrays

We are given a permutation p of length n. We must construct another permutation q of the same length. For every subarray [i, j], we can compare the sum of that segment in p with the sum of the corresponding segment in q.

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

CF 1998A - Find K Distinct Points with Fixed Center

We are given a target center point $(xc, yc)$ and an integer $k$. The task is not to optimize anything or search for a special configuration. We simply need to construct exactly $k$ distinct integer-coordinate points whose arithmetic mean is exactly $(xc, yc)$.