Codeforces Round 961 (Div. 2)

Solutions for Codeforces Round 961 (Div. 2) (contest 1995). 3/7 problems verified against sample I/O. Difficulty range: 800-2900.

7 items

Codeforces Round 961 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 800-2900 | Time: 18m 8s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Diagonals	800	brute-force, greedy, implementation	1m 14s	✓
B1	Bouquet (Easy Version)	1100	binary-search, brute-force, greedy	2m 19s	✓
B2	Bouquet (Hard Version)	1700	binary-search, data-structures, greedy	2m 14s	✗
C	Squaring	1800	brute-force, constructive-algorithms, greedy	2m 24s	✗
D	Cases	2300	bitmasks, brute-force, dp	3m 15s	✓
E1	Let Me Teach You a Lesson (Easy Version)	2700	2-sat, data-structures, dp	2m 39s	✗
E2	Let Me Teach You a Lesson (Hard Version)	2900	data-structures, dp, matrices	4m 3s	✗

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

CF 1995E2 - Let Me Teach You a Lesson (Hard Version)

We have $2n$ knights sitting at $n$ desks arranged in a circle. Each desk has exactly two knights, the first at position $2i-1$ and the second at $2i$. Each knight has an integer intelligence value.

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

CF 1995D - Cases

We are given a string of uppercase letters representing a text in an ancient language. The language uses only the first $c$ letters of the Latin alphabet, and each word in the language has a “case” determined solely by its last letter. Words can have lengths up to $k$.

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

CF 1995E1 - Let Me Teach You a Lesson (Easy Version)

We have 2n knights arranged around a circle. Desk i contains knights (2i-1, 2i), so every desk contributes a sum of two intelligence values. The only operation allowed is swapping opposite positions in the circle.

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

CF 1995C - Squaring

We are given several independent arrays, and for each one we are allowed to modify elements using a very specific operation: pick an index and replace the value at that position with its square. We may repeat this operation on the same index multiple times.

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

CF 1995B1 - Bouquet (Easy Version)

Each flower has two properties that are actually the same number: its petal count and its price. A flower with k petals costs exactly k coins. We may buy any subset of the flowers available in the store.

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

CF 1995B2 - Bouquet (Hard Version)

We are given several independent scenarios. In each scenario, there are different flower types, each type having a petal value and a limited supply. Every flower costs exactly its petal value in coins, and we have a fixed budget. We want to build a bouquet under two restrictions.

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

CF 1995A - Diagonals

We are working on an $n times n$ grid where each cell belongs to exactly one diagonal if we group cells by the value $i + j$. Every such value defines a diagonal that runs from the top edge toward the right or bottom edge depending on where it sits in the square.