Codeforces Round 751 (Div. 1)

Solutions for Codeforces Round 751 (Div. 1) (contest 1601). 3/6 problems verified against sample I/O. Difficulty range: 1300-3400.

6 items

Codeforces Round 751 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 3/6 | Rating range: 1300-3400 | Time: 17m 29s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Array Elimination	1300	bitmasks, greedy, math	8m 40s	✗
B	Frog Traveler	1900	data-structures, dfs-and-similar, dp	2m 18s	✓
C	Optimal Insertion	2300	data-structures, divide-and-conquer, dp	1m 43s	✗
D	Difficult Mountain	2700	data-structures, dp, greedy	1m 32s	✓
E	Phys Ed Online	2900	data-structures, dp, greedy	1m 46s	✗
F	Two Sorts	3400	binary-search, dfs-and-similar, math	1m 30s	✓

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

CF 1601A - Array Elimination

The reported "Actual output" is completely empty: That means the failure is not an algorithmic mistake in the Reverse Sort logic itself. An algorithmic bug would still print something, just the wrong answer.

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

CF 1601F - Two Sorts

We take all integers from $1$ to $n$ and sort them not by numeric value but by their string representation in lexicographic order, as if they were words.

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

CF 1601E - Phys Ed Online

We have a sequence of days numbered from 1 to n, each with a given ticket cost. Each ticket is valid for k consecutive days once activated.

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

CF 1601D - Difficult Mountain

We are given a set of alpinists, each characterized by two numbers: skill and neatness. The skill indicates the maximum difficulty of a mountain an alpinist can climb, while neatness affects the mountain's difficulty after that alpinist climbs: specifically, if the current…

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

CF 1601B - Frog Traveler

The well has depths from 0 to n, where 0 is the ground and n is the starting position of the frog. Suppose the frog is currently resting at depth i.

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

CF 1601C - Optimal Insertion

We are given two sequences. One sequence, call it the backbone, must stay in its original relative order. The second sequence consists of extra elements that we are allowed to insert anywhere into the backbone, and we may also permute those extra elements arbitrarily before…