Codeforces Round 1077 (Div. 2)

Solutions for Codeforces Round 1077 (Div. 2) (contest 2188). 4/7 problems verified against sample I/O. Difficulty range: 800-3500.

7 items

Codeforces Round 1077 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 4/7 | Rating range: 800-3500 | Time: 11m 9s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Divisible Permutation	800	constructive-algorithms	1m 26s	✓
B	Seats	1000	greedy	2m 3s	✓
C	Restricted Sorting	1300	greedy, sortings	1m 45s	✓
D	Shortest Statement Ever	1800	bitmasks, constructive-algorithms, dp	44s	✗
E	Jerry and Tom	2300	data-structures, dfs-and-similar, games	2m 3s	✓
F	Cool Problem	2600	bitmasks, dp, math	1m 30s	✗
G	Doors and Keys	3500	dp	1m 38s	✗

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188G - Doors and Keys

We are given a line of rooms connected by doors, where each door has a time at which it opens automatically and each room may contain a key. You start in room 1 at time 0, and the goal is to find the minimum time to reach each subsequent room.

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188F - Cool Problem

We are given a string made of characters 0, 1, and ?. Each complete version of this string defines a numerical process that generates a sequence of values. We start from c0 = 0. Then we scan the string from left to right.

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188E - Jerry and Tom

Every vertex has an edge to the next vertex, and possibly one additional long jump to a larger vertex. The extra edges never cross. If we draw every edge above the number line, no two extra edges form the pattern $ui < uj < vi < vj$. Jerry must move every turn.

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188C - Restricted Sorting

We are given an array of integers and asked to find the largest integer $k$ such that the array can be sorted into non-decreasing order by repeatedly swapping any two elements whose difference is at least $k$. If no such $k$ exists, we return $-1$.

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188A - Divisible Permutation

We are asked to construct a rearrangement of the numbers from 1 to n such that adjacent elements satisfy a divisibility condition tied to their position. More concretely, we build an array p of length n containing each integer from 1 to n exactly once.

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188D - Shortest Statement Ever

Working

Practice › Codeforces Solutions › Codeforces Round 1077 (Div. 2) ›

CF 2188B - Seats

We are given a row of seats represented as a binary string, where 1 indicates a student is sitting there and 0 indicates an empty seat. No two students are adjacent initially.