Codeforces Round 753 (Div. 3)

Solutions for Codeforces Round 753 (Div. 3) (contest 1607). 1/8 problems verified against sample I/O. Difficulty range: 800-2300.

8 items

Codeforces Round 753 (Div. 3)

Type: Div. 3 | Problems: 8 | Verified: 1/8 | Rating range: 800-2300 | Time: 19m 32s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Linear Keyboard	800	implementation, strings	7m 49s	✗
B	Odd Grasshopper	900	math	1m 44s	✗
C	Minimum Extraction	1000	brute-force, sortings	1m 41s	✗
D	Blue-Red Permutation	1300	greedy, math, sortings	1m 26s	✓
E	Robot on the Board 1	1600	implementation	1m 32s	✗
F	Robot on the Board 2	2300	brute-force, dfs-and-similar, graphs	1m 48s	✗
G	Banquet Preparations 1	2200	greedy	1m 44s	✗
H	Banquet Preparations 2	2200	greedy, sortings, two-pointers	1m 48s	✗

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

CF 1607A - Linear Keyboard

Thank you for providing the sample input and expected output. Let’s go step by step and carefully diagnose the issue. From the input: we see: - The first line 9 represents the number of triples (probably edges or operations). - Each subsequent line has three integers.

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

CF 1607H - Banquet Preparations 2

We are given a series of dishes, each consisting of some grams of fish and some grams of meat. For every dish, a taster will consume a fixed total amount of food, but he can choose how much fish and how much meat to eat from that dish.

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

CF 1607G - Banquet Preparations 1

We are asked to distribute how much a taster eats from several dishes to minimize the imbalance between fish and meat. Each dish contains a certain amount of fish and meat.

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

CF 1607F - Robot on the Board 2

We are asked to find the starting cell on a rectangular board where a robot can move the most number of steps before either leaving the board or revisiting a cell. Each cell has a direction marked, and when the robot enters that cell, it must move in that direction.

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

CF 1607E - Robot on the Board 1

We are asked to place a robot on a rectangular grid and execute a sequence of directional commands. The robot can move left, right, up, or down, and we can choose its starting cell.

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

CF 1607D - Blue-Red Permutation

We are given an array of integers where each element has a color, either blue or red. Blue elements can be decreased by 1 any number of times, while red elements can be increased by 1 any number of times.

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

CF 1607B - Odd Grasshopper

We are asked to simulate the movement of a grasshopper on the number line. The grasshopper starts at some integer coordinate $x0$ and makes jumps at discrete minutes. The jump distances increase by one at each step: first jump is 1, second is 2, third is 3, and so on.

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

CF 1607C - Minimum Extraction

We are given an array of integers and a special operation that changes the array in a very structured way. Each time the operation is applied, we pick one occurrence of the current minimum value, remove it, and then subtract that same value from every remaining element.