Educational Codeforces Round 46 (Rated for Div. 2)

4 problems from Educational Codeforces Round 46 (Rated for Div. 2) (contest 1000), difficulty 1500-2700. 2/4 solutions verified against sample I/O.

4 items

Educational Codeforces Round 46 (Rated for Div. 2)

Div. 2 | 4 problems | 2/4 verified | Difficulty 1500-2700 | 7m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Light It Up	1500	greedy	6,162	1m 52s	✓
C	Covered Points Count	1700	data-structures, implementation, sortings	8,431	1m 14s	✓
F	One Occurrence	2400	data-structures, divide-and-conquer	4,835	1m 52s
G	Two-Paths	2700	data-structures, dp, trees	715	2m 10s

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

CF 1000G - Two-Paths

We are working on a weighted tree where every vertex has a positive value and every edge has a positive cost. A path is not required to be simple in the usual sense: edges are allowed to be traversed up to two times, and vertices can be visited multiple times.

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

CF 1000F - One Occurrence

We are given a static array and many independent queries, each query asking us to inspect a contiguous segment of the array and return any value that appears exactly once inside that segment. If no such value exists in that segment, the answer is zero.

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

CF 1000B - Light It Up

We are given a time interval from 0 to M during which a lamp is initially on. The lamp has a predefined list of switching moments. At each moment in this list, the lamp flips between on and off instantly.

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

CF 1000C - Covered Points Count

We are given a collection of segments on a very large number line. Each segment covers every integer point between its endpoints, including both ends. Different segments may overlap in arbitrary ways: they can be disjoint, nested, identical, or partially intersecting.