Codeforces Round 896 (Div. 1)

Solutions for Codeforces Round 896 (Div. 1) (contest 1868). 0/7 problems verified against sample I/O. Difficulty range: 1300-3500.

7 items

Codeforces Round 896 (Div. 1)

Type: Div. 1 | Problems: 7 | Verified: 0/7 | Rating range: 1300-3500 | Time: 15m 55s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Fill in the Matrix	1300	constructive-algorithms, implementation	1m 51s	✗
B1	Candy Party (Easy Version)	1700	bitmasks, constructive-algorithms, graphs	2m	✗
B2	Candy Party (Hard Version)	2100	bitmasks, constructive-algorithms, dp	1m 47s	✗
C	Travel Plan	2400	combinatorics, dp, implementation	3m 26s	✗
D	Flower-like Pseudotree	3000	constructive-algorithms, graphs, greedy	1m 39s	✗
E	Min-Sum-Max	3500	constructive-algorithms, dp, greedy	1m 47s	✗
F	LIS?	3500	data-structures, greedy, implementation	3m 25s	✗

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868F - LIS?

We are given an array of integers. In one move, we are forced to pick a segment whose sum is as large as possible among all subarrays of the current array, and decrease every element in that segment by one.

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868C - Travel Plan

The mismatch is not coming from MEX computation anymore. The segment MEX logic in the previous version is actually fine for this problem scale.

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868E - Min-Sum-Max

We are given an integer array, and we are allowed to split it into several contiguous blocks. Each block has a sum, and we call these block sums a new array. The constraint is not on individual blocks but on every contiguous group of blocks.

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868D - Flower-like Pseudotree

We are given only the degree of each vertex in a graph that is known to be a pseudotree. That means the final graph must be connected and contain exactly one cycle, while having exactly $n$ edges on $n$ vertices.

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868B1 - Candy Party (Easy Version)

We are given an array of integers representing how many candies each person initially holds. The process that follows is a sequence of transfers, where each person will act exactly once as a giver and will choose a single recipient.

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868A - Fill in the Matrix

We are asked to construct an $n times m$ matrix where every row is a permutation of ${0, 1, dots, m-1}$. This already forces a strong structure: each row contains each value exactly once, so the matrix is composed of $n$ rearrangements of the same multiset.

Practice › Codeforces Solutions › Codeforces Round 896 (Div. 1) ›

CF 1868B2 - Candy Party (Hard Version)

We are given a group of people at a party, each initially holding some number of candies. Each person can give a certain number of candies to another person exactly once, with the amount being a power of two and not exceeding the candies they currently hold.