Educational Codeforces Round 156 (Rated for Div. 2)

Solutions for Educational Codeforces Round 156 (Rated for Div. 2) (contest 1886). 4/6 problems verified against sample I/O. Difficulty range: 800-3300.

6 items

Educational Codeforces Round 156 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 800-3300 | Time: 15m 31s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sum of Three	800	brute-force, constructive-algorithms, math	3m 45s	✗
B	Fear of the Dark	1200	binary-search, geometry, math	2m 11s	✓
C	Decreasing String	1600	implementation, strings	2m 31s	✓
D	Monocarp and the Set	2100	combinatorics, data-structures, math	2m 44s	✓
E	I Wanna be the Team Leader	2400	bitmasks, constructive-algorithms, dp	2m 27s	✗
F	Diamond Theft	3300	data-structures, greedy	1m 53s	✓

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

CF 1886F - Diamond Theft

Each camera can be hacked multiple times. A hack performed at second T disables that camera during the interval [T + 1, T + s]. The only moments that matter are the two thefts. Let the first diamond be stolen at time A and the second at time B, with A < B.

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

CF 1886E - I Wanna be the Team Leader

We are given a set of programmers, each with a stress tolerance level, and a set of projects, each with a difficulty.

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

CF 1886D - Monocarp and the Set

Think about the process in reverse. Instead of starting with an empty set and inserting numbers, start with the full set {1,2,…,n} and repeatedly remove one number until only one number remains.

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

CF 1886A - Sum of Three

We are given an integer $n$ and must split it into three numbers whose sum is exactly $n$. The three numbers must satisfy three conditions simultaneously. They must all be positive, they must all be distinct, and none of them may be divisible by $3$.

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

CF 1886C - Decreasing String

We are given a string and asked to generate a sequence of strings by removing exactly one character at a time to make the resulting string lexicographically minimal.

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

CF 1886B - Fear of the Dark

Monocarp starts at the origin $(0,0)$ and wants to reach his home at point $P$. The only illuminated regions come from two lanterns located at points $A$ and $B$. Both lanterns must use the same power $w$, which means each lantern illuminates a disk of radius $w$.