Educational Codeforces Round 100 (Rated for Div. 2)

Solutions for Educational Codeforces Round 100 (Rated for Div. 2) (contest 1463). 1/6 problems verified against sample I/O. Difficulty range: 1100-3100.

6 items

Educational Codeforces Round 100 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 1100-3100 | Time: 20m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Dungeon	1100	binary-search, math	1m 58s	✓
B	Find The Array	1400	bitmasks, constructive-algorithms, greedy	1m 58s	✗
C	Busy Robot	1800	implementation	2m 11s	✗
D	Pairs	1900	binary-search, constructive-algorithms, greedy	6m 20s	✗
E	Plan of Lectures	2400	constructive-algorithms, dfs-and-similar, dsu	2m 25s	✗
F	Max Correct Set	3100	bitmasks, dp, math	5m 36s	✗

Practice › Codeforces Solutions › Educational Codeforces Round 100 (Rated for Div. 2) ›

CF 1463D - Pairs

We are given the integers from $1$ to $2n$, and we need to form them into $n$ pairs. Once the pairs are formed, we are allowed to select $x$ of them and take the minimum elements from those pairs, while from the remaining $n - x$ pairs we take the maximum elements.

Practice › Codeforces Solutions › Educational Codeforces Round 100 (Rated for Div. 2) ›

CF 1463F - Max Correct Set

We are asked to find the largest subset of the integers from 1 to $n$ such that no two numbers in the subset differ by exactly $x$ or exactly $y$. Conceptually, think of the numbers as positions on a line.

Practice › Codeforces Solutions › Educational Codeforces Round 100 (Rated for Div. 2) ›

CF 1463E - Plan of Lectures

We have a teacher, Ivan, who needs to schedule lectures on n different topics. Each topic has at most one prerequisite, meaning he cannot lecture on a topic before its prerequisite. One topic has no prerequisite.

Practice › Codeforces Solutions › Educational Codeforces Round 100 (Rated for Div. 2) ›

CF 1463C - Busy Robot

A single robot moves on a straight line starting from position zero. You send it a sequence of commands, each specifying a time and a target position. When a command arrives, the robot immediately commits to moving toward that target at unit speed.

Practice › Codeforces Solutions › Educational Codeforces Round 100 (Rated for Div. 2) ›

CF 1463A - Dungeon

We have three monsters with health values a, b, and c. A normal cannon shot deals 1 damage to exactly one living monster. Every seventh shot is special. Instead of targeting a single monster, it deals 1 damage to every monster that is still alive at that moment.

Practice › Codeforces Solutions › Educational Codeforces Round 100 (Rated for Div. 2) ›

CF 1463B - Find The Array

We are given an array of integers $a = [a1, a2, dots, an]$, each between 1 and $10^9$, and we need to construct another array $b$ of the same length. This new array must satisfy three properties. First, each element $bi$ must also lie between 1 and $10^9$.