Educational Codeforces Round 66 (Rated for Div. 2)

7 problems from Educational Codeforces Round 66 (Rated for Div. 2) (contest 1175), difficulty 900-3000. 6/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 66 (Rated for Div. 2)

Div. 2 | 7 problems | 6/7 verified | Difficulty 900-3000 | 19m 39s

#	Problem	Rating	Tags	Accepted	Time	✓
A	From Hero to Zero	900	implementation, math	19,761	3m 42s	✓
B	Catch Overflow!	1600	data-structures, expression-parsing, implementation	12,430	1m 24s	✓
C	Electrification	1600	binary-search, brute-force, greedy	7,259	1m 28s	✓
D	Array Splitting	1900	greedy, sortings	7,063	3m 15s	✓
E	Minimal Segment Cover	2200	data-structures, dfs-and-similar, divide-and-conquer	4,538	1m 38s	✓
F	The Number of Subpermutations	2500	brute-force, data-structures, divide-and-conquer	2,663	6m 21s
G	Yet Another Partiton Problem	3000	data-structures, divide-and-conquer, dp	706	1m 51s	✓

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

CF 1175F - The Number of Subpermutations

We are given a sequence of integers, and we want to count how many contiguous segments behave like a perfect permutation of consecutive integers starting from 1.

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

CF 1175A - From Hero to Zero

We are given a number $n$ and a parameter $k$. Starting from $n$, we want to reach zero using two allowed operations: subtract one, or if the current value is divisible by $k$, replace it with the quotient after dividing by $k$.

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

CF 1175D - Array Splitting

We are given a sequence of numbers and we must cut it into exactly $k$ consecutive parts, where each element belongs to exactly one part and parts preserve order. Once the partition is fixed, every element gets a label equal to the index of the segment it lands in.

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

CF 1175G - Yet Another Partiton Problem

We are asked to partition an array of integers into exactly $k$ contiguous subsegments such that the total weight is minimized. The weight of a segment is defined as its length multiplied by its maximum element. The total weight is the sum of weights over all segments.

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

CF 1175E - Minimal Segment Cover

We are given a collection of line segments on a number line and multiple queries asking about subranges. For each query segment $[x, y]$, we want to know the smallest number of given segments whose union fully covers every real point from $x$ to $y$.

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

CF 1175C - Electrification

We are asked to select an integer point $x$ on a line such that the $(k+1)$-th smallest distance from $x$ to a given set of points is minimized. Each query gives us $n$ sorted integers $a1, a2, dots, an$ representing points on the $OX$ axis, and an integer $k$.

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

CF 1175B - Catch Overflow!

We have a simple program written in a tiny language with three commands: add, which increments a variable x by 1; for n, which starts a loop that repeats the commands inside it n times; and end, which closes a loop.