Codeforces Round 600 (Div. 2)

5 problems from Codeforces Round 600 (Div. 2) (contest 1253), difficulty 1400-2500. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 600 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1400-2500 | 12m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Silly Mistake	1400	greedy, implementation	11,704	2m 45s
C	Sweets Eating	1500	dp, greedy, math	15,301	1m 43s	✓
D	Harmonious Graph	1700	constructive-algorithms, dfs-and-similar, dsu	10,246	1m 43s	✓
E	Antenna Coverage	2200	data-structures, dp, greedy	3,062	2m 23s
F	Cheap Robot	2500	binary-search, dsu, graphs	2,250	3m 39s

Practice › Codeforces Solutions › Codeforces Round 600 (Div. 2) ›

CF 1253F - Cheap Robot

We are given a weighted undirected connected graph where only a subset of vertices, the first $k$, act as recharge stations. A robot starts at one recharge station and wants to travel to another recharge station.

Practice › Codeforces Solutions › Codeforces Round 600 (Div. 2) ›

CF 1253E - Antenna Coverage

We are given several antennas placed on a number line segment. Each antenna sits at a fixed integer position and initially covers a symmetric interval around it.

Practice › Codeforces Solutions › Codeforces Round 600 (Div. 2) ›

CF 1253D - Harmonious Graph

We are given an undirected graph on vertices labeled from 1 to n, and we are allowed to add edges. The goal is to make the graph satisfy a very specific reachability constraint that depends on the natural ordering of vertices.

Practice › Codeforces Solutions › Codeforces Round 600 (Div. 2) ›

CF 1253B - Silly Mistake

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

Practice › Codeforces Solutions › Codeforces Round 600 (Div. 2) ›

CF 1253C - Sweets Eating

We are given a list of sweets, each with a positive integer value representing its sweetness level. Yui wants to eat exactly $k$ sweets for each $k$ from 1 to $n$. However, she cannot eat more than $m$ sweets in a single day. Time is divided into days starting from day 1.