Codeforces Round 886 (Div. 4)

Solutions for Codeforces Round 886 (Div. 4) (contest 1850). 6/8 problems verified against sample I/O. Difficulty range: 800-1700.

8 items

Codeforces Round 886 (Div. 4)

Type: Div. 4 | Problems: 8 | Verified: 6/8 | Rating range: 800-1700 | Time: 13m 14s

Problem	Name	Rating	Tags	Solve Time	Verified
A	To My Critics	800	implementation, sortings	1m 2s	✓
B	Ten Words of Wisdom	800	implementation, sortings	1m 8s	✓
C	Word on the Paper	800	implementation, strings	1m 29s	✓
D	Balanced Round	900	brute-force, greedy, implementation	3m 10s	✗
E	Cardboard for Pictures	1100	binary-search, geometry, implementation	1m 13s	✓
F	We Were Both Children	1300	brute-force, implementation, math	3m	✗
G	The Morning Star	1500	combinatorics, data-structures, geometry	1m 5s	✓
H	The Third Letter	1700	dfs-and-similar, dsu, graphs	1m 7s	✓

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850H - The Third Letter

Each soldier must be assigned an integer coordinate on a number line, and multiple soldiers are allowed to share the same coordinate. Every constraint connects two soldiers and specifies an exact signed distance between their positions.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850F - We Were Both Children

The previous solution is not just buggy in implementation, it is fundamentally misaligned with the structure of the problem.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850D - Balanced Round

We are given a list of problem difficulties, and we are allowed to discard any subset of them and then reorder the remaining ones arbitrarily. After reordering, we want the sequence to be “smooth” in the sense that every adjacent pair differs by at most $k$.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850G - The Morning Star

We are given a set of distinct points on a 2D integer grid. For every ordered pair of points, we imagine placing a compass at the first point and pointing it toward the second point.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850E - Cardboard for Pictures

Each test case describes a collection of square pictures. Every picture with side length $si$ is placed on a larger square cardboard sheet. The cardboard forms a uniform frame of width $w$ around the picture, and also covers the area behind the picture itself.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850C - Word on the Paper

We are given several independent 8 by 8 character grids. Each grid contains dots and lowercase letters, but only one meaningful structure exists inside each grid: a single column contains a vertically written word with no gaps. Every other cell is irrelevant noise.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850B - Ten Words of Wisdom

The task is to find the winning response in a short-answer game show. Each participant submits a response, which has two attributes: the number of words it contains and its quality score.

Practice › Codeforces Solutions › Codeforces Round 886 (Div. 4) ›

CF 1850A - To My Critics

We are asked to work with three digits, call them a, b, and c, each ranging from 0 to 9. The task is to determine if we can pick any two distinct digits among these three so that their sum is at least 10. We repeat this for t independent test cases.