Codeforces Round 957 (Div. 3)

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

7 items

Codeforces Round 957 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 2/7 | Rating range: 800-2000 | Time: 20m 49s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Only Pluses	800	brute-force, constructive-algorithms, greedy	1m 5s	✓
B	Angry Monk	800	greedy, math, sortings	2m 27s	✗
C	Gorilla and Permutation	900	constructive-algorithms, math	7m 57s	✗
D	Test of Love	1200	dp, greedy, implementation	1m 18s	✓
E	Novice's Mistake	1700	brute-force, constructive-algorithms, implementation	2m 23s	✗
F	Valuable Cards	1900	brute-force, dp, greedy	3m 7s	✗
G	Ultra-Meow	2000	combinatorics, dp, math	2m 32s	✗

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

CF 1992C - Gorilla and Permutation

We are asked to construct a permutation of numbers from 1 to $n$ such that a certain expression is maximized. The expression is the sum of all prefix sums of "large" numbers (greater than or equal to $k$) minus the sum of all prefix sums of "small" numbers (less than or equal…

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

CF 1992G - Ultra-Meow

We are given an array a of length n containing integers from 1 to n, possibly in any order and possibly repeated.

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

CF 1992F - Valuable Cards

We are given a sequence of n cards, each with an integer price, and a target integer x. None of the cards are equal to x. A segment of consecutive cards is considered bad if it is impossible to pick a subset of cards within that segment whose product equals x.

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

CF 1992E - Novice's Mistake

The task describes a very small “birthday arithmetic” model, but the twist is that the computation is not performed numerically in the usual way. Instead, the intermediate value is treated as a string, which completely changes how subtraction behaves.

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

CF 1992B - Angry Monk

We are asked to compute the minimum number of operations required to merge a pre-cut potato casserole back into a single piece. The casserole has total length n and was cut into k pieces of lengths a1 through ak. Two operations are allowed.

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

CF 1992D - Test of Love

We are given a river that behaves like a linear board of n cells. Each cell is either safe ground in the form of a log, dangerous water, or an instant-failure crocodile tile. The goal is to move from the left bank before the first cell to the right bank after the last cell.

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

CF 1992A - Only Pluses

We are given three small integers that represent the initial sizes of three factors contributing to a product. The final quantity we care about is the product of these three numbers, and we are allowed to improve it by performing at most five operations.