Codeforces Round 568 (Div. 2)

Solutions for Codeforces Round 568 (Div. 2) (contest 1185). 7/9 problems verified against sample I/O. Difficulty range: 800-2600.

9 items

Codeforces Round 568 (Div. 2)

Type: Div. 2 | Problems: 9 | Verified: 7/9 | Rating range: 800-2600 | Time: 43m 5s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Ropewalkers	800	math	10m 56s	✓
B	Email from Polycarp	1200	implementation, strings	1m 26s	✓
C1	Exam in BerSU (easy version)	1200	greedy, sortings	1m 40s	✓
C2	Exam in BerSU (hard version)	1700	brute-force, data-structures, greedy	6m 6s	✓
D	Extra Element	1700	implementation, math	3m 14s	✓
E	Polycarp and Snakes	2000	brute-force, implementation	6m 41s	✗
F	Two Pizzas	2100	bitmasks, brute-force	1m 6s	✓
G1	Playlist for Polycarp (easy version)	2100	bitmasks, combinatorics, dp	5m 13s	✓
G2	Playlist for Polycarp (hard version)	2600	combinatorics, dp	6m 43s	✗

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

CF 1185G2 - Playlist for Polycarp (hard version)

We are given a collection of songs, each song having a duration and a genre label from a small set of three possible genres. We want to build an ordered playlist using some of these songs, with two strict rules.

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

CF 1185G1 - Playlist for Polycarp (easy version)

We are given a small collection of songs. Each song has a duration and a genre, and we want to form an ordered playlist by selecting some of these songs without repetition. The playlist must satisfy three constraints at the same time.

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

CF 1185A - Ropewalkers

Three people stand on an infinite number line at positions $a$, $b$, and $c$. They are allowed to move along the line, but movement is extremely restricted: at each second, exactly one person may move, and that move is always by one unit either left or right.

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

CF 1185E - Polycarp and Snakes

We are given a grid where each cell is either empty or contains a lowercase Latin letter. The final grid is claimed to have been formed by repeatedly drawing “snakes”, where each snake is a straight segment of identical letters placed either horizontally or vertically.

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

CF 1185C2 - Exam in BerSU (hard version)

We are given a fixed sequence of students, each associated with a positive time value. If a student is allowed to pass the exam, they consume that amount of time, and this time accumulates strictly in order.

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

CF 1185D - Extra Element

We are given a sequence of integers that may not be ordered, and we are asked to identify a single element whose removal allows the remaining numbers to form an arithmetic progression.

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

CF 1185F - Two Pizzas

We are asked to help a group of friends pick exactly two pizzas so that the maximum number of friends are satisfied with the choice.

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

CF 1185C1 - Exam in BerSU (easy version)

We are given a sequence of students, each associated with a fixed amount of time they would spend if they successfully pass their exam.

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

CF 1185B - Email from Polycarp

The task is to verify whether a typed word t could plausibly result from pressing the keys of a word s on a keyboard that occasionally repeats letters. Each letter in s must appear in order in t, but it may appear one or more times consecutively.