Codeforces Round 895 (Div. 3)

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

7 items

Codeforces Round 895 (Div. 3)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Two Vessels	800	brute-force, greedy, math	1m 13s	✓
B	The Corridor or There and Back Again	900	greedy, implementation	4m 3s	✗
C	Non-coprime Split	1100	math, number-theory	1m 42s	✗
D	Plus Minus Permutation	1200	math	1m 8s	✓
E	Data Structures Fan	1500	binary-search, bitmasks, data-structures	1m 42s	✗
F	Selling a Menagerie	1800	dfs-and-similar, dsu, graphs	2m 5s	✗
G	Replace With Product	2000	brute-force, greedy, math	1m 36s	✗

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

CF 1872G - Replace With Product

We are given a sequence of positive integers and we are allowed to perform exactly one transformation: pick a contiguous segment, compress it into a single number equal to the product of all elements in that segment, and replace the segment with that single value.

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

CF 1872F - Selling a Menagerie

We are given a set of animals, each with a cost and a "fear" relationship: every animal fears exactly one other animal, and no animal fears itself. When selling an animal, the money earned depends on whether the animal it fears has already been sold.

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

CF 1872B - The Corridor or There and Back Again

We are standing at room 1 of a one-dimensional corridor and want to go forward to some room k and then return back to room 1. Time increases by exactly one per step, so reaching room x for the first time takes x−1 seconds, and returning follows the same speed.

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

CF 1872E - Data Structures Fan

We are given a static array of integers, but the array is split dynamically into two groups depending on a binary string. Each position i contributes its value a[i] either to group 0 or group 1 depending on whether s[i] is 0 or 1. The system supports two operations.

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

CF 1872D - Plus Minus Permutation

We are given a permutation of numbers from 1 to n, and we are allowed to arrange these numbers in any order. Once the arrangement is fixed, we evaluate it using a rule that looks only at certain positions. Two sets of positions matter.

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

CF 1872C - Non-coprime Split

We are given multiple independent queries. Each query provides an interval $[l, r]$, and we need to construct two positive integers $a$ and $b$ such that their sum lies somewhere inside this interval and at the same time $a$ and $b$ share a common divisor greater than one.

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

CF 1872A - Two Vessels

We are given two containers holding real-valued amounts of water. One starts with a, the other with b. We also have a cup that can transfer at most c units of water in a single operation.