Educational Codeforces Round 37 (Rated for Div. 2)

7 problems from Educational Codeforces Round 37 (Rated for Div. 2) (contest 920), difficulty 1000-2400. 6/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 37 (Rated for Div. 2)

Div. 2 | 7 problems | 6/7 verified | Difficulty 1000-2400 | 30m 58s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Water The Garden	1000	implementation	8,195	2m 8s	✓
B	Tea Queue	1200	implementation	8,101	5m 21s
C	Swap Adjacent Elements	1400	dfs-and-similar, greedy, math	9,970	2m 30s	✓
D	Tanks	2400	dp, greedy, implementation	809	10m 3s	✓
E	Connected Components?	2100	data-structures, dfs-and-similar, dsu	7,740	2m 56s	✓
F	SUM and REPLACE	2000	brute-force, data-structures, dsu	8,597	3m 26s	✓
G	List Of Integers	2200	binary-search, bitmasks, brute-force	1,997	4m 34s	✓

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

CF 920B - Tea Queue

We are simulating a single-server queue that evolves over time. Each student appears at a known second and joins the end of a line. The server is a teapot that can serve exactly one student per second, and serving always goes to the student currently at the front of the queue.

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

CF 920F - SUM and REPLACE

We are working with an array of integers where two operations are repeatedly applied over ranges. One operation replaces every value in a segment with its number of positive divisors, and the other asks for the sum of values in a segment after all previous updates.

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

CF 920D - Tanks

We have several tanks containing water. A single operation is unusual: when we choose a source tank, we do not decide how much water to take. The scoop automatically takes min(currentamount, K) milliliters from that tank and immediately pours all of it into another tank.

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

CF 920G - List Of Integers

The problem asks us to generate a special list of integers for multiple queries. For a given query with integers x, p, and k, we need to find the k-th integer greater than x that is coprime with p. Coprime means that the greatest common divisor (gcd) of the number and p is 1.

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

CF 920E - Connected Components?

The graph in this problem is not given in the usual way. Instead of listing edges that exist, the input lists pairs of vertices that are explicitly disconnected. Every pair of vertices that does not appear in this list should be treated as having an edge between them.

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

CF 920C - Swap Adjacent Elements

We are given a permutation of size n, meaning every integer from 1 to n appears exactly once. Alongside this array is a string that describes which adjacent positions are “connected” by an allowed swap.

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

CF 920A - Water The Garden

We are given a linear garden with n consecutive beds and a subset of these beds containing water taps. Each tap, once turned on, waters the bed it occupies immediately, and in each subsequent second it extends its coverage by one bed in both directions.