Codeforces Round 617 (Div. 3)

7 problems from Codeforces Round 617 (Div. 3) (contest 1296), difficulty 800-2100. 3/7 solutions verified against sample I/O.

7 items

Codeforces Round 617 (Div. 3)

Div. 3 | 7 problems | 3/7 verified | Difficulty 800-2100 | 21m 56s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Array with Odd Sum	800	math	48,323	1m 48s	✓
B	Food Buying	900	math	32,690	2m 13s	✓
C	Yet Another Walking Robot	1500	data-structures, implementation	15,722	3m 7s
D	Fight with Monsters	1500	greedy, sortings	15,095	2m 49s
E1	String Coloring (easy version)	1800	constructive-algorithms, dp, graphs	8,208	2m 3s	✓
E2	String Coloring (hard version)	2000	data-structures, dp	5,450	2m 39s
F	Berland Beauty	2100	constructive-algorithms, dfs-and-similar, greedy	3,091	7m 17s

Practice › Codeforces Solutions › Codeforces Round 617 (Div. 3) ›

CF 1296F - Berland Beauty

We are given a connected network of $n$ stations connected by $n-1$ railway segments, which means the structure is a tree. Each edge in this tree has an unknown integer weight in the range from 1 to $10^6$. We are also given several observations from passengers.

Practice › Codeforces Solutions › Codeforces Round 617 (Div. 3) ›

CF 1296D - Fight with Monsters

We are given a sequence of monsters standing in a fixed order. Each monster has a certain amount of health, and they must be defeated one after another from left to right.

Practice › Codeforces Solutions › Codeforces Round 617 (Div. 3) ›

CF 1296E2 - String Coloring (hard version)

We are given a string and we are allowed to assign a color label to each character position. After coloring, we gain a very specific operation: we may swap two adjacent characters only if their colors are different. Swaps can be repeated arbitrarily many times.

Practice › Codeforces Solutions › Codeforces Round 617 (Div. 3) ›

CF 1296B - Food Buying

We are given an initial amount of money, and we repeatedly perform a very specific type of purchase operation. In each operation, we choose some amount $x$ that we can afford at that moment, spend it, and immediately receive back $lfloor x/10 rfloor$.

Practice › Codeforces Solutions › Codeforces Round 617 (Div. 3) ›

CF 1296E1 - String Coloring (easy version)

We have a string of lowercase letters. Every position must be assigned one of two colors, 0 or 1. After choosing the colors, we are allowed to swap neighboring characters only when their colors are different. We may perform such swaps as many times as we want.

Practice › Codeforces Solutions › Codeforces Round 617 (Div. 3) ›

CF 1296C - Yet Another Walking Robot

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 617 (Div. 3) ›

CF 1296A - Array with Odd Sum

We have an array of integers. An operation allows us to pick two different positions and copy the value from one position into the other. Since we may repeat this operation any number of times, values can be duplicated throughout the array.