Educational Codeforces Round 146 (Rated for Div. 2)

Solutions for Educational Codeforces Round 146 (Rated for Div. 2) (contest 1814). 2/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Educational Codeforces Round 146 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2700 | Time: 13m 7s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Coins	800	implementation, math	4m 48s	✓
B	Long Legs	1700	brute-force, math	1m 21s	✓
C	Search in Parallel	1500	constructive-algorithms, greedy, sortings	1m 54s	✗
D	Balancing Weapons	2500	binary-search, brute-force, data-structures	1m 37s	✗
E	Chain Chips	2300	data-structures, dp, matrices	2m	✗
F	Communication Towers	2700	brute-force, divide-and-conquer, dsu	1m 27s	✗

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

CF 1814A - Coins

The sample input is: 9 8 means there are 9 numbers in the array and 8 queries. The array is [1,2,4,3,3,5,6,2,1]. Each query asks for something over a range [l, r].

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

CF 1814F - Communication Towers

We are dealing with a network of communication towers connected by wires, where each tower can operate only on a continuous range of frequencies. The towers are numbered from 1 to n, and each tower i can operate on frequencies from li to ri inclusive.

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

CF 1814E - Chain Chips

We are given a line of vertices labeled from 1 to n, where each consecutive pair i and i+1 is connected by an edge with a given weight. Initially, every vertex i holds a chip labeled i, so everything is perfectly aligned.

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

CF 1814D - Balancing Weapons

We are given a set of guns, each with two properties: a fire rate $fi$ and a damage per bullet $di$. The product of these two, $pi = fi cdot di$, is the total firepower of a gun.

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

CF 1814C - Search in Parallel

We are asked to assign boxes with colored balls to two robots in order to minimize the total retrieval time across a series of requests. Each box has an infinite supply of a unique color. When a robot searches for a color, it inspects boxes sequentially from its assigned list.

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

CF 1814B - Long Legs

The robot starts at the origin and initially has leg length 1. At any moment it may either increase its leg length by one, or make a jump of exactly its current leg length along the x-axis or y-axis. The destination is (a, b).